91 search results - page 6 / 19 » Inductive Beluga: Programming Proofs |
IJFCS
2008
13 years 11 months ago
2008
Abstract. We present an approach to verification of parameterized systems, which is based on program transformation technique known as supercompilation. In this approach the statem...
ACL2
2006
ACM
14 years 4 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
TLCA
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
CADE
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
FAC
2008
13 years 11 months ago
2008
Abstract. A fundamental method of analyzing a system such as a program or a circuit is invariance analysis, in which one proves that an assertion holds on all reachable states. Typ...