Threader: A constraint-based verifier for multi-threaded programs

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

Volumn 6806 LNCS, Issue , 2011, Pages 412-417

  Gupta, Ashutosh ^a   Popeea, Corneliu ^a   Rybalchenko, Andrey ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPOSITIONAL VERIFICATION; CONSTRAINT-BASED; HORN CLAUSE; ITS EVALUATION; MULTI-THREADED PROGRAMS;

LOGIC PROGRAMMING;

COMPUTER AIDED ANALYSIS;

EID: 79960380353     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22110-1_32     Document Type: Conference Paper

References (14)

1. Cohen, A., Namjoshi, K.S.: Local proofs for global safety properties. In: FMSD, vol. 34(2), pp. 104-125 (2009)
2. Corbet, J., Rubini, A., Kroah-Hartman, G.: Linux Device Drivers, 3rd edn. O'Reilly Media. Sebastopol (2005)
3. Flanagan, C., Freund, S.N., Qadeer, S.: Thread-modular verification for shared-memory programs. In: Le Métayer, D. (ed.) ESOP 2002. LNCS, vol. 2305, pp. 262-277. Springer, Heidelberg (2002)
4. Flanagan, C., Qadeer, S.: Thread-modular model checking. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol. 2648, pp. 213-224. Springer, Heidelberg (2003)
5. Fonseca, P., Li, C., Singhal, V., Rodrigues, R.: A study of the internal and external effects of concurrency bugs. In: DSN, pp. 221-230 (2010)
6. Gupta, A., Popeea, C., Rybalchenko, A.: Non-monotonic refinement of control abstraction for concurrent programs. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol. 6252, pp. 188-202. Springer, Heidelberg (2010)
7. Gupta, A., Popeea, C., Rybalchenko, A.: Predicate abstraction and refinement for verifying multi-threaded programs. In: POPL, pp. 331-344 (2011)
8. Gupta, A., Popeea, C., Rybalchenko, A.: Transition invariants and environment transitions for proving termination of multi-threaded programs (2011) (under sub-mission)
9. Jones, C.B.: Tentative steps toward a development method for interfering programs. ACM Trans. Program. Lang. Syst. 5(4), 596-619 (1983)
10. Lu, S., Park, S., Seo, E., Zhou, Y.: Learning from mistakes: a comprehensive study on real world concurrency bug characteristics. In: ASPLOS, pp. 329-339 (2008)
11. McKenney, P.: Using Promela and Spin to verify parallel algorithms. LWN.net weekly edition (2007)
12. Necula, G.C., McPeak, S., Rahul, S.P., Weimer, W.: CIL: Intermediate language and tools for analysis and transformation of C programs. In: CC 2002. LNCS, vol. 2304, p. 213. Springer, Heidelberg (2002)
13. Owicki, S.S., Gries, D.: An axiomatic proof technique for parallel programs. I. Acta Inf. 6, 319-340 (1976)
14. Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Constraint-based linear-relations analysis. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol. 3148, pp. 53-68. Springer, Heidelberg (2004)