32 search results - page 2 / 7 » Effective interactive proofs for higher-order imperative pro... |
FSEN
2009
Springer
14 years 27 days ago
2009
Springer
We introduce a Hoare logic for higher-order functional languages with control operators such as callcc. The key idea is to build the assertion language and proof rules around an e...
APLAS
2009
ACM
14 years 25 days ago
2009
ACM
We define a higher-order process calculus with algebraic operations such as encryption and decryption, and develop a bisimulation proof method for behavioral equivalence in this c...
CSL
2009
Springer
14 years 27 days ago
2009
Springer
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level language...
JELIA
1990
Springer
13 years 10 months ago
1990
Springer
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
PLDI
2009
ACM
14 years 7 months ago
2009
ACM
We present an integrated proof language for guiding the actions of multiple reasoning systems as they work together to prove complex correctness properties of imperative programs....