1818 search results - page 106 / 364 » Granularity-Adaptive Proof Presentation |
CADE
2003
Springer
14 years 9 months ago
2003
Springer
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
CSFW
2009
IEEE
14 years 3 months ago
2009
IEEE
One of the important challenges when designing and analyzing cryptographic protocols is the enforcement of security properties in the presence of compromised participants. This pa...
LICS
2009
IEEE
14 years 3 months ago
2009
IEEE
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
FROCOS
2009
Springer
14 years 3 months ago
2009
Springer
In an attempt to improve automation capabilities in the Coq proof assistant, we develop a tactic for the propositional fragment based on the DPLL procedure. Although formulas natur...
CSFW
2006
IEEE
14 years 3 months ago
2006
IEEE
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...