论文信息 - Cartesian abstraction and verification of multithreaded programs - 字舞流文

Cartesian abstraction and verification of multithreaded programs

Alexander Malkis | A. Malkis

[1] Kedar S. Namjoshi,et al. Local proofs for global safety properties , 2007, Formal Methods Syst. Des..

[2] Thomas A. Henzinger,et al. Race checking by context inference , 2004, PLDI '04.

[3] Dexter Kozen,et al. Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[4] Cormac Flanagan,et al. Thread-Modular Model Checking , 2003, SPIN.

[5] Susan Owicki,et al. An axiomatic proof technique for parallel programs I , 1976, Acta Informatica.

[6] Patrick Cousot,et al. Formal language, grammar and set-constraint-based program analysis by abstract interpretation , 1995, FPCA '95.

[7] Thomas A. Henzinger,et al. Lazy abstraction , 2002, POPL '02.

[8] A. Tarski. A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[9] Andreas Podelski,et al. Thread-Modular Verification Is Cartesian Abstract Interpretation , 2006, ICTAC.

[10] Patrick Cousot,et al. Introduction to abstract interpretation , 1998 .

[11] Andreas Podelski,et al. Refinement with Exceptions , 2012 .

[12] Neil D. Jones,et al. Complexity of flow analysis, inductive assertion synthesis and a language due to Dijkstra , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[13] Thread-Modular Verification and Cartesian Abstraction , 2006 .