Verifying Temporal Heap Properties Specified via Evolution Logic
暂无分享,去创建一个
Eran Yahav | Reinhard Wilhelm | Thomas W. Reps | Shmuel Sagiv | R. Wilhelm | T. Reps | Eran Yahav | Shmuel Sagiv
[1] David Lewis. Counterpart Theory and Quantified Modal Logic , 1968 .
[2] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.
[3] Pierre Wolper,et al. Reasoning About Infinite Computations , 1994, Inf. Comput..
[4] Bruno Courcelle,et al. On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic , 1996, Descriptive Complexity and Finite Models.
[5] George S. Avrunin,et al. Patterns in property specifications for finite-state verification , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).
[6] Patrick Cousot,et al. Temporal abstract interpretation , 2000, POPL '00.
[7] James C. Corbett,et al. A Language Framework for Expressing Checkable Properties of Dynamic Software , 2000, SPIN.
[8] Michael Rodeh,et al. Checking Cleanness in Linked Lists , 2000, SAS.
[9] Eran Yahav,et al. LTL Model Checking for Systems with Unbounded Number of Dynamically Created Threads and Objects , 2001 .
[10] Eran Yahav,et al. Verifying safety properties of concurrent Java programs using 3-valued logic , 2001, POPL '01.
[11] Amir Pnueli,et al. Verification by Augmented Abstraction: The Automata-Theoretic View , 2001, J. Comput. Syst. Sci..
[12] Reinhard Wilhelm,et al. Parametric shape analysis via 3-valued logic , 2002, TOPL.