Sciweavers

425 search results - page 39 / 85
» The TPS Theorem Proving System
Sort
View
ER
2004
Springer
82views Database» more  ER 2004»
15 years 3 months ago
Reachability Problems in Entity-Relationship Schema Instances
Abstract. Recent developments in reification of ER schemata include automatic generation of webbased database administration systems [1,2]. These systems enforce the schema cardin...
Sebastiano Vigna
HYBRID
1998
Springer
15 years 2 months ago
Equations on Timed Languages
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...
Eugene Asarin
CRYPTO
2007
Springer
106views Cryptology» more  CRYPTO 2007»
15 years 1 months ago
Indistinguishability Amplification
system is the abstraction of the input-output behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and pro...
Ueli M. Maurer, Krzysztof Pietrzak, Renato Renner
ICDCS
2005
IEEE
15 years 3 months ago
The Impossibility of Boosting Distributed Service Resilience
We prove two theorems saying that no distributed system in which processes coordinate using reliable registers and -resilient services can solve the consensus problem in the prese...
Paul C. Attie, Rachid Guerraoui, Petr Kouznetsov, ...
ICFEM
2005
Springer
15 years 3 months ago
An Evidential Tool Bus
Abstract. Theorem provers, model checkers, static analyzers, test generators. . . all of these and many other kinds of formal methods tools can contribute to the analysis and devel...
John M. Rushby