Results 1  10
of
20
Model Checking for Programming Languages using VeriSoft
 IN PROCEEDINGS OF THE 24TH ACM SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES
, 1997
"... Verification by statespace exploration, also often referred to as "model checking", is an effective method for analyzing the correctness of concurrent reactive systems (e.g., communication protocols). Unfortunately, existing modelchecking techniques are restricted to the verification of properties ..."
Abstract

Cited by 369 (12 self)
 Add to MetaCart
Verification by statespace exploration, also often referred to as "model checking", is an effective method for analyzing the correctness of concurrent reactive systems (e.g., communication protocols). Unfortunately, existing modelchecking techniques are restricted to the verification of properties of models, i.e., abstractions, of concurrent systems. In this paper, we discuss how model checking can be extended to deal directly with "actual" descriptions of concurrent systems, e.g., implementations of communication protocols written in programming languages such as C or C++. We then introduce a new search technique that is suitable for exploring the state spaces of such systems. This algorithm has been implemented in VeriSoft, a tool for systematically exploring the state spaces of systems composed of several concurrent processes executing arbitrary C code. As an example of application, we describe how VeriSoft successfully discovered an error in a 2500line C program controlling rob...
An Efficient Reactive Planner for Synthesizing Reactive Plans
 In Proceedings of AAAI91
, 1991
"... We present a nonlinear forwardsearch method suitable for planning the reactions of an agent operating in a highly unpredictable environment. We show that this method is more efficient than existing linear methods. We then introduce the notion of safety and liveness rules. This makes possible a shar ..."
Abstract

Cited by 36 (4 self)
 Add to MetaCart
We present a nonlinear forwardsearch method suitable for planning the reactions of an agent operating in a highly unpredictable environment. We show that this method is more efficient than existing linear methods. We then introduce the notion of safety and liveness rules. This makes possible a sharper exploitation of the information retrieved when exploring the future of the agent. Introduction Classically, a plan is a set of actions to guide an agent from its current situation to another situation called the goal. If the result of these actions is not always the expected one, the agent is said to be operating in an unpredictable environment. Under this assumption, the agent may be deviated at any time from the intermediate situations expected in its plan. Whenever there is such a deviation, the agent has to replan from its new current situation. In realtime applications, the agent does not always have the time to replan. This prompted the development of new agent architectures whe...
Model Generation by Moderated Regular Extrapolation
, 2002
"... This paper introduc es regular extrapolation, a tec hnique that pro ides desc riptions of systems or system aspec ts a posteriori in a largely automatic way. The desc riptionsc ome in the form of models whic h o#er the possibility of mec hanic5]4 produc ing system tests, grading ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
This paper introduc es regular extrapolation, a tec hnique that pro ides desc riptions of systems or system aspec ts a posteriori in a largely automatic way. The desc riptionsc ome in the form of models whic h o#er the possibility of mec hanic5]4 produc ing system tests, grading test suites and monitoring running systems. Regular extrapolation builds models from obser ations ia tec hniques frommac hine learning and finite automata theory. Also expert knowledge about the system enters the model c nstruc5 on in a systematic way. The power of this approac h is illustrated in thec4 text of a test en ironment for telec64 munic] ion systems.
Strategic Directions in Concurrency Research
 ACM COMPUTING SURVEYS
, 1996
"... Concurrency is concerned with the fundamental aspects of systems of multiple, simultaneously active computing agents that interact with one another. This notion is ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
Concurrency is concerned with the fundamental aspects of systems of multiple, simultaneously active computing agents that interact with one another. This notion is
Partial Order and SOS Semantics for Linear Constraint Programs
 In Proc. of Coordinationâ€™97, volume 1282 of LNCS
, 1997
"... ..."
On the Costs and Benefits of using PartialOrder Methods for the Verification of Concurrent Systems
 Proceedings of DIMACS Workshop on PartialOrder Methods in Verification
, 1997
"... Verification by statespace exploration is one of the most successful strategies for analyzing the correctness of finitestate concurrent reactive systems. Partialorder methods are algorithms for dynamically pruning the state space of such systems without incurring the risk of any incompleteness in ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
Verification by statespace exploration is one of the most successful strategies for analyzing the correctness of finitestate concurrent reactive systems. Partialorder methods are algorithms for dynamically pruning the state space of such systems without incurring the risk of any incompleteness in the verification results. This paper presents results of experiments performed with these algorithms on real protocol examples, and discusses the practical significance of partialorder methods. 1. Introduction Statespace exploration is one of the most successful strategies for checking the correctness of finitestate concurrent reactive systems. It consists in exploring a global state graph, called the state space, representing the combined behavior of all concurrent components in the system. Many different types of properties of a system can be checked by exploring its state space: deadlocks, dead code, unspecified receptions, violations of userspecified assertions, etc. Moreo...
Relational Semantics of NonDeterministic Dataflow
, 1997
"... We recast dataflow in a modern categorical light using profunctors as a generalization of relations. The well known causal anomalies associated with relational semantics of indeterminate dataflow are avoided, but still we preserve much of the intuitions of a relational model. The development fit ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
We recast dataflow in a modern categorical light using profunctors as a generalization of relations. The well known causal anomalies associated with relational semantics of indeterminate dataflow are avoided, but still we preserve much of the intuitions of a relational model. The development fits with the view of categories of models for concurrency and the general treatment of bisimulation they provide. In particular it fits with the recent categorical formulation of feedback using traced monoidal categories. The payoffs are: (1) explicit relations to existing models and semantics, especially the usual axioms of monotone IO automata are read off from the definition of profunctors, (2) a new definition of bisimulation for dataflow, the proof of the congruence of which benefits from the preservation properties associated with open maps and (3) a treatment of higherorder dataflow as a biproduct, essentially by following the geometry of interaction programme.
Operational and Denotational Semantics for the Box Algebra
 Theoretical Computer Science
, 1997
"... This paper describes general theory underpinning the operational semantics and the denotational Petri net semantics of the box algebra including recursion. For the operational semantics, inductive rules for process expressions are given. For the net semantics, a general mechanism of refinement and r ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
This paper describes general theory underpinning the operational semantics and the denotational Petri net semantics of the box algebra including recursion. For the operational semantics, inductive rules for process expressions are given. For the net semantics, a general mechanism of refinement and relabelling is introduced, using which the connectives of the algebra are defined. The paper also describes a denotational approach to the Petri net semantics of recursive expressions. A domain of nets is identified such that the solution of a given recursive equation can be found by fixpoint approximation from some suitable starting point. The consistency of the two semantics is demonstrated. The theory is generic for a wide class of algebraic operators and synchronisation schemes. Keywords: Petri nets, process algebra, refinement, denotational semantics, operational semantics, recursion, bisimulation.
On combining the Persistent Sets Method with the Covering Steps Graph Method
, 2002
"... Concurrent systems are commonly verified after computing a state graph describing all possible behaviors. Unfortunately, this state graph is often too large to be effectively built. Partialorder techniques have been developped to avoid combinatorial explosion while preserving the properties of inte ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Concurrent systems are commonly verified after computing a state graph describing all possible behaviors. Unfortunately, this state graph is often too large to be effectively built. Partialorder techniques have been developped to avoid combinatorial explosion while preserving the properties of interest. This paper investigates the combination of two of such approaches, Persistent sets and Covering Steps, and proposes partial enumeration algorithms that cumulate their respective benefits.
Petri Nets, Process Algebras and Concurrent Programming Languages
 In: Advances in Petri Nets. Lectures on Petri Nets II: Applications, W. Reisig and G.Rozenberg (Eds.). SpringerVerlag, Lecture Notes in Computer Science 1492
, 1998
"... This paper discusses issues that arise when process algebras and Petri nets are linked; in particular, operators, compositionality, recursion, refinement and equivalences. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This paper discusses issues that arise when process algebras and Petri nets are linked; in particular, operators, compositionality, recursion, refinement and equivalences.