13383 search results - page 92 / 2677 » Abstractions from proofs |
123
click to vote
CADE
2008
Springer
16 years 5 months ago
2008
Springer
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
149
Voted
FOSSACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
145
Voted
LICS
1998
IEEE
15 years 9 months ago
1998
IEEE
Hierarchies (Extended Abstract) Jan Johannsen Chris Pollett Department of Mathematics Department of Computer Science University of California, San Diego Boston University La Jolla,...
141
Voted
DLOG
2007
15 years 7 months ago
2007
Abstract. In this work we propose an alternative approach to inference in DLLite, based on a reduction to reasoning in an extension of function-free Horn Logic (EHL). We develop a ...
248
click to vote
ASIAN
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We presents a compositional Hoare logic for proving semantic security of modes of operation for symmetric key block ciphers. We propose a simple programming language to s...