Conference Paper (published)
Details
Citation
Swan J, Harman M, Ochoa G & Burke E (2012) Generic Software Subgraph Isomorphism. In: 4th Symposium on Search Based-Software Engineering, Riva del Garda, Trento, Italy, September 28th-30th 2012: Fast Abstracts. 4th Symposium on Search Based Software Engineering (4th SSBSE). Trento, Italy: Fondazione Bruno Kessler Press, pp. 43-48. http://selab.fbk.eu/ssbse2012/index.php?p=program
Abstract
The omnipresence of software graphs as useful intermediate representations means that the identification of near-match subgraphs (Error-Correcting Subgraph Isomorphism) has diverse and widespread applications in software engineering, such as querying, clone detection and model checking. Each software engineering subarea has developed specific tailored approaches to subgraph isomorphism, thereby reducing comparability and generality, and potentially yielding sub-optimal results. We introduce a generic tabu-search formulation, facilitating the incorporation of software engineering domain knowledge and present initial results for our approach.
Notes
Output Type: Meeting Abstract
| Status | Published |
|---|---|
| Publication date | 31/12/2012 |
| Publisher | Fondazione Bruno Kessler Press |
| Publisher URL | http://selab.fbk.eu/ssbse2012/index.php?p=program |
| Place of publication | Trento, Italy |
| ISBN | 978-88-905389-9-5 |
| Conference | 4th Symposium on Search Based Software Engineering (4th SSBSE) |
People (1)
Professor, Computing Science