Activities per year
Abstract
In this work we provide an algorithm capable of searching for semantic clones in CLP program code. Two code fragments are considered semantically cloned (at least to some extent) when they can both be transformed into a single code fragment thus representing the functionality that is shared between the fragments. While the framework of what constitutes such semantic clones has been established before, it is parametrized by a set of admissible program transformations and no algorithm exists that effectively performs the search with a concrete set of allowed transformations. In this work we use the well-known unfolding and slicing transformations to establish such an algorithm, and we show how the generalization of CLP goals can be a driving factor both for controlling the search process (i.e. keeping it finite) as for guiding the search (i.e. choosing what transformation(s) to apply at what moment).
Original language | English |
---|---|
Pages (from-to) | 228-242 |
Number of pages | 15 |
Journal | Lecture Notes in Computer Science |
Volume | 12042 |
DOIs | |
Publication status | Published - 21 Apr 2020 |
Fingerprint Dive into the research topics of 'Generalization-Driven Semantic Clone Detection in CLP'. Together they form a unique fingerprint.
Activities
-
Generalization-driven semantic clone detection in CLP
Gonzague Yernaux (Speaker) & Wim Vanhoof (Speaker)
9 Oct 2019Activity: Talk or presentation types › Oral presentation
-
29th International Symposium on Logic-Based Program Synthesis and Transformation
Gonzague Yernaux (Participant) & Wim Vanhoof (Participant)
8 Oct 2019 → 10 Oct 2019Activity: Participating in or organising an event types › Participation in conference