Sciweavers

44 search results - page 4 / 9
» Verifying liveness for asynchronous programs
Sort
View
CONCUR
2006
Springer
15 years 1 months ago
A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
Stefan Leue, Alin Stefanescu, Wei Wei
SP
2003
IEEE
121views Security Privacy» more  SP 2003»
15 years 2 months ago
Specifying and Verifying Hardware for Tamper-Resistant Software
We specify a hardware architecture that supports tamper-resistant software by identifying an “idealized” hich gives the abstracted actions available to a single user program. ...
David Lie, John C. Mitchell, Chandramohan A. Thekk...
ESEC
1997
Springer
15 years 1 months ago
Verification of Liveness Properties Using Compositional Reachability Analysis
The software architecture of a distributed program can be represented by a hierarchical composition of subsystems, with interacting processes at the leaves of the hierarchy. Compo...
Shing-Chi Cheung, Dimitra Giannakopoulou, Jeff Kra...
PODC
2003
ACM
15 years 2 months ago
A lattice-theoretic characterization of safety and liveness
The distinction between safety and liveness properties is due to Lamport who gave the following informal characterization. Safety properties assert that nothing bad ever happens w...
Panagiotis Manolios, Richard J. Trefler
EMSOFT
2006
Springer
14 years 11 months ago
Reusable models for timing and liveness analysis of middleware for distributed real-time and embedded systems
Distributed real-time and embedded (DRE) systems have stringent constraints on timeliness and other properties whose assurance is crucial to correct system behavior. Formal tools ...
Venkita Subramonian, Christopher D. Gill, Cé...