429 search results - page 11 / 86 » Theorem Proving Languages for Verification |
109
click to vote
ACL2
2006
ACM
15 years 2 months ago
2006
ACM
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
APLAS
2001
ACM
15 years 2 months ago
2001
ACM
We verified two versions of the CPS transformation in Isabelle/HOL: one by Plotkin by Danvy and Filinski. We adopted first order abstract syntax so that the formalization is close...
CADE
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
105
Voted
SAC
2010
ACM
14 years 9 months ago
2010
ACM
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
TACAS
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Intermediate languages are a paradigm to separate concerns in software verification systems when bridging the gap between programming languages and the logics understood ...