Sciweavers

357 search results - page 20 / 72
» Specifying and Verifying Fault-Tolerant Systems
Sort
View
ROOM
2000
13 years 9 months ago
Object-Oriented Refinement and Proof using Behaviour Functions
This paper proposes a new calculus for expressing the behaviour of object-oriented systems. The semantics of the calculus is given in terms of operators from computational categor...
Tony Clark
DSN
2008
IEEE
13 years 9 months ago
Experiences with formal specification of fault-tolerant file systems
Fault-tolerant, replicated file systems are a crucial component of today's data centers. Despite their huge complexity, these systems are typically specified only in brief pr...
Roxana Geambasu, Andrew Birrell, John MacCormick
CAV
1998
Springer
98views Hardware» more  CAV 1998»
13 years 12 months ago
Verification of Timed Systems Using POSETs
This paper presents a new algorithm for efficiently verifying timed systems. The new algorithm represents timing information using geometric regions and explores the timed state sp...
Wendy Belluomini, Chris J. Myers
COMCOM
1998
117views more  COMCOM 1998»
13 years 7 months ago
Specification, validation, and verification of time-critical systems
In this paper, we propose a new formalism, named the Timed Communicating Finite State Machine (Timed CFSM), for specifying and verifying time-critical systems. Timed CFSM preserve...
Shiuh-Pyng Shieh, Jun-Nan Chen
JANCL
2006
74views more  JANCL 2006»
13 years 7 months ago
Linear-time temporal logics with Presburger constraints: an overview
We present an overview of linear-time temporal logics with Presburger constraints whose models are sequences of tuples of integers. Such formal specification languages are welldesi...
Stéphane Demri