Using dynamic analysis to generate disjunctive invariants

Proceedings - International Conference on Software Engineering

Volumn , Issue 1, 2014, Pages 608-619

  Nguyen, ThanhVu ^a   Kapur, Deepak ^a   Weimer, Westley ^b   Forrest, Stephanie ^a  

^a UNIVERSITY OF NEW MEXICO   (United States)

^b University of Virginia   (United States)

Author keywords

disjunctive invariants; invariant generation; Program analysis; static and dynamic analyses; theorem proving

Indexed keywords

COMPUTATION THEORY; DYNAMIC ANALYSIS; NUMERICAL METHODS; SEMANTICS; SOFTWARE ENGINEERING;

COMPUTATIONAL COSTS; DISJUNCTIVE INVARIANTS; DYNAMIC INVARIANTS; INVARIANT GENERATIONS; PROGRAM ANALYSIS; PROGRAM INVARIANTS; PROGRAM VERIFICATION; STATIC AND DYNAMIC ANALYSIS;

THEOREM PROVING;

EID: 84994176576     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2568225.2568275     Document Type: Conference Paper

References (43)

1. X. Allamigeon, S. Gaubert, and E. Goubault. Inferring min and max invariants using max-plus polyhedra. In Static Analysis, pages 189-204. Springer, 2008.
2. X. Allamigeon and R. D. Katz. Minimal external representations of tropical polyhedra. Journal of Combinatorial Theory, Series A, 120 (4): 907-940, 2013.
3. T. Ball and S. K. Rajamani. Automatically validating temporal safety properties of interfaces. In SPIN Workshop on Model Checking of Software, pages 103-122, May 2001.
4. B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Mine, D. Monniaux, and X. Rival. A static analyzer for large safety-critical software. In Programming Languages Design and Implementation, pages 196-207, 2003.
5. E. R. Carbonell. Automatic Generation of Polynomial Invariants for System Verification. PhD thesis, Technical University of Catalonia (UPC), Barcelona, 2006.
6. E. R. Carbonell and D. Kapur. Generating all polynomial invariants in simple loops. Journal of Symbolic Computation, 42 (4): 443-476, 2007.
7. J.-P. Comet. Application of max-plus algebra to biological sequence comparisons. Theoretical computer science, 293 (1): 189-217, 2003.
8. P. Cousot and R. Cousot. Abstract interpretation: a unied lattice model for static analysis of programs by construction or approximation of xpoints. In Principles of Programming Languages, pages 238-252, 1977.
9. P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Mine, D. Monniaux, and X. Rival. The Astree analyzer. In European Symposium on Programming, pages 21-30, 2005.
10. P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Mine, D. Monniaux, and X. Rival. The Astree analyzer. In Proc. of The European Symposium on Programming (ESOP'05), volume 3444 of Lecture Notes in Computer Science (LNCS), pages 21-30. Springer, Apr. 2005.
11. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Principles of Programming Languages, pages 84-96, 1978.
12. M. Daniel-Cavalcante, M. F. Magalhaes, and R. Santos-Mendes. The max-plus algebra and the network calculus. In Discrete Event Systems, 2006 8th International Workshop on, pages 433-438. IEEE, 2006.
13. M. Das, S. Lerner, and M. Seigle. ESP: path-sensitive program verification in polynomial time. SIGPLAN Notices, 37 (5): 57-68, 2002.
14. L. De Moura and N. Bj-rner. Z3: An eficient SMT solver. In Tools and Algorithms for the Construction and Analysis of Systems, pages 337-340. Springer, 2008. http: //research. microsoft.com/en-us/um/ redmond/projects/z3/.
15. D. L. Detlefs, K. R. M. Leino, G. Nelson, and J. B. Saxe. Extended static checking. 1998.
16. E. W. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs. Communication ACM, 18: 453-457, 1975.
17. A. F. Donaldson, L. Haller, D. Kroening, and P. Rummer. Software verification using k-induction. In Static Analysis Symposium, pages 351-368, 2011.
18. M. D. Ernst, W. G. Griswold, Y. Kataoka, and D. Notkin. Dynamically discovering program invariants involving collections. University of Washington, TR UW-CSE-99-11-02, 2000.
19. M. D. Ernst, J. H. Perkins, P. J. Guo, S. McCamant, C. Pacheco, M. S. Tschantz, and C. Xiao. The Daikon system for dynamic detection of likely invariants. Science of Computer Programming, 2007.
20. S. Gulwani. Program verification as probabilistic inference. In Principles of Programming Languages, pages 277-289. ACM, 2007.
21. B. Heidergott and J. W. van der Woude. Max Plus at work: modeling and analysis of synchronized systems: a course on Max-Plus algebra and its applications, volume 13. Princeton University Press, 2006.
22. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Principles of Programming Languages, pages 58-70, 2002.
23. B. Jeannet. Interproc analyzer for recursive programs with numerical variables. INRIA, software and documentation are available at the following URL: http: //pop-art. inrialpes. fr/interproc/interprocweb. cgi. Last accessed, pages 06-11, 2010.
24. D. Jovanovific and L. De Moura. Solving non-linear arithmetic. In Automated Reasoning, pages 339-354. Springer, 2012.
25. T. Kahsai, Y. Ge, and C. Tinelli. Instantiation-based invariant discovery. In NASA Formal Methods, pages 192-206. Springer, 2011.
26. T. Kahsai and C. Tinelli. PKIND: a parallel k-induction based model checker. In J. Barnat and K. Heljanko, editors, Proceedings of 10th International Workshop on Parallel and Distributed Methods in veri-Cation (Snowbird, Utah, USA), Electronic Proceedings in Theoretical Computer Science, pages 55-62, 2011.
27. D. Kapur, Z. Zhang, M. Horbach, H. Zhao, Q. Lu, and T. Nguyen. Geometric Quantier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants. In M. Bonacina and M. Stickel, editors, Automated Reasoning and Mathematics: Essays in Memory of William W. McCune, volume 7788 of Lecture Notes in Computer Science, pages 189-228. Springer, 2013.
28. K. R. M. Leino. This is Boogie 2. Manuscript KRML, 178, 2008.
29. X. Leroy. Formal certification of a compiler back-end or: programming a compiler with a proof assistant. In Principles of Programming Languages, pages 42-54, 2006.
30. A. Mine. Weakly relational numerical abstract domains. PhD thesis, PhD thesis, Ecole Polytechnique, Palaiseau, France, 2004.
31. T. Nguyen, D. Kapur, W. Weimer, and S. Forrest. Using Dynamic Analysis to Discover Polynomial and Array Invariants. In International Conference on Software Engineering, pages 683-693. IEEE, 2012.
32. T. Nguyen, D. Kapur, W. Weimer, and S. Forrest. DIG: A Dynamic Invariant Generator for Polynomial and Array Invariants. ACM Transactions on Software Engineering and Methodology, to appear, 2014.
33. J. W. Nimmer and M. D. Ernst. Static verification of dynamically detected program invariants: Integrating Daikon and ESC/Java. Electr. Notes Theor. Comput. Sci., 55 (2): 255-276, 2001.
34. J. W. Nimmer and M. D. Ernst. Automatic generation of program specifications. In International Symposium on Software Testing and Analysis, pages 232-242, Rome, Italy, Jul 2002.
35. P. Nuzzo, A. Puggelli, S. A. Seshia, and A. Sangiovanni-Vincentelli. CalCS: SMT solving for non-linear convex constraints. In Formal Methods in Computer-Aided Design, pages 71-80, 2010.
36. C. Popeea and W.-N. Chin. Inferring disjunctive postconditions. In Advances in Computer Science-ASIAN 2006. Secure Software and Related Issues, pages 331-345. Springer, 2007.
37. E. Rodrguez-Carbonell and D. Kapur. Automatic generation of polynomial invariants of bounded degree using abstract interpretation, volume 64. Elsevier North-Holland, Inc., Amsterdam, 2007.
38. S. Sankaranarayanan, F. Ivanficic, I. Shlyakhter, and A. Gupta. Static analysis in disjunctive numerical domains. In Static Analysis, pages 3-17. Springer, 2006.
39. R. Sharma, S. Gupta, B. Hariharan, A. Aiken, and A. V. Nori. Verification as learning geometric concepts. In Static Analysis, pages 388-411. Springer, 2013.
40. M. Sheeran, S. Singh, and G. Stalmarck. Checking safety properties using induction and a sat-solver. In Formal Methods in Computer-Aided Design, pages 127-144. Springer, 2000.
41. W. Stein et al. Sage Mathematics Software, 2012. http: //www. sagemath.org.
42. Y. Wei, Y. Pei, C. A. Furia, L. S. Silva, S. Buchholz, B. Meyer, and A. Zeller. Automated xing of programs with contracts. In International Symposium on Software Testing and Analysis, pages 61-72, 2010.
43. W. Weimer. Patches as better bug reports. In Generative Programming and Component Engineering, 2006.