Sciweavers

3228 search results - page 553 / 646
» Computationally Sound Proofs
Sort
View
CONCUR
2003
Springer
14 years 2 months ago
Contract Signing, Optimism, and Advantage
Abstract. A contract signing protocol lets two parties exchange digital signatures on a pre-agreed text. Optimistic contract signing protocols enable the signers to do so without i...
Rohit Chadha, John C. Mitchell, Andre Scedrov, Vit...
FM
2003
Springer
115views Formal Methods» more  FM 2003»
14 years 2 months ago
Model Checking FTA
Safety is increasingly important for software based, critical systems. Fault tree analysis (FTA) is a safety technique from engineering, developed for analyzing and assessing syste...
Andreas Thums, Gerhard Schellhorn
ICALP
2003
Springer
14 years 2 months ago
Multicommodity Demand Flow in a Tree
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepher...
ICALP
2003
Springer
14 years 2 months ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
ILP
2003
Springer
14 years 2 months ago
Hybrid Abductive Inductive Learning: A Generalisation of Progol
The learning system Progol5 and the underlying inference method of Bottom Generalisation are firmly established within Inductive Logic Programming (ILP). But despite their success...
Oliver Ray, Krysia Broda, Alessandra Russo