Conference item icon

Conference item

Anti-unification algorithms and their applications in program analysis

Abstract:

A term t is called a template of terms t 1 and t 2 iff t 1∈=∈tη 1 and t 2∈= ∈tη 2, for some substitutions η 1 and η 2. A template t of t 1 and t 2 is called the most specific iff for any template t' of t 1 and t 2 there exists a substitution ξ such that t∈=∈t'ξ. The anti-unification problem is that of computing the most specific template of two given terms. This problem is dual to the well-known unification problem, which is the computing of the most general instance of terms. Unification is ...

Expand abstract
Publication status:
Published
Version:
Accepted Manuscript

Actions


Access Document


Files:
Publisher copy:
10.1007/978-3-642-11486-1_35

Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Role:
Author
ORCID:
0000-0002-8886-6129
Publisher:
Springer Publisher's website
Publication date:
2010-04-26
DOI:
ISSN:
0302-9743 and 1611-3349
Pubs id:
pubs:550210
URN:
uri:481f74f3-7003-4746-a28e-9a1aabb45a43
UUID:
uuid:481f74f3-7003-4746-a28e-9a1aabb45a43
Local pid:
pubs:550210
ISBN:
3642114857
Keywords:

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP