82 search results - page 3 / 17 » Operational Semantics for Model Checking Circus |
EPEW
2005
Springer
14 years 1 months ago
2005
Springer
Compensation is an error recovery mechanism for long-running transactions. Compensating CSP is a variant of the CSP process algebra with constructs for orchestration of compensatio...
ICST
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—In this paper we introduce Timed Moore Automata, a specification formalism which is used in industrial train control applications for specifying the real-time behavior ...
TABLEAUX
2009
Springer
14 years 2 months ago
2009
Springer
Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then...
FM
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires ...
ENTCS
2007
13 years 7 months ago
2007
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...