Using bounded model checking to focus fixpoint iterations

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

Volumn 6887 LNCS, Issue , 2011, Pages 369-385

  Monniaux, David ^a   Gonnord, Laure ^b  

^a VERIMAG   (France)

^b UNIV LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT INTERPRETATIONS; ACCELERATION TECHNIQUE; BOUNDED MODEL CHECKING; CONVEX POLYHEDRONS; EXPONENTIAL NUMBERS; FIXPOINT ITERATIONS; MERGE OPERATIONS; SINGLE PATH; SYSTEMATIC EXPLORATION;

ABSTRACTING; STATIC ANALYSIS;

MODEL CHECKING;

EID: 80053101125     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23702-7_27     Document Type: Conference Paper

References (37)

1. Ancourt, C, Coelho, F., Irigoin, F.: A modular static analysis approach to affine loop invariants detection. Electr. Notes Theor. Comput. Sci. 267(1), 3-16 (2010); Proceedings of NSAD
2. Armando, A., Mantovani, J., Platania, L.: Bounded model checking of software using smt solvers instead of sat solvers. International Journal on Software Tools for Technology Transfer (STTT) 11(1), 69-83 (2009)
3. Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma Polyhedra Library, version 0.9, http://www.cs.unipr.it/ppl
4. Bagnara, R., Hill, P.M., Zaffanella, E.: Widening operators for powerset domains. International Journal on Software Tools for Technology Transfer (STTT) 8(4-5), 449-466 (2006); See also erratum in June 2007 issue (Pubitemid 44445944)
5. Balakrishnan, G., Sankaranarayanan, S., Ivancic, F., Gupta, A.: Refining the control structure of loops using static analysis. In: Chakraborty, S., Halbwachs, N. (eds.) EMSOFT, pp. 49-58. ACM, New York (2009)
6. Barrett, C, Ranise, S., Stump, A., Tinelli, C: The satisfiability modulo theories library, SMTLIB (2008), www.smtlib.org
7. Beyer, D., Henzinger, T.A., Majumdar, R., Rybalchenko, A.: Path invariants. In: PLDI, pp. 300-309. ACM, New York (2007) (Pubitemid 47630697)
8. 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: Programming Language Design and Implementation (PLDI), pp. 196-207. ACM, New York (2003)
9. Bourdoncle, F.: Sémantique des langages impératifs d'ordre supérieur et interprétation ab-straite. Ph.D. thesis, École polytechnique, Palaiseau (1992)
10. Bozga, M., Gîrlea, C, Iosif, R.: Iterating octagons. Tech. Rep. 16, VERIMAG (2008)
11. Bozga, M., Iosif, R., Konecny, F.: Fast acceleration of ultimately periodic relations. Tech. Rep. 2010-3, VERIMAG (2010)
12. Comon, H., Jurski, Y: Multiple counters automata, safety analysis and Presburger arithmetic. In: Hu, A.J., Vardi, M.Y (eds.) CAV 1998. LNCS, vol. 1427, pp. 268-279. Springer, Heidelberg (1998) (Pubitemid 128092345)
13. Cousot, P.: Méthodes itératives de construction et d'approximation de points fixes d'opérateurs monotones sur un treillis, analyse sémantique des programmes. State doctorate thesis, Université scientifique et médicale de Grenoble and Institut National Polytechnique de Grenoble (1978), http://tel.archives-ouvertes.fr/tel- 00288657/en/
14. Cousot, P., Cousot, R.: Abstract interpretation frameworks. J. of Logic and Computation, 511-547 (August 1992)
15. Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., Rival, X.: The ASTREÉ analyzer. In: Sagiv, S.M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 21-30. Springer, Heidelberg (2005)
16. Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., Rival, X.: Combination of abstractions in the ASTRÉE static analyzer. In: Okada, M., Satoh, I. (eds.) ASIAN 2006. LNCS, vol. 4435, pp. 272-300. Springer, Heidelberg (2008), http://www.di.ens.fr/~cousot/C0US0Tpapers/ ASIAN06.shtml
17. Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of apro-gram. In: Principles of Programming Languages (POPL), pp. 84-96. ACM, New York (1978)
18. Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K.: An efficient method of computing static single assignment form. In: Principles of Programming Languages (POPL), pp. 25-35. ACM, New York (1989)
19. Dutertre, B., de Moura, L.: A fast linear-arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81-94. Springer, Heidelberg (2006) (Pubitemid 44560868)
20. Feautrier, P., Gonnord, L.: Accelerated invariant generation for C programs with Aspic and C2fsm. In: Tools (TAPAS) (2010)
21. Gawlitza, T.M., Monniaux, D.: Improving strategies via SMT solving. In: Barthe, G. (ed.) ESOP 2011. LNCS, vol. 6602, pp. 236-255. Springer, Heidelberg (2011)
22. Gonnord, L.: Accelération abstraite pour l'amélioration de la précision en analyse des relations linéaires. Ph.D. thesis, Université Joseph Fourier (October 2007), http://tel.archives-ouvertes. fr/tel-80196899/en/
23. 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) (Pubitemid 44561971)
24. Gopan, D., Reps, T.W.: Lookahead widening. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 452-466. Springer, Heidelberg (2006) (Pubitemid 44560898)
25. Gulwani, S., Srivastava, S., Venkatesan, R.: Constraint-based invariant inference over predicate abstraction. In: Jones, N.D., Müller-Olm, M. (eds.) VMCAI 2009. LNCS, vol. 5403, pp. 120-135. Springer, Heidelberg (2009)
26. Gulwani, S., Zuleger, F.: The reachability-bound problem. In: Zorn, B.G., Aiken, A. (eds.) PLDI, pp. 292-304. ACM, New York (2010)
27. Halbwachs, N.: Détermination automatique de relations linéaires vérifiées par les variables d'un programme. State doctorate thesis, Université scientifique et médicale de Grenoble and Institut National Polytechnique de Grenoble (1979), http://tel.archives- ouvertes.fr/tel-000288805/en/
28. Halbwachs, N.: Delay analysis in synchronous programs. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 333-346. Springer, Heidelberg (1993)
29. Kroening, D., Strichman, O.: Decision procedures. Springer, Heidelberg (2008)
30. Miné, A.: Symbolic methods to enhance the precision of numerical abstract domains. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 348-363. Springer, Heidelberg (2005) (Pubitemid 43973677)
31. Monniaux, D.: Automatic modular abstractions for linear constraints. In: Pierce, B.C. (ed.) Symposium on Principles of Programming Languages (POPL). ACM, New York (2009)
32. Monniaux, D.: Automatic modular abstractions for template numerical constraints. Logical Methods in Computer Science (2010) (to appear)
33. Popeea, C, Chin, W.N.: Inferring disjunctive postconditions. In: Okada, M., Satoh, I. (eds.) ASIAN 2006. LNCS, vol. 4435, pp. 331-345. Springer, Heidelberg (2008)
34. Reps, T.W., Sagiv, M., Yorsh, G.: Symbolic implementation of the best transformer. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 252-266. Springer, Heidelberg (2004) (Pubitemid 38131382)
35. Rival, X.: Understanding the origin of alarms in ASTREE. In: Hankin, C, Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 303-319. Springer, Heidelberg (2005)
36. Rival, X., Mauborgne, L.: The trace partitioning abstract domain. Transactions on Programming Languages and Systems (TOPLAS) 29(5), 26 (2007)
37. Sankaranarayanan, S., Ivancic, F., Shlyakhter, I., Gupta, A.: Static analysis in disjunctive numerical domains. In: Yi, K. (ed.) SAS 2006. LNCS, vol. 4134, pp. 3-17. Springer, Heidelberg (2006) (Pubitemid 44561963)