13383 search results - page 333 / 2677 » Abstractions from proofs |
199
Voted
STOC
2006
ACM
16 years 7 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
217
click to vote
ASM
2010
ASM
16 years 1 months ago
2010
ASM
and formal model, named Kmelia [1,2], with an associated language to specify components, their provided and required services and their assemblies; we also developed a framework na...
233
click to vote
ACL2
2006
ACM
16 years 23 days ago
2006
ACM
A verifying compiler is one that emits both object code and a proof of correspondence between object and source code.1 We report the use of ACL2 in building a verifying compiler f...
185
click to vote
SAC
2004
ACM
16 years 6 days ago
2004
ACM
In this paper we present an approach for developing adaptable software applications. The problem we are facing is that of a (possibly mobile) user who wants to download and execut...
188
click to vote
ECAI
2004
Springer
16 years 5 days ago
2004
Springer
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...