Name
Abstract | ||
|---|---|---|
In previous work, we presented TACO, a tool for efficient bounded verification. TACO translates programs annotated with contracts to a SAT problem which is then solved resorting to off-the-shelf SAT-solvers. TACO may deem propositional variables used in the description of a program initial states as being unnecessary. Since the worst-case complexity of SAT (a known NP problem) depends on the number of variables, most times this allows us to obtain significant speed ups. In this article, we present TacoFlow, an improvement over TACO that uses dataflow analysis in order to also discard propositional variables that describe intermediate program states. We present an extensive empirical evaluation that considers the effect of removing those variables at different levels of abstraction, and a discussion on the benefits of the proposed approach. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s10270-014-0401-9 | Software and Systems Modeling (SoSyM) |
Keywords | Field | DocType |
SAT-based verification, Dataflow analysis, Java-like programs verification | Most Times,Programming language,Abstraction,Computer science,Sat problem,Theoretical computer science,P versus NP problem,Dataflow,Propositional variable,Bounded function | Journal |
Volume | Issue | ISSN |
14 | 1 | 1619-1374 |
Citations | PageRank | References |
2 | 0.37 | 27 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bruno Cuervo Parrino | 1 | 7 | 0.82 |
| Juan Pablo Galeotti | 2 | 147 | 9.54 |
| Diego Garbervetsky | 3 | 219 | 21.72 |
| Marcelo F. Frias | 4 | 295 | 35.57 |