142 search results - page 10 / 29 » A Small Framework for Proof Checking |
86
Voted
CSR
2009
Springer
15 years 2 months ago
2009
Springer
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
107
Voted
CSL
2005
Springer
15 years 5 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
182
click to vote
POPL
2001
ACM
15 years 12 months ago
2001
ACM
We propose a general, powerful framework of type systems for the -calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial propert...
81
Voted
CHARME
2005
Springer
15 years 5 months ago
2005
Springer
Abstraction is the key for effectively dealing with the state explosion in model-checking. Unfortunately, finding abstractions which are small and yet enable us to get conclusive ...
87
Voted
CCS
2008
ACM
15 years 1 months ago
2008
ACM
One of the key issues with the practical applicability of Proof-Carrying Code (PCC) and its related methods is the difficulty in communicating the proofs which are inherently larg...