13383 search results - page 244 / 2677 » Abstractions from proofs |
154
click to vote
ASIAN
2006
Springer
15 years 10 months ago
2006
Springer
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
202
click to vote
AAAI
2008
15 years 9 months ago
2008
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
187
click to vote
ENTCS
2008
15 years 6 months ago
2008
Current object-oriented approaches to distributed programs may be criticized in several respects. First, method calls are generally synchronous, which leads to much waiting in dis...
193
click to vote
TCS
2010
15 years 5 months ago
2010
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
328
click to vote
CADE
2011
Springer
14 years 6 months ago
2011
Springer
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...