Sciweavers

1894 search results - page 283 / 379
» A TLA Proof System
Sort
View
134
Voted
CSFW
2003
IEEE
15 years 9 months ago
Probabilistic Noninterference through Weak Probabilistic Bisimulation
To be practical, systems for ensuring secure information flow must be as permissive as possible. To this end, the author recently proposed a type system for multi-threaded progra...
Geoffrey Smith
FM
2003
Springer
115views Formal Methods» more  FM 2003»
15 years 9 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
ECRTS
2004
IEEE
15 years 7 months ago
Pessimistic Concurrency Control and Versioning to Support Database Pointers in Real-Time Databases
In this paper we present a concurrency control algorithm that allows co-existence of soft real-time, relational database transactions, and hard real-time database pointer transact...
Dag Nyström, Mikael Nolin, Aleksandra Tesanov...
FMICS
2010
Springer
15 years 5 months ago
SMT-Based Formal Verification of a TTEthernet Synchronization Function
Abstract. TTEthernet is a communication infrastructure for mixedcriticality systems that integrates dataflow from applications with different criticality levels on a single network...
Wilfried Steiner, Bruno Dutertre
126
Voted
FAC
2008
108views more  FAC 2008»
15 years 4 months ago
Property-directed incremental invariant generation
Abstract. A fundamental method of analyzing a system such as a program or a circuit is invariance analysis, in which one proves that an assertion holds on all reachable states. Typ...
Aaron R. Bradley, Zohar Manna