TACO: Efficient SAT-Based Bounded Verification Using Symmetry Breaking and Tight Bounds

@article{Galeotti2013TACOES,
  title={TACO: Efficient SAT-Based Bounded Verification Using Symmetry Breaking and Tight Bounds},
  author={Juan P. Galeotti and Nicol{\'a}s Rosner and Carlos L{\'o}pez Pombo and Marcelo F. Frias},
  journal={IEEE Transactions on Software Engineering},
  year={2013},
  volume={39},
  pages={1283-1307}
}
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specification violations using a SAT-solver. If a violation is found, an execution trace exposing the failure is exhibited. Code involving linked data structures with intricate invariants is particularly hard to analyze using these techniques. In this paper, we present Translation of Annotated COde (TACO), a prototype tool… CONTINUE READING
Highly Cited
This paper has 34 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

Abstract State Machines, Alloy, B, TLA, VDM, and Z

Lecture Notes in Computer Science • 2018
View 10 Excerpts
Highly Influenced

Automated workarounds from Java program specifications based on SAT solving

International Journal on Software Tools for Technology Transfer • 2018
View 10 Excerpts

From Operational to Declarative Specifications Using a Genetic Algorithm

2018 IEEE/ACM 11th International Workshop on Search-Based Software Testing (SBST) • 2018
View 5 Excerpts

Automated Test Generation and Mutation Testing for Alloy

2017 IEEE International Conference on Software Testing, Verification and Validation (ICST) • 2017
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 47 references

Similar Papers

Loading similar papers…