Context-aware counter abstraction

Formal Methods in System Design

Volumn 36, Issue 3, 2010, Pages 223-245

  Basler, Gérard ^a,b   Mazzucchi, Michele ^a,b   Wahl, Thomas ^a,b   Kroening, Daniel ^a,b  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Boolean programs; Symbolic Model Checking; Symmetry reduction

Indexed keywords

BOOLEAN PROGRAMS; COMPUTER-AIDED VERIFICATIONS; CONCURRENT PROGRAM; CONCURRENT SOFTWARE; CONTEXT-AWARE; COUNTER ABSTRACTION; GLOBAL STATE; LOCAL STATE; LOCAL STATE SPACE; MODEL CHECKER; MULTI-CORE COMPUTING; NON-TRIVIAL; PARTIAL-ORDER METHODS; REAL-WORLD; STATE-SPACE EXPLOSION; SYMBOLIC MODEL CHECKING; SYMBOLIC STATE SPACE; SYMMETRY REDUCTION; TOOL MARKS;

ABSTRACTING; COMPUTER AIDED ANALYSIS; SPACE RESEARCH;

MODEL CHECKING;

EID: 77956747851     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10703-010-0096-7     Document Type: Article

References (37)

1. Ball T, Rajamani SK (2000) Bebop: a symbolic model checker for Boolean programs. In: SPIN, pp 113-130
2. Ball T, Rajamani SK (2002) The SLAM project: debugging system software via static analysis. In: POPL, pp 1-3
3. Ball T, Chaki S, Rajamani SK (2001) Parameterized verification of multithreaded software libraries. In: TACAS, pp 158-173
4. Ball T, Bounimova E, Cook B, Levin V, Lichtenberg J, McGarvey C, Ondrusek B, Rajamani SK, Ustuner A (2006) Thorough static analysis of device drivers. In: EuroSys, pp 73-85
5. S Barner O Grumberg 2005 Combining symmetry reduction and under-approximation for symbolic Model Checking Form Methods Syst Des 27 1-2 29 66 1085.68086 10.1007/s10703-005-2246-x (Pubitemid 41343937)
6. Basler G, Mazzucchi M, Wahl T, Kroening D (2009) Symbolic counter abstraction for concurrent software. In: CAV, pp 64-78
7. D Bosnacki D Dams L Holenderski 2002 Symmetric spin Int J Softw Tools Technol Transf 4 1 92 106 10.1007/s100090200074
8. EM Clarke S Jha R Enders T Filkorn 1996 Exploiting symmetry in temporal logic Model Checking Form Methods Syst Des 9 1/2 77 104 10.1007/BF00625969
9. Clarke EM, Kroening D, Sharygina N, Yorav K (2005) SATABS: SAT-based predicate abstraction for ANSI-C. In: TACAS, pp 570-574
10. Cook B, Kroening D, Sharygina N (2005) Symbolic Model Checking for asynchronous Boolean programs. In: SPIN, pp 75-90
11. B Cook D Kroening N Sharygina 2007 Verification of Boolean programs with unbounded thread creation Theor Comput Sci 388 13 227 242 1143.68043 2368298
12. Delzanno G (2000) Automatic verification of parameterized cache coherence protocols. In: CAV, pp 53-68
13. Donaldson AF, Miller A (2006) Exact and approximate strategies for symmetry reduction in model checking. In: FM, pp 541-556 (Pubitemid 44502929)
14. Donaldson AF, Miller A (2006) Symmetry reduction for probabilistic Model Checking using generic representatives. In: ATVA, pp 9-23 (Pubitemid 44850325)
15. Donaldson A, Miller A, Parker D (2009) Language-level symmetry reduction for probabilistic Model Checking. In: QEST, pp 289-298
16. EA Emerson AP Sistla 1996 Symmetry and Model Checking Form Methods Syst Des 9 1/2 105 131 10.1007/BF00625970
17. Emerson EA, Trefler RJ (1999) From asymmetry to full symmetry: new techniques for symmetry reduction in Model Checking. In: CHARME, pp 142-156
18. Emerson EA, Wahl T (2005) Dynamic symmetry reduction. In: TACAS, pp 382-396
19. EA Emerson T Wahl 2005 Efficient reduction techniques for systems with many components Electron Notes Theor Comput Sci 130 379 399 10.1016/j.entcs. 2005.03.019 (Pubitemid 40612305)
20. Emerson EA, Jha S, Peled D (1997) Combining partial order and symmetry reductions. In: TACAS, pp 19-34
21. Emerson EA, Havlicek J, Trefler RJ (2000) Virtual symmetry reduction. In: LICS, pp 121-131
22. Flanagan C, Godefroid P (2005) Dynamic partial-order reduction for Model Checking software. In: POPL, pp 110-121
23. Graf S, Saïdi H (1997) Construction of abstract state graphs with PVS. In: CAV, pp 72-83
24. Henzinger TA, Jhala R, Majumdar R (2004) Race checking by context inference. In: PLDI, pp 1-13
25. Holzmann GJ, Peled D (1994) An improvement in formal verification. In: FORTE, pp 197-211
26. Kurshan RP (1994) Computer-aided verification of coordinating processes: the automata-theoretic approach. Princeton University Press, Princeton
27. Lahiri SK, Bryant RE, Cook B (2003) A symbolic approach to predicate abstraction. In: CAV, pp 141-153
28. BD Lubachevsky 1984 An approach to automating the verification of compact parallel coordination programs I Acta Inform 21 125 169 0522.68017 10.1007/BF00289237 761392
29. Manevich R, Lev-Ami T, Sagiv M, Ramalingam G, Berdine J (2008) Heap decomposition for concurrent shape analysis. In: SAS, pp 363-377
30. Melton R, Dill D Murφ annotated reference manual, rel. 3.1. http://verify.stanford.edu/dill/murphi.html
31. Pnueli A, Xu J, Zuck LD (2002) Liveness with (0,1,∞)-counter abstraction. In: CAV, pp 107-122
32. F Pong M Dubois 1995 A new approach for the verification of cache coherence protocols IEEE Trans Parallel Distrib Syst 6 8 773 787 10.1109/71.406955
33. Somenzi F The CU decision diagram package, release 2.3.1. University of Colorado at Boulder. http://vlsi.colorado.edu/~fabio/CUDD/
34. Suwimonteerabuth D, Esparza J, Schwoon S (2008) Symbolic context-bounded analysis of multithreaded java programs. In: SPIN, pp 270-287
35. Wahl T, Blanc N, Emerson EA (2008) SVISS: symbolic verification of symmetric systems. In: TACAS, pp 459-462
36. Wei O, Gurfinkel A, Chechik M (2005) Identification and counter abstraction for full virtual symmetry. In: CHARME, pp 285-300
37. Witkowski T, Blanc N, Kroening D, Weissenbacher G (2007) Model Checking concurrent Linux device drivers. In: ASE, pp 501-504