|
1208
|
Symbolic Model Checking
– K L McMillan
- 1993
|
|
2028
|
Compositional Model Checking
– E. M. Clarke, D. E. Long, K. L. Mcmillan
- 1999
|
|
1191
|
Reasoning About Knowledge
– R Fagin, J Y Halpern, Y Moses, M Y Vardi
- 1995
|
|
2605
|
Graph-based algorithms for Boolean function manipulation
– Randal E. Bryant
- 1986
|
|
1130
|
The model checker SPIN
– Gerard J. Holzmann
- 1997
|
|
1085
|
Automatic verification of finite-state concurrent systems using temporal logic specifications
– E. M. Clarke, E. A. Emerson, A. P. Sistla
- 1986
|
|
33
|
Imperative program transformation by rewriting
– David Lacey, Oege De Moor
- 2001
|
|
48
|
Proving correctness of compiler optimizations by temporal logic
– David Lacey, Neil D. Jones
- 2002
|
|
112
|
Verification Tools for Finite-State Concurrent Systems
– E. Clarke, O. Grumberg, D. Long
|
|
23
|
Reasoning about Hierarchical Storage
– Amal Ahmed , Limin Jia, David Walker
- 2003
|
|
699
|
E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic
– E M Clarke, Emerson
- 1982
|
|
6
|
Functor categories and store shapes
– F J Oles
- 1997
|
|
2
|
Possible worlds: A critical analysis. The Prague Bulletin of Mathematical Linguistics
– Jaroslav Peregrin
- 1993
|
|
44
|
A Category-Theoretic Approach to the Semantics of Programming Languages
– F J Oles
- 1982
|
|
56
|
A Simplified Account of Polymorphic References
– Robert Harper
- 1994
|
|
40
|
Fixpoint induction and proofs of program properties
– D Park
- 1969
|
|
70
|
Impossible possible worlds vindicated
– J Hintikka
- 1975
|
|
28
|
Machine instruction syntax and semantics in higher order logic
– N G MICHAEL, A W APPEL
|
|
106
|
On the Observable Properties of Higher Order Functions that Dynamically Create Local Names (preliminary report)
– Andrew Pitts, Ian Stark
- 1993
|
