Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
18,207
Automatic verification of finite-state concurrent systems using temporal logic specifications
- ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract
-
Cited by 1388 (62 self)
- Add to MetaCart
We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem
, 1995
"... State-space exploration techniques are increasingly being used for debugging and proving correct finite-state concurrent reactive systems. The reason for this success is mainly the simplicity of these techniques. Indeed, they are easy to understand, easy to implement and, last but not least, easy to ..."
Abstract
-
Cited by 368 (12 self)
- Add to MetaCart
State-space exploration techniques are increasingly being used for debugging and proving correct finite-state concurrent reactive systems. The reason for this success is mainly the simplicity of these techniques. Indeed, they are easy to understand, easy to implement and, last but not least, easy
On optimistic methods for concurrency control
- ACM Transactions on Database Systems
, 1981
"... Most current approaches to concurrency control in database systems rely on locking of data objects as a control mechanism. In this paper, two families of nonlocking concurrency controls are presented. The methods used are “optimistic ” in the sense that they rely mainly on transaction backup as a co ..."
Abstract
-
Cited by 546 (1 self)
- Add to MetaCart
Most current approaches to concurrency control in database systems rely on locking of data objects as a control mechanism. In this paper, two families of nonlocking concurrency controls are presented. The methods used are “optimistic ” in the sense that they rely mainly on transaction backup as a
Preemption in Concurrent Systems
, 1993
"... Process preemption deals with controlling the life and death of concurrent processes. Well-defined preemption mechanisms are essential in control-dominated reactive and real-time programming, and accurate handling of preemption requires a time-dependent model. We first informally discuss what pre ..."
Abstract
-
Cited by 73 (0 self)
- Add to MetaCart
. 1 Introduction In concurrent systems, one deals with concurrent processes that coordinate with each other. Coordination can result from information exchange, using for example messages circulating on channels with possibly some implied synchronization. It can also result from process preemption
Detecting Deadlocks In Concurrent Systems
- IN CONCUR’98: CONCURRENCY THEORY (NICE
, 1998
"... We study deadlocks using geometric methods based on generalized process graphs [11], i.e., cubical complexes or Higher-Dimensional Automata (HDA) [23, 24, 30, 35], describing the semantics of the concurrent system of interest. A new algorithm is described and fully assessed, both theoretically a ..."
Abstract
-
Cited by 50 (12 self)
- Add to MetaCart
We study deadlocks using geometric methods based on generalized process graphs [11], i.e., cubical complexes or Higher-Dimensional Automata (HDA) [23, 24, 30, 35], describing the semantics of the concurrent system of interest. A new algorithm is described and fully assessed, both theoretically
OF RANDOM BEHAVIOURS OF CONCURRENT SYSTEMS
, 2012
"... The paper presents a theoretical basis for describing and analysing random behaviours of concurrent systems of a broad class. ..."
Abstract
- Add to MetaCart
The paper presents a theoretical basis for describing and analysing random behaviours of concurrent systems of a broad class.
Verification Tools for Finite-State Concurrent Systems
"... Temporal logic model checking is an automatic technique for verifying finite-state concurrent systems. Specifications are expressed in a propositional temporal logic, and the concurrent system is modeled as a state-transition graph. An efficient search procedure is used to determine whether or not t ..."
Abstract
-
Cited by 130 (3 self)
- Add to MetaCart
Temporal logic model checking is an automatic technique for verifying finite-state concurrent systems. Specifications are expressed in a propositional temporal logic, and the concurrent system is modeled as a state-transition graph. An efficient search procedure is used to determine whether
Specifying Objects of Concurrent Systems
, 1991
"... Formal specification can play an important role in the design, development, and maintenance of concurrent systems. However, existing languages for specifying concurrent systems lack the same maturity as those for sequential programs. In this dissertation, we define a formal language, the Generic Con ..."
Abstract
-
Cited by 12 (0 self)
- Add to MetaCart
Formal specification can play an important role in the design, development, and maintenance of concurrent systems. However, existing languages for specifying concurrent systems lack the same maturity as those for sequential programs. In this dissertation, we define a formal language, the Generic
Property preserving abstractions for the verification of concurrent systems
- FORMAL METHODS IN SYSTEM DESIGN, VOL 6, ISS
, 1995
"... We study property preserving transformations for reactive systems. The main idea is the use of simulations parameterized by Galois connections ( �), relating the lattices of properties of two systems. We propose and study a notion of preservation of properties expressed by formulas of a logic, by a ..."
Abstract
-
Cited by 152 (6 self)
- Add to MetaCart
for a system by verifying the same property on a simpler system which is an abstraction of it. We show also under which conditions abstraction of concurrent systems can be computed from the abstraction of their components. This allows a compositional application of the proposed verification method
Distributed Database Systems
"... this article, we discuss the fundamentals of distributed DBMS technology. We address the data distribution and architectural design issues as well as the algorithms that need to be implemented to provide the basic DBMS functions such as query processing, concurrency control, reliability, and replica ..."
Abstract
-
Cited by 588 (26 self)
- Add to MetaCart
this article, we discuss the fundamentals of distributed DBMS technology. We address the data distribution and architectural design issues as well as the algorithms that need to be implemented to provide the basic DBMS functions such as query processing, concurrency control, reliability
Results 1 - 10
of
18,207
