3552 search results - page 188 / 711 » Proof theory in the abstract |
160
click to vote
CRYPTO
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. This paper introduces simulatable verifiable random functions (sVRF). VRFs are similar to pseudorandom functions, except that they are also verifiable: corresponding to...
178
click to vote
ICCAD
2006
IEEE
16 years 16 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...
176
click to vote
ENTCS
2008
15 years 6 months ago
2008
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
211
click to vote
AMAST
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
195
click to vote
SAT
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. A promising approach for model counting was recently introduced, which in theory requires the use of large random xor or parity constraints to obtain near-exact counts of...