Sciweavers

218 search results - page 25 / 44
» Verifying Safety Properties with the TLA Proof System
Sort
View
FM
2009
Springer
98views Formal Methods» more  FM 2009»
15 years 6 months ago
Recursive Abstractions for Parameterized Systems
e Abstractions for Parameterized Systems JOXAN JAFFAR and ANDREW E. SANTOSA Department of Computer Science, National University of Singapore Singapore 117590 {joxan,andrews}comp.nu...
Joxan Jaffar, Andrew E. Santosa
CORR
2006
Springer
113views Education» more  CORR 2006»
14 years 11 months ago
Event Systems and Access Control
Abstract. We consider the interpretations of notions of access control (permissions, interdictions, obligations, and user rights) as run-time properties of information systems spec...
Dominique Méry, Stephan Merz
IFM
2009
Springer
158views Formal Methods» more  IFM 2009»
15 years 6 months ago
Developing Topology Discovery in Event-B
Abstract. We present a formal development in Event-B of a distributed topology discovery algorithm. Distributed topology discovery is at the core of several routing algorithms and ...
Thai Son Hoang, Hironobu Kuruma, David A. Basin, J...
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 10 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise
CCS
2000
ACM
15 years 4 months ago
Composition and integrity preservation of secure reactive systems
We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the wellknown simulatability approach, i.e., the specification is an ...
Birgit Pfitzmann, Michael Waidner