566 search results - page 14 / 114 » Array Abstractions from Proofs |
TPHOL
2007
IEEE
14 years 1 months ago
2007
IEEE
Placing our result in a web of related mechanised results, we give a direct proof that the de Bruijn λ-calculus (`a la Huet, Nipkow and Shankar) is isomorphic to an α-quotiented ...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
KBSE
2003
IEEE
14 years 24 days ago
2003
IEEE
Run-time errors are typically seen as unacceptable within safety and security critical software. The SPARK approach to the development of high integrity software addresses the pro...
FLOPS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a practical tool for defining and proving properties of recursive functions in the Coq proof assistant. The tool generates from pseudo-code the graph of the in...
CIE
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this inte...