82 search results - page 8 / 17 » Inductive Proofs of Computational Secrecy |
TCS
2011
13 years 4 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
FMCAD
2007
Springer
14 years 4 months ago
2007
Springer
— Craig interpolants are often used to approximate inductive invariants of transition systems. Arithmetic relationships between numeric variables require word-level interpolants,...
BIRTHDAY
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...
AI
2000
Springer
13 years 9 months ago
2000
Springer
We investigate the improvement of theorem proving by reusing previously computed proofs. We have developed and implemented the PLAGIATOR system which proves theorems by mathematic...
APLAS
2010
ACM
13 years 10 months ago
2010
ACM
We describe an approach to using one logic to reason about specifications written in a second logic. One level of logic, called the "reasoning logic", is used to state th...