From tests to proofs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5505 LNCS, Issue , 2009, Pages 262-276

  Gupta, Ashutosh ^a   Majumdar, Rupak ^b   Rybalchenko, Andrey ^a  

^a MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT INTERPRETATIONS; BENCHMARK PROGRAMS; CONSTRAINT SOLVING; DYNAMIC EXECUTION; EXPERIMENTAL EVALUATION; IMPERATIVE PROGRAMS; LINEAR CONSTRAINTS; NON-LINEAR; PROGRAM VERIFICATION; SOFTWARE MODEL CHECKING; STATIC CONSTRAINTS; AUTOMATIC INVARIANT GENERATIONS; DESIGN AND IMPLEMENTATIONS;

ABSTRACTING; AUTOMATIC PROGRAMMING; CARBON FIBER REINFORCED PLASTICS; COMPUTER AIDED LANGUAGE TRANSLATION; COMPUTER SOFTWARE SELECTION AND EVALUATION; MODEL CHECKING; CODES (SYMBOLS); LOGIC PROGRAMMING;

PROGRAM INTERPRETERS; MODEL CHECKING;

EID: 70350237581     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00768-2_24     Document Type: Conference Paper

References (29)

1. Ball, T., Rajamani, S.K.: The SLAM project: Debugging system software via static analysis. In: Proc. POPL, pp. 1-3. ACM Press, New York (2002)
2. Beyer, D., Henzinger, T., Majumdar, R., Rybalchenko, A.: Invariant synthesis for combined theories. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 378-394. Springer, Heidelberg (2007)
3. Beyer, D., Henzinger, T.A.,Majumdar, R., Rybalchenko, A.: Path invariants. In: Proc. PLDI, pp. 300-309. ACM Press, New York (2007)
4. Blanchet, B., Cousot, P., Cousot, R., Feret, J.,Mauborgne, L., Miné, A.,Monniaux, D., Rival, X.: A static analyzer for large safety-critical software. In: Proc. PLDI, pp. 196-207. ACM Press, New York (2003)
5. Colón, M.A., Sankaranarayanan, S., Sipma, H.B.: Linear invariant generation using nonlinear constraint solving. In: Hunt Jr.,W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 420-432. Springer, Heidelberg (2003)
6. Cousot, P.: Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 1-24. Springer, Heidelberg (2005)
7. Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL 1978, pp. 84-96. ACM Press, New York (1978)
8. de Moura, L.M., Bjørner, N.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
9. Ernst, M.D., Cockrell, J., Griswold, W.G., Notkin, D.: Dynamically discovering likely program invariants to support program evolution. IEEE Trans. Software Eng. 27(2), 1-25 (2001)
10. Floyd, R.W.: Assigning meanings to programs. In: Mathematical Aspects of Computer Science, pp. 19-32. AMS (1967)
11. Gonnord, L., Halbwachs, N.: Combining widening and acceleration in Linear Relation Analysis. In: Yi, K. (ed.) SAS 2006. LNCS, vol. 4134, pp. 144-160. Springer, Heidelberg (2006)
12. Gopan, D., Reps, T.: Lookahead widening. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 452-466. Springer, Heidelberg (2006)
13. Gulavani, B.S., Chakraborty, S., Nori, A.V., Rajamani, S.K.: Automatically refining abstract interpretations. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 443-458. Springer, Heidelberg (2008)
14. Gulwani, S., Srivastava, S., Venkatesan, R.: Program analysis as constraint solving. In: PLDI, pp. 281-292. ACM Press, New York (2008)
15. Henzinger, T., Jhala, R., Majumdar, R., McMillan, K.: Abstractions from proofs. In: POPL 2004: Principles of Programming Languages, pp. 232-244. ACM Press, New York (2004)
16. Henzinger, T., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: Proc. POPL, pp. 58-70. ACM Press, New York (2002)
17. Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM12, 576-580 (1969)
18. Holzbaur, C.: OFAI clp(q,r) Manual, edn. 1.3.3. Austrian Research Institute for Artificial Intelligence, Vienna, TR-95-09 (1995)
19. Jain, H., Ivancic, F., Gupta, A., Shlyakhter, I.,Wang, C.: Using statically computed invariants inside the predicate abstraction and refinement loop. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 137-151. Springer, Heidelberg (2006)
20. Kapur, D.: Automatically generating loop invariants using quantifier elimination. Technical Report 05431 (Deduction and Applications), IBFI Schloss Dagstuhl (2006)
21. Ku, K., Hart, T., Chechik, M., Lie, D.: A buffer overflow benchmark for software model checkers. In: Proc. ASE (2007)
22. Lalire, G., Argoud, M., Jeannet, B.: The interproc analyzer, http://pop-art.inrialpes.fr/people/bjeannet/bjeannet-forge/interproc/index.html
23. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, Heidelberg (1995)
24. Miné, A.: The octagon abstract domain. Higher-Order and Symb. Comp. 19, 31-100 (2006)
25. Sankaranarayanan, S., Sipma, H., Manna, Z.: Constraint-based linear-relations analysis. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol. 3148, pp. 53-68. Springer, Heidelberg (2004)
26. Sankaranarayanan, S., Sipma, H., Manna, Z.: Non-linear loop invariant generation using Gröbner bases. In: Proc. POPL, pp. 318-329. ACM, New York (2004)
27. Sankaranarayanan, S., Sipma, H., Manna, Z.: Scalable analysis of linear systems using mathematical programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 25-41. Springer, Heidelberg (2005)
28. Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)
29. The Intelligent Systems Laboratory. SICStus Prolog User's Manual. Swedish Institute of Computer Science, Release 3.8.7 (2001)