888 search results - page 20 / 178 » The Power of Temporal Proofs |
133
click to vote
LPAR
2004
Springer
15 years 3 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
CADE
2004
Springer
15 years 10 months ago
2004
Springer
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...
CG
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
ACISP
2004
Springer
15 years 3 months ago
2004
Springer
The Canetti-Krawczyk (CK) model is useful for building reusable components that lead to rapid development of secure protocols, especially for engineers working outside of the secur...
91
Voted
GECCO
1999
Springer
15 years 1 months ago
1999
Springer
Top-down or analytical provers based on the connection tableau calculus are rather powerful, yet have notable shortcomings regarding redundancy control. A well-known and successfu...