3228 search results - page 204 / 646 » Computationally Sound Proofs |
126
click to vote
CONCUR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We show how to apply Howe’s method for the proof of congruence of early bisimilarities in a higher-order process calculus with
154
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...
170
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
LaMacchia, Lauter and Mityagin recently presented a strong security definition for authenticated key agreement strengthening the well-known Canetti-Krawczyk definition. They also ...
182
click to vote
ICCAD
2006
IEEE
16 years 19 days ago
2006
IEEE
This paper addresses SAT-based Unbounded Model Checking based on Craig Interpolants. This recently introduced methodology is often able to outperform BDDs and other SAT-based tech...
199
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...