6 search results - page 1 / 2 » Encoding Temporal Logics in Executable Z: A Case Study for t... |
LPAR
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. The ZETA system is a Z-based tool environment for developing formal specifications. It contains a component for executing the Z language based on the implementation techn...
AICOM
2010
13 years 4 months ago
2010
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
FAC
2007
13 years 4 months ago
2007
Abstract. We report on a case study in applying different formal methods to model and verify an architecture for administrating digital signatures. The architecture comprises seve...
TACAS
2007
Springer
13 years 10 months ago
2007
Springer
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
CCS
2007
ACM
13 years 10 months ago
2007
ACM
Security automata are a variant of B¨uchi automata used to specify security policies that can be enforced by monitoring system execution. In this paper, we propose using CSP-OZ, ...