Abstraction refinement of linear programs with arrays

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

Volumn 4424 LNCS, Issue , 2007, Pages 373-388

  Armando, Alessandro ^a   Benerecetti, Massimo ^b   Mantovani, Jacopo ^a  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ARRAY PROCESSING; MODEL CHECKING; NUMERICAL ANALYSIS; SET THEORY; UBIQUITOUS COMPUTING; ITERATIVE METHODS; LINEAR PROGRAMMING;

ABSTRACTION REFINEMENT; ARRAY ELEMENTS; NUMERIC DOMAIN; PROGRAM VARIABLES; ABSTRACT PROGRAMS; COMPLEX CORRELATION; IMPORTANT FEATURES; LINEAR COMBINATIONS; PREDICATE ABSTRACTIONS; REFINEMENT PROCESS;

LINEAR PROGRAMMING; ABSTRACTING;

EID: 37149010632     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71209-1_29     Document Type: Conference Paper

References (14)

1. Armando, A., Castellini, C., Mantovani, J.: Software model checking using linear constraints. In: ICFEM'04. Volume 3308 of LNCS., Springer (2004)
2. Armando, A., Benerecetti, M., Mantovani, J.: Model checking linear programs with arrays. In: SoftMC'05. Volume 144 of ENTCS., Elsevier (2005)
3. Ball, T., Rajamani, S.K.: Automatically validating temporal safety properties of interfaces. In: Proc. of SPIN'01, Springer New York, Inc. (2001) 103-122
4. Henzinger, T., Jhala, R., Majumdar, R., Sutre, G.: Software Verification with Blast. In: Proc. of SPIN '03. Volume 2648 of LNCS., Springer (2003) 235-239
5. Henzinger, T.A., Jhala, R., Majumdar, R., McMillan, K.L.: Abstractions from proofs. In: POPL'04, New York, NY, USA, ACM Press (2004) 232-244
6. Jhala, R., McMillan, K.L.: A practical and complete approach to predicate refinement. In Hermanns, H., Palsberg, J., eds.: TACAS. Volume 3920 of LNCS., Springer (2006) 459-473
7. Clarke, E., Kroening, D., Sharygina, N., Yorav, K.: SATABS: SAT-based predicate abstraction for ANSI-C In: TACAS'05. Volume 3440 of LNCS., Springer (2005) 570-4
8. Kroening, D., Clarke, E., Yorav, K.: Behavioral consistency of C and Verilog programs using bounded model checking. In: Proc. of DAC 2003, ACM Press (2003) 368-371
9. Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, MA (1986)
10. Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: Proc. of POPL '95, ACM Press (1995) 49-61
11. Bagnara, R., Ricci, E., Zaffanella, E., Hill, P.M.: Possibly not closed convex polyhedra and the Parma Polyhedra Library. In Hermenegildo, M.V., Puebla, G., eds.: SAS'02. Volume 2477 of LNCS., Madrid, Spain, Springer (2002) 213-229
12. Barrett, C., Berezin, S.: CVC Lite: A new implementation of the cooperating validity checker. In: CAV. (2004) 515-518
13. Black, P.E.: Gray code, in dictionary of algorithms and data structures. See http://www.nist.gov/dads/HTML/graycode.html (2005)
14. Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: POPL 2002. (2002) 58-70