A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
This paper describes an approach to detecting 'similar' code based on the notion of anti-unification, or least-general common abstraction. ... The similar code detection algorithm and refactorings are integrated within Wrangler, a tool developed at the University of Kent for interactive refactoring of Erlang programs. ... This research is supported by EU FP7 collaborative project ProTest (http: //www.protest-project.eu/), grant number 215868; we thank our funders and colleagues for their support and collaboration. ...doi:10.1007/978-3-642-11503-5_10 fatcat:kxekmlyifjdfvnva2hnfkywn4a
Lecture Notes in Computer Science
The clone detection algorithm proposed in this paper achieves 100% precision, high recall rate, and is user-customisable regarding the granularity of the clone classes reported. ... This paper describes an approach to incrementally detecting 'similar' code based on the notion of least-general common abstraction, or anti-unification, as well as a framework for user-controlled incremental ... Wrangler is implemented in Erlang, and downloadable from http://www.cs.kent.ac.uk/projects/wrangler/Home.html. Terminology Anti-unification and Unification. ...doi:10.1007/978-3-642-19811-3_25 fatcat:yv7zfsztazfrpnvpl2an2qhb3e
Hammond, Finding parallel functional pearls: Automatic parallel recursion scheme detection in Haskell functions via anti-unification, Future Generation Computer Systems (2017), http://dx. ... Unusually, we exploit anti-unification to expose these recursion schemes from source-level definitions whose structures match a recursion scheme, but which are not necessarily written directly in terms ... COST Action IC1202 (TACLe), supported by COST (European Cooperation in Science and Technology), by EP-SRC grant "Discovery: Pattern Discovery and Program Shaping for Manycore Systems" (EP/P020631/1), ...doi:10.1016/j.future.2017.07.024 fatcat:4wqcumg2nja7po2sj6e4i5kdtq
Anti-unification is the dual problem of unification in which one computes the most specific generalization of two terms. It has application to inductive infer- ence and theorem proving. ... Summary: “In this paper we present optimal processor x time par- allel algorithms for term matching and anti-unification of terms represented as trees. ...
This paper presents an approach to help designers create their own application-specific gestures and evaluate them in user-studies based on low fidelity prototypes of the application they are designing ... In order to learn custom gestures, we developed a machine learning tool that uses an anti-unification algorithm to learn based on samples of the gesture provided by the designer. ... line or if it is a closed loop) and returns these primitives to the anti-unification algorithm. ...doi:10.1109/raise.2012.6227967 dblp:conf/icse/AlcantaraDFM12 fatcat:4bdxkvqpmrfzzlrvlrw342qwha
Anti-unification in logic programming refers to the process of capturing common syntactic structure among given goals, computing as such a single new goal that is more general and hence called a generalization ... We subsequently revisit an abstraction of the largest common generalization when anti-unification is based on injective variable renamings, and prove that it can be computed in polynomially bounded time ... Anti-unification constitutes a useful tool in various contexts ranging from program analysis techniques (including partial evaluation, refactoring, automatic theorem proving, program transformation, formal ...arXiv:2107.00341v1 fatcat:qwhvtoygn5fw5el3g7njvhy3qu
The anti-unification problem of two hedgess 1 ands 2 is concerned with finding their generalization, a hedgeq such that boths 1 ands 2 are instances ofq under some substitutions. ... We study anti-unification for unranked terms and hedges that may contain term and hedge variables. ... We saw how certain known generalization problems fall into the class of specific instances of R-generalization in this way. Acknowledgments ...doi:10.1007/s10817-013-9285-6 fatcat:zhw7vmslrbgwbmp5wjeqbyljty
We present a rule-based Huet's style anti-unification algorithm for simply typed lambda-terms, which computes a least general higher-order pattern generalization. ... For a pair of arbitrary terms of the same type, such a generalization always exists and is unique modulo α-equivalence and variable renaming. ... reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. ...doi:10.1007/s10817-016-9383-3 pmid:30174364 pmcid:PMC6109779 fatcat:g7mvr2b7c5fmlp74pta5ymrg7e
Pietrzykowski, Causes for events: their computa- tion and applications (pp. 608-621); Zohar Manna and Richard Waldinger, How to clear a block: plan formation in situational logic (pp. 622-640); Jonathan ... Agayan, Optimal algorithms for fast orthogonal transforms and their realization on a computer (pp. 231-319). ...
A simple and intuitive abstract unification algorithm is presented, providing the core of a correct and precise sharing and freeness analysis for logic programs. ... Our contribution is not only a correct algorithm, but perhaps primarily, the application of a systematic approach in which it is derived by mimicking each step in a suitable concrete unification algorithm ... Our abstract unification algorithm formalizes this reasoning. Early proposals for freeness analysis in logic programs include [10, 16] . ...doi:10.1016/0743-1066(95)00120-4 fatcat:ku3k5h4g7jdlnehgoj3i5rrjxm
Anti-unification in a restricted version of λ2 (a second-order λ-calculus with type variables ) has been studied in  with applications in analogical programming and analogical theorem proving. ... Complexity analysis (in Sect. 4): The algorithm computes a least general pattern generalization, which always exists and is unique modulo α-equivalence, in cubic time and requires linear space. ... This research has been partially supported by the projects HeLo (TIN2012-33042) and TASSAT (TIN2010-20967-C04-01), by the Austrian Science Fund (FWF) with the project SToUT (P 24087-N18) and by the Generalitat ...doi:10.4230/lipics.rta.2013.113 dblp:conf/rta/BaumgartnerKLV13 fatcat:eve7aldrfnfk5dih3vnwctsya4
In the context of programming languages based on parametric polymorphism and uniform data representation, we propose a relation of compatibility between (unmarshalled) memory graphs and types. ... We have shown that the proposed algorithm is sound and semi-complete in presence of algebraic data types, mutable data, polymorphic sharing, cycles, and functional values, however, in its general form, ... Their anti-unifier is ∀α. Tree(α). ...doi:10.1145/2364527.2364569 dblp:conf/icfp/HenryMCM12 fatcat:jt7r5tdf2jcijk4pbx7yuut24q
Lecture Notes in Computer Science
We present an application to incident reports in an SAP business information system. ... Several variants of structure generalisation algorithms were realised and performance for an example test base was evaluated with promising results. ... An evaluation of these realisations and a comparison with the inductive logic programming algorithm Foil for a set of sample incidents is presented. ...doi:10.1007/978-3-642-13025-0_35 fatcat:eat43ncerzhx3gfzgcjwyubymu
In this work we address the problem of anti-unification in CLP, where goals can be seen as unordered sets of atoms and/or constraints. ... Initial experiments show that even a naive implementation of our algorithm produces acceptable generalizations in an efficient way. ... Acknowledgments We thank anonymous reviewers for their constructive input and remarks. ...doi:10.1017/s1471068419000188 fatcat:7mnd6omtwfh5paee67gxik37iu
Aeronautics embedded systems, for example, use square root and divisions in conflict detection and resolution algorithms. ... Section 5 presents an application of this transformation to a conflict detection algorithm from the ACCoRD 2 framework. ... Given two terms t 1 and t 2 , an anti-unification algorithm computes a term t and two substitutions σ 1 and σ 2 such that tσ 1 = t 1 and tσ 2 = t 2 . ...doi:10.1016/j.entcs.2015.10.012 fatcat:l2hnyqpftzgjfbeu3jqfhbuo6u
« Previous Showing results 1 — 15 out of 3,980 results