691 search results - page 21 / 139 » Automatically Proving Linearizability |
CADE
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
DBPL
1997
Springer
15 years 1 months ago
1997
Springer
Abstract. In the context of the object-oriented data model, a compiletime approach is given that provides for a significant reduction of the amount of run-time transaction overhead...
FM
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Circus is a combination of Z and CSP that supports the development of state-rich reactive systems based on refinement. In this paper we present JCircus, a tool that autom...
57
Voted
AIPS
1998
14 years 11 months ago
1998
The choice of an appropriate problem-solving method, from available methods, is a crucial skill for experts in many areas. We describe a technique for the automatic selection amon...
69
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The focus of this paper is on reducing the complexity in verification by exploiting modularity at various levels: in specification, in verification, and structurally. For specifica...