Programs expressed using logic representations can be more easily analysed and transformed. Transformations will depend on the target language semantics. A field encapsulation refactorization will be different for a Java program and an Eiffel program. Logic based representations of programs and its metamodel allows writing generic rules capable of performing some language independent transformations like: syntactical and semantical checking, searching specific nodes, cloning node structures, replacing references, generating fact visualizations. An example is given in this sense related to the implementation of feature body exheritance mechanism of reverse inheritance class relationship in the context of Eiffel language.
@InProceedings{Chirila2010AQTR,
author = {Ciprian-Bogdan Chirila and C\u{a}lin Jebelean and G\"{u}nter Kniesel and Philippe Lahire},
title = {Generic rules for logic representation transformations},
crossref = {},
key = {},
booktitle = {2010 IEEE International Conference on Automation Quality and Testing Robotics (AQTR)},
pages = {142-147},
year = {2010},
editor = {Liviu Miclea and Ioan Stoian},
volume = {III},
number = {},
series = {},
isbn = {978-1-4244-6724-2},
address = {Cluj-Napoca},
month = {May},
day = {29},
organization = {Universitatea Tehnic\u{a} Cluj},
publisher = {Insitute of Electrical and Electronics Engineers, Inc.},
note = {IEEE Catalog Number: CFP10AQT-PRT},
annote = {},
}
[Chirila2010AQTR] - Ciprian-Bogdan Chirila, Calin Jebelean, Gunter Kniesel, Philippe Lahire. Generic rules for logic representation transformations, 2010 IEEE International Conference on Automation Quality and Testing Robotics AQTR, volume III, pp. 142--147, ISBN 978-1-4244-6724-2, Cluj-Napoca, May, 2010
[Chirila2010AQTR] - Ciprian-Bogdan Chirila, Calin Jebelean, Gunter Kniesel, Philippe Lahire. Generic rules for logic representation transformations, 2010 IEEE International Conference on Automation Quality and Testing Robotics AQTR, volume III, pp. 142--147, ISBN 978-1-4244-6724-2, Cluj-Napoca, May, 2010