Parallel bounded analysis in code with rich invariants by refinement of field bounds

2013 International Symposium on Software Testing and Analysis, ISSTA 2013 - Proceedings

Volumn , Issue , 2013, Pages 23-33

  Rosner, Nicolás ^a   Galeotti, Juan ^b   Bermúdez, Santiago ^c   Blas, Guido Marucci ^c   De Rosso, Santiago Perez ^c   Pizzagalli, Lucas ^c   Zemín, Luciano ^c   Frias, Marcelo F ^c  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b SAARLAND UNIVERSITY   (Germany)

^c INSTITUTO TECNOLÓGICO DE BUENOS AIRES   (Argentina)

Author keywords

Alloy; DynAlloy; SAT based code analysis; Static analysis

Indexed keywords

CODE ANALYSIS; COMMODITY CLUSTERS; DYNALLOY; NOVEL TECHNIQUES; RELATIONAL SEMANTICS; SEQUENTIAL ANALYSIS; SOUNDNESS AND COMPLETENESS; SYMMETRY-BREAKING;

ALLOYING; CERIUM ALLOYS; SOFTWARE TESTING; TOOLS;

STATIC ANALYSIS;

EID: 84881297949     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2483760.2483770     Document Type: Conference Paper

References (32)

1. Abad P., Aguirre N., Bengolea V., Ciolek D., Frias M.F., Galeotti J., Maibaum T., Moscato M., Rosner N., Vissani I., Tight Bounds + Incremental SAT = Better Test Generation under Rich Contracts, to appear in Proceedings of ICST 2013.
2. Belt, J., Robby and Deng X., Sireum/Topi LDP: A Lightweight Semi-Decision Procedure for Optimizing Symbolic Execution-based Analyses, FSE 2009, pp. 355-364.
3. Dolby J., Vaziri M., Tip F., Finding Bugs Efficiently with a SAT Solver, in ESEC/FSE'07, pp. 195-204, ACM Press, 2007.
4. Bouillaguet Ch., Kuncak V., Wies T., Zee K., Rinard M.C., Using First-Order Theorem Provers in the Jahob Data Structure Verification System. VMCAI 2007, pp. 74-88.
5. Chandrasekhar Boyapati, Sarfraz Khurshid, Darko Marinov: Korat: automated testing based on Java predicates. ISSTA 2002: 123-133.
6. Chalin P., Kiniry J.R., Leavens G.T., Poll E. Beyond Assertions: Advanced Specification and Verification with JML and ESC/Java2. FMCO 2005: 342-363.
7. Wahid Chrabakh and Rich Wolski, GrADSAT: A Parallel SAT Solver for the Grid, in UCSB Computer Science Technical Report Number 2003-05.
8. Cuervo-Parrino B., Galeotti J.P., Garbervetsky D., Frias M.F., A dataflow analysis to improve SAT-based program verification, to appear in Proceedings of SEFM 2011.
9. Deng, X., Robby, Hatcliff, J., Towards A Case-Optimal Symbolic Execution Algorithm for Analyzing Strong Properties of Object-Oriented Programs, in SEFM 2007, pp. 273-282.
10. Dennis, G., Chang, F., Jackson, D., Modular Verification of Code with SAT. in ISSTA'06, pp. 109-120, 2006.
11. Flanagan, C., Leino, R., Lillibridge, M., Nelson, G., Saxe, J., Stata, R., Extended static checking for Java, In PLDI 2002, pp. 234-245.
12. Juan P. Galeotti, Nicolás Rosner, Carlos López Pombo, Marcelo F. Frias: Analysis of invariants for efficient bounded verification. ISSTA 2010: 25-36.
13. Juan P. Galeotti, Nicolás Rosner, Carlos López Pombo, Marcelo F. Frias: TACO: Efficient SAT-Based Bounded Verification Using Symmetry Breaking and Tight Bounds, submitted to IEEE TSE, 2013.
14. Luís Gil, Paulo Flores and Luís Miguel Silveira: PMSat: a parallel version of MiniSAT, Journal on Satisfiability, Boolean Modeling and Computation 6 (2008) 71-98.
15. Daniel Jackson, Ian Schechter, and Ilya Shlyakhter. Alcoa: the alloy constraint analyzer. In Proceedings of International Conference on Software Engineering, Limerick, Ireland, 2000.
16. Jackson, D., Software Abstractions. MIT Press, 2006.
17. Jackson, D., Vaziri, M., Finding bugs with a constraint solver, in ISSTA'00, pp. 14-25, 2000.
18. Khurshid S. and Marinov D., TestEra: Specification-Based Testing of Java Programs Using SAT., Automated Software Engineering 11(4): 403-434 (2004)
19. Leino K.R.M., Specification and verification of Object-Oriented Software, Lecture Notes from Marktoberdorf International Summer School 2008.
20. Kei Ohmura and Kazunori Ueda, c-sat: A Parallel SAT Solver for Clusters, in SAT 2009, LNCS 5585, 2009.
21. Danhua Shao, Divya Gopinath, Sarfraz Khurshid, Dewayne E. Perry, Optimizing Incremental Scope-Bounded Checking with Data-Flow Analysis. ISSRE 2010: 408-417.
22. Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry: An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method. FM 2009: 757-772.
23. Rohan Sharma, Milos Gligoric, Andrea Arcuri, Gordon Fraser, Darko Marinov: Testing Container Classes: Random or Systematic? FASE 2011: 262-277.
24. Siddiqui J.H., and Khurshid S., PKorat: Parallel Generation of Structurally Complex Test Inputs, in Proceedings of ICST'09.
25. Matt Staats, Corina S. Pasareanu: Parallel symbolic execution for structural test generation. ISSTA 2010: 183-194
26. Torlak E., Jackson, D., Kodkod: A Relational Model Finder. in TACAS '07, LNCS 4425, pp. 632-647.
27. Vaziri, M., Jackson, D., Checking Properties of Heap-Manipulating Procedures with a Constraint Solver, in TACAS 2003, pp. 505-520.
28. Visser W., Havelund K., Brat G., Park S. and Lerda F., Model Checking Programs, ASE Journal, Vol.10, N.2, 2003.
29. Visser W., Pǎsǎreanu C. S., Pelánek R., Test Input Generation for Java Containers using State Matching, in ISSTA 2006, pp. 37-48, 2006.
30. Hantao Zhang, Maria Paola Bonacina, and Jieh Hsiang. 1996. PSATO: a distributed propositional prover and its application to quasigroup problems. J. Symb. Comput. 21, 4-6 (June 1996).
31. http://www.mfrias.com.ar/
32. http://cecar.fcen.uba.ar/