Sciweavers

13383 search results - page 211 / 2677
» Abstractions from proofs
Sort
View
ASIACRYPT
2004
Springer
15 years 12 months ago
Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...
Ron Steinfeld, Huaxiong Wang, Josef Pieprzyk
FASE
2004
Springer
15 years 12 months ago
Automated Debugging Using Path-Based Weakest Preconditions
Abstract. Software debugging is the activity of locating and correcting erroneous statements in programs. Automated tools to locate and correct the erroneous statements in a progra...
Haifeng He, Neelam Gupta
HYBRID
2004
Springer
15 years 12 months ago
Incremental Search Methods for Reachability Analysis of Continuous and Hybrid Systems
Abstract. In this paper we present algorithms and tools for fast and efficient reachability analysis, applicable to continuous and hybrid systems. Most of the work on reachability ...
Amit Bhatia, Emilio Frazzoli
SAS
2004
Springer
123views Formal Methods» more  SAS 2004»
15 years 12 months ago
Non-termination Inference for Constraint Logic Programs
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
Étienne Payet, Frédéric Mesna...
CONCUR
2003
Springer
15 years 11 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...