Analysis of invariants for efficient bounded verification

ISSTA'10 - Proceedings of the 2010 International Symposium on Software Testing and Analysis

Volumn , Issue , 2010, Pages 25-35

  Galeotti, Juan P ^a   Rosner, Nicolás ^a   Pombo, Carlos G López ^a   Frias, Marcelo F ^b  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

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

Author keywords

Alloy; DynAlloy; KodKod; SAT based code analysis; Static analysis

Indexed keywords

AUTOMATED TECHNIQUES; CODE ANALYSIS; DYNALLOY; EXECUTION TRACE; KODKOD; LINKED DATA STRUCTURES; ORDERS OF MAGNITUDE; PROPOSITIONAL FORMULAS; PROPOSITIONAL VARIABLES; PROTOTYPE TOOLS; SAT SOLVERS; SAT-BASED BOUNDED VERIFICATION; SAT-SOLVING; SEQUENTIAL PROGRAMS; SYMMETRY-BREAKING; TIGHT BOUND;

COMPUTER SOFTWARE SELECTION AND EVALUATION; DATA STRUCTURES; JAVA PROGRAMMING LANGUAGE; SOFTWARE TESTING; STATIC ANALYSIS;

MODEL CHECKING;

EID: 77955877107     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1831708.1831712     Document Type: Conference Paper

References (32)

1. Andoni, A., Daniliuc, D., Khurshid, S. and Marinov, D., Evaluating the "Small Scope Hypothesis", downloadable from http://sdg.csail.mit.edu/ publications.html.
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. 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.
4. Boyapati C., Khurshid S., Marinov D., Korat: automated testing based on Java predicates, in ISSTA 2002, pp. 123-133.
5. 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.
6. Clarke E., Kroening D., Lerda F., A Tool for Checking ANSI-C Programs, in TACAS 2004, LNCS 2988, pp. 168-176.
7. deMillo R. A., Lipton R. J., Sayward F. G., Hints on Test Data Selection: Help for the Practicing Programmer, in IEEE Computer pp. 34-41, April 1978.
8. 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.
9. Dennis, G., Chang, F., Jackson, D., Modular Verification of Code with SAT. in ISSTA'06, pp. 109-120, 2006.
10. Dennis, G., Yessenov, K., Jackson D., Bounded Verification of Voting Software. in VSTTE 2008. Toronto, Canada, October 2008.
11. Dolby J., Vaziri M., Tip F., Finding Bugs Efficiently with a SAT Solver, in ESEC/FSE'07, pp. 195-204, ACM Press, 2007.
12. Flanagan, C., Leino, R., Lillibridge, M., Nelson, G., Saxe, J., Stata, R., Extended static checking for Java, In PLDI 2002, pp. 234-245.
13. Frias, M. F., Galeotti, J. P., Lopez Pombo, C. G., Aguirre, N., DynAlloy: Upgrading Alloy with Actions, in ICSE'05, pp. 442-450, 2005.
14. Frias, M. F., Lopez Pombo, C. G., Galeotti, J. P., Aguirre, N., Efficient Analysis of DynAlloy Specifications, in ACM-TOSEM, Vol. 17(1), 2007.
15. Galeotti, J. P., Frias, M. F., DynAlloy as a Formal Method for the Analysis of Java Programs, in Proceedings of IFIP Working Conference on Software Engineering Techniques, Warsaw, 2006, Springer.
16. Iosif R., Symmetry Reduction Criteria for Software Model Checking. SPIN 2002: 22-41
17. Ivančić, F., Yang, Z., Ganai, M.K., Gupta, A., Shlyakhter, I., Ashar, P., F-Soft: Software Verification Platform. In CAV'05, pp. 301-306, 2005.
18. Jackson, D., Software Abstractions. MIT Press, 2006.
19. Jackson, D., Vaziri, M., Finding bugs with a constraint solver, in ISSTA'00, pp. 14-25, 2000.
20. Khurshid, S., Marinov, D., Jackson, D., An analyzable annotation language. In OOPSLA 2002, pp. 231-245.
21. Khurshid, S., Marinov, D., Shlyakhter, I., Jackson, D., A Case for Efficient Solution Enumeration, in SAT 2003, LNCS 2919, pp. 272-286.
22. Ma Y-S., Offutt J. and Kwon Y-R., MuJava: An Automated Class Mutation System, Journal of Software Testing, Verification and Reliability, 15(2):97-133, 2005.
23. Musuvathi M., Dill, D. L., An Incremental Heap Canonicalization Algorithm, in SPIN 2005: 28-42
24. Rugina, R., Rinard, M. C., Symbolic bounds analysis of pointers, array indices, and accessed memory regions, in PLDI 2000, pp. 182-195, 2000.
25. S. Sagiv, T. W. Reps, R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM TOPLAS 24(3): 217-298 (2002)
26. Siddiqui, J. H., Khurshid, S., An Empirical Study of Structural Constraint Solving Techniques, in ICFEM 2009, LNCS 5885, 88-106, 2009.
27. Torlak E., Jackson, D., Kodkod: A Relational Model Finder. in TACAS '07, LNCS 4425, pp. 632-647.
28. Vaziri, M., Jackson, D., Checking Properties of Heap-Manipulating Procedures with a Constraint Solver, in TACAS 2003, pp. 505-520.
29. Visser W., Havelund K., Brat G., Park S. and Lerda F., Model Checking Programs, ASE Journal, Vol.10, N.2, 2003.
30. 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.
31. Visser W., Private communication, February 2nd., 2010.
32. Xie, Y., Aiken, A., Saturn: A scalable framework for error detection using Boolean satisfiability. in ACM TOPLAS, 29(3): (2007).