Sciweavers

13383 search results - page 308 / 2677
» Abstractions from proofs
Sort
View
KBSE
2005
IEEE
16 years 9 days ago
Prufrock: a framework for constructing polytypic theorem provers
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
Justin Ward, Garrin Kimmell, Perry Alexander
CADE
2007
Springer
16 years 7 months ago
Labelled Clauses
We add labels to first-order clauses to simultaneously apply superpositions to several proof obligations inside one clause set. From a theoretical perspective, the approach unifies...
Tal Lev-Ami, Christoph Weidenbach, Thomas W. Reps,...
TCC
2004
Springer
105views Cryptology» more  TCC 2004»
16 years 2 days ago
Unfair Noisy Channels and Oblivious Transfer
In a paper from EuroCrypt’99, Damg˚ard, Kilian and Salvail show various positive and negative results on constructing Bit Commitment (BC) and Oblivious Transfer (OT) from Unfair...
Ivan Damgård, Serge Fehr, Kirill Morozov, Lo...
POPL
2007
ACM
16 years 7 months ago
Logic-flow analysis of higher-order programs
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
Matthew Might
PLDI
2003
ACM
15 years 12 months ago
A static analyzer for large safety-critical software
d Abstract) Bruno Blanchet∗ § Patrick Cousot§ Radhia Cousot∗¶ J´erˆome Feret§ Laurent Mauborgne§ Antoine Min´e§ David Monniaux∗§ Xavier Rival§ that abstract inter...
Bruno Blanchet, Patrick Cousot, Radhia Cousot, J&e...