691 search results - page 82 / 139 » Automatically Proving Linearizability |
ICLP
1999
Springer
14 years 2 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
TAPSOFT
1997
Springer
14 years 2 months ago
1997
Springer
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
CRYPTO
2006
Springer
14 years 1 months ago
2006
Springer
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
FORTE
2008
13 years 11 months ago
2008
Abstract. Several recent works have considered parameterized verification, i.e. automatic verification of systems consisting of an arbitrary number of finite-state processes organi...
AIPS
2004
13 years 11 months ago
2004
In this paper, we show how a planner can use a modelchecking verifier to guide state space search. In our work on hard real-time, closed-loop planning, we use a modelchecker'...