Sciweavers

1888 search results - page 122 / 378
» Proof theory and computational analysis
Sort
View
108
Voted
TCS
2010
14 years 7 months ago
Factorization forests for infinite words and applications to countable scattered linear orderings
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
Thomas Colcombet
83
Voted
BIRTHDAY
2005
Springer
15 years 6 months ago
Expander2
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
Peter Padawitz
118
Voted
CSFW
2009
IEEE
15 years 4 months ago
Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation
ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the exclusive OR (XOR) and Diffie-...
Ralf Küsters, Tomasz Truderung
93
Voted
CCS
2009
ACM
15 years 7 months ago
HAIL: a high-availability and integrity layer for cloud storage
We introduce HAIL (High-Availability and Integrity Layer), a distributed cryptographic system that allows a set of servers to prove to a client that a stored file is intact and r...
Kevin D. Bowers, Ari Juels, Alina Oprea
LICS
1991
IEEE
15 years 4 months ago
Logic Programming in a Fragment of Intuitionistic Linear Logic
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
Joshua S. Hodas, Dale Miller