203 search results - page 24 / 41 » Datatype-Generic Termination Proofs |
126
click to vote
VMCAI
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
126
Voted
CADE
2003
Springer
16 years 2 months ago
2003
Springer
Ordinals form the basis for termination proofs in ACL2. Currently, ACL2 uses a rather inefficient representation for the ordinals up to 0 and provides limited support for reasoning...
163
click to vote
CSL
2007
Springer
15 years 8 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ļ...
123
click to vote
PKC
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the veriļ¬er that accepts the interaction prov...
105
click to vote
FSTTCS
2004
Springer
15 years 7 months ago
2004
Springer
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...