Name
Abstract | ||
|---|---|---|
In specification-based test generation, sometimes having a formal specification is not sufficient, since the specification may be in a different formalism from that required by the generation approach being used. In this paper, we deal with this problem specifically in the context in which, while having a formal specification in the form of an operational invariant written in a sequential programming language, one needs, for test generation, a declarative invariant in a logical formalism. We propose a genetic algorithm that given a catalog of common properties of invariants, such as acyclicity, sortedness and balance, attempts to evolve a conjunction of these that most accurately approximates an original operational specification. We present some details of the algorithm, and an experimental evaluation based on a benchmark of data structures, for which we evolve declarative logical invariants from operational ones.
|
Year | DOI | Venue |
|---|---|---|
2018 | 10.1145/3194718.3194725 | SBST@ICSE |
Keywords | DocType | ISBN |
Declarative Invariants,Operational Invariants,Genetic Algorithms | Conference | 978-1-4503-5741-8 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Facundo Molina | 1 | 2 | 2.71 |
| Renzo Degiovanni | 2 | 18 | 5.03 |
| Germán Regis | 3 | 21 | 7.29 |
| Pablo F. Castro | 4 | 79 | 13.89 |
| Nazareno M. Aguirre | 5 | 119 | 12.03 |
| Marcelo F. Frias | 6 | 295 | 35.57 |