Reducing concurrent analysis under a context bound to sequential analysis

Formal Methods in System Design

Volumn 35, Issue 1, 2009, Pages 73-97

  Lal, Akash ^a   Reps, Thomas ^a,b  

^a University of Wisconsin   (United States)

^b GRAMMATECH INC   (United States)

Author keywords

Concurrency; Context bounding; Verification

Indexed keywords

MODEL CHECKING; VERIFICATION;

BOOLEAN PROGRAMS; CONCURRENCY; CONCURRENT PROGRAM; CONTEXT BOUNDING; SEQUENTIAL ANALYSIS; SEQUENTIAL PROGRAMS; SIMPLE AND EFFICIENT ALGORITHMS; SYMBOLIC CONSTANTS;

PROGRAM DEBUGGING;

EID: 69049097002     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10703-009-0078-9     Document Type: Conference Paper

References (28)

1. Ball T, Majumdar R, Millstein T, Rajamani SK (2001) Automatic predicate abstraction of C programs. In: PLDI
2. Ball T, Rajamani S (2000) Bebop: a symbolic model checker for Boolean programs. In: SPIN
3. Berger F, Schwoon S, Suwimonteerabuth D (2005) jMoped. http://www7.in.tum.de/tools/jmoped/
4. Bouajjani A, Fratani S, Qadeer S (2007) Context-bounded analysis of multithreaded programs with dynamic linked structures. In: CAV
5. Chaki S, Clarke EM, Kidd N, Reps TW, Touili T (2006) Verifying concurrent message-passing C programs with recursive calls. In: TACAS
6. Cousot P, Halbwachs N (1978) Automatic discovery of linear restraints among variables of a program. In: POPL
7. Henzinger T, Jhala R, Majumdar R, Sutre G (2002) Lazy abstraction. In: POPL
8. Henzinger TA, Jhala R, Majumdar R (2004) Race checking by context inference. In: PLDI
9. Kiefer S, Schwoon S, Suwimonteerabuth D. Moped. http://www.fmi.uni- stuttgart.de/szs/tools/moped/
10. Knoop J, Steffen B (1992) The interprocedural coincidence theorem. In: CC
11. Lal A, Kidd N, Reps T, Touili T (2007) Abstract error projection. In: SAS
12. Lal A, Touili T, Kidd N, Reps T (2007) Interprocedural analysis of concurrent programs under a context bound. TR-1598, University of Wisconsin, July 2007
13. Lal A, Touili T, Kidd N, Reps T (2008) Interprocedural analysis of concurrent programs under a context bound. In: TACAS
14. Müller-Olm M, Seidl H (2004) Precise interprocedural analysis through linear algebra. In: POPL
15. Murphy B, Lam M (2000) Program analysis with partial transfer functions. In: PEPM
16. Musuvathi M, Qadeer S (2007) Iterative context bounding for systematic testing of multithreaded programs. In: PLDI
17. Pelánek R (2007) BEEM: Benchmarks for explicit model checkers. In: SPIN
18. Qadeer S, Rajamani S (2005) Deciding assertions in programs with references. Technical Report MSR-TR-2005-08, Microsoft Research, Redmond, January 2005
19. Qadeer S, Rajamani SK, Rehof J (2004) Summarizing procedures in concurrent programs. In: POPL
20. Qadeer S, Rehof J (2005) Context-bounded model checking of concurrent software. In: TACAS
21. Qadeer S, Wu D (2004) KISS: keep it simple and sequential. In: PLDI
22. Ramalingam G (2000) Context-sensitive synchronization-sensitive analysis is undecidable. In: TOPLAS
23. Reps T, Horwitz S, Sagiv M (1995) Precise interprocedural dataflow analysis via graph reachability. In: POPL
24. Reps T, Schwoon S, Jha S, Melski D (2005) Weighted pushdown systems and their application to interprocedural dataflow analysis. In: SCP, vol 58
25. Schwoon S (2002) Model-checking pushdown systems. PhD thesis, Technical University of Munich, Munich, Germany, July 2002
26. M Sharir A Pnueli 1981
27. Suwimonteerabuth D, Esparza J, Schwoon S (2008) Symbolic context-bounded analysis of multithreaded Java programs. In: SPIN
28. Witkowski T, Blanc N, Kroening D, Weissenbacher G (2007) Model checking concurrent linux device drivers. In: ASE