Sciweavers

216 search results - page 39 / 44
» Formal Verification of Safety Properties in Timed Circuits
Sort
View
ICFEM
2009
Springer
14 years 2 months ago
Combining Static Model Checking with Dynamic Enforcement Using the Statecall Policy Language
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...
Anil Madhavapeddy
ASE
2002
160views more  ASE 2002»
13 years 7 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
FTRTFT
1998
Springer
13 years 11 months ago
Fair Synchronous Transition Systems and Their Liveness Proofs
We present a compositional semantics of synchronous systems that captures both safety and progress properties of such systems. The fair synchronous transitions systems (fsts) mode...
Amir Pnueli, Natarajan Shankar, Eli Singerman
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 7 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...
SIGSOFT
2005
ACM
14 years 8 months ago
Reasoning about confidentiality at requirements engineering time
Growing attention is being paid to application security at requirements engineering time. Confidentiality is a particular subclass of security concerns that requires sensitive inf...
Renaud De Landtsheer, Axel van Lamsweerde