Results 1  10
of
121
An Integration of Model Checking with Automated Proof Checking
, 1995
"... Although automated proof checking tools for generalpurpose logics have been successfully employed in the verification of digital systems, there are inherent limits to the efficient automation of expressive logics. If the expressiveness is constrained, there are useful logic fragments for which effi ..."
Abstract

Cited by 100 (8 self)
 Add to MetaCart
(Show Context)
Although automated proof checking tools for generalpurpose logics have been successfully employed in the verification of digital systems, there are inherent limits to the efficient automation of expressive logics. If the expressiveness is constrained, there are useful logic fragments for which efficient decision procedures can be found. The model checking paradigm yields an important class of decision procedures for establishing temporal properties of finitestate systems. Model checking is remarkably effective for automatically verifying finite automata with relatively small state spaces, but is inadequate when the state spaces are either too large or unbounded. For this reason, it is useful to integrate the complementary technologies of model checking and proof checking. Such an integration has to be carried out in a delicate manner in order to be more than just the sum of the techniques. We describe...
Local Model Checking Games
 In: Proceedings of CONCUR
, 1995
"... Model checking is a very successful technique for verifying temporal properties of nite state concurrent systems. It is standard to view this method as essentially algorithmic, and consequently a very fruitful relationship between temporal logics and automata has been developed. In the case of bran ..."
Abstract

Cited by 98 (8 self)
 Add to MetaCart
(Show Context)
Model checking is a very successful technique for verifying temporal properties of nite state concurrent systems. It is standard to view this method as essentially algorithmic, and consequently a very fruitful relationship between temporal logics and automata has been developed. In the case of branching time logics the
Modal and Temporal Logics for Processes
, 1996
"... this paper have been presented at the 4th European Summer School in Logic, Language and Information, University of Essex, 1992; at the Tempus Summer School for Algebraic and Categorical Methods in Computer Science, Masaryk University, Brno, 1993; and the Summer School in Logic Methods in Concurrency ..."
Abstract

Cited by 91 (2 self)
 Add to MetaCart
(Show Context)
this paper have been presented at the 4th European Summer School in Logic, Language and Information, University of Essex, 1992; at the Tempus Summer School for Algebraic and Categorical Methods in Computer Science, Masaryk University, Brno, 1993; and the Summer School in Logic Methods in Concurrency, Aarhus University, 1993. I would like to thank the organisers and the participants of these summer schools, and of the Banff higher order workshop. I would also like to thank Julian Bradfield for use of his Tex tree constructor for building derivation trees and Carron Kirkwood, Faron Moller, Perdita Stevens and David Walker for comments on earlier drafts.
Specification and Verification of Dynamics in Agent Models
"... Within many domains, among which biological, cognitive, and social areas, multiple interacting processes occur among agents with dynamics that are hard to handle. This paper presents the predicate logical Temporal Trace Language (TTL) for the formal specification and analysis of dynamic properties o ..."
Abstract

Cited by 65 (51 self)
 Add to MetaCart
(Show Context)
Within many domains, among which biological, cognitive, and social areas, multiple interacting processes occur among agents with dynamics that are hard to handle. This paper presents the predicate logical Temporal Trace Language (TTL) for the formal specification and analysis of dynamic properties of agents and multiagent systems. This language supports the specification of both qualitative and quantitative aspects, and therefore subsumes specification languages based on differential equations and qualitative, logical approaches. A software environment has been developed for TTL, which supports editing TTL properties and enables the formal verification of properties against a set of traces. The TTL environment proved its value in a number of projects within different biological, cognitive and social domains.
Specification and Verification of Dynamics in Cognitive Agent Models
 In: Proceedings of the Sixth International Conference on Intelligent Agent Technology, IAT'06. IEEE Computer
, 2006
"... Within many domains, among which biological and cognitive areas, multiple interacting processes occur among agents with dynamics that are hard to handle. Current approaches to analyse the dynamics of such processes, often based on differential equations, are not always successful. As an alternative ..."
Abstract

Cited by 64 (55 self)
 Add to MetaCart
(Show Context)
Within many domains, among which biological and cognitive areas, multiple interacting processes occur among agents with dynamics that are hard to handle. Current approaches to analyse the dynamics of such processes, often based on differential equations, are not always successful. As an alternative to differential equations, this paper presents the predicate logical Temporal Trace Language (TTL) for the formal specification and analysis of dynamic properties. This language supports the specification of both qualitative and quantitative aspects, and therefore subsumes specification languages based on differential equations. A software environment has been developed for TTL, that supports editing TTL properties and enables the formal verification of properties against a set of traces. The TTL environment proved its value in a number of projects within different domains. 1.
Verification of relational datacentric dynamic systems with external services
, 2013
"... Datacentric dynamic systems are systems where both the process controlling the dynamics and the manipulation of data are equally central. We study verification of (firstorder) µcalculus variants over relational datacentric dynamic systems, where data are maintained in a relational database, and ..."
Abstract

Cited by 50 (19 self)
 Add to MetaCart
(Show Context)
Datacentric dynamic systems are systems where both the process controlling the dynamics and the manipulation of data are equally central. We study verification of (firstorder) µcalculus variants over relational datacentric dynamic systems, where data are maintained in a relational database, and the process is described in terms of atomic actions that evolve the database. Action execution may involve calls to external services, thus inserting fresh data into the system. As a result such systems are infinitestate. We show that verification is undecidable in general, and we isolate notable cases where decidability is achieved. Specifically we start by considering service calls that return values deterministically (depending only on passed parameters). We show that in a µcalculus variant that preserves knowledge of objects appeared along a run we get decidability under the assumption that the fresh data introduced along a
Actions Speak Louder than Words: Proving Bisimilarity for ContextFree Processes
, 1997
"... Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant contextfree grammars. In this paper we provide a much simpler and much more direct proof of this result using a tableau decision method involving goaldirected ..."
Abstract

Cited by 47 (10 self)
 Add to MetaCart
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant contextfree grammars. In this paper we provide a much simpler and much more direct proof of this result using a tableau decision method involving goaldirected rules. The decision procedure also provides the essential part of the bisimulation relation between two processes which underlies their equivalence. We also show how to obtain a sound and complete sequentbased equational theory for such processes from the tableau system and how one can extract what Caucal calls a fundamental relation from a successful tableau.
PiADL: an Architecture Description Language based on the higherorder typed picalculus for specifying dynamic and mobile software architectures
 SIGSOFT Softw. Eng. Notes
, 2004
"... A key aspect of the design of any software system is its architecture. An architecture description, from a runtime perspective, should provide a formal specification of the architecture in terms of components and connectors and how they are composed together. Further, a dynamic or mobile architectur ..."
Abstract

Cited by 41 (6 self)
 Add to MetaCart
(Show Context)
A key aspect of the design of any software system is its architecture. An architecture description, from a runtime perspective, should provide a formal specification of the architecture in terms of components and connectors and how they are composed together. Further, a dynamic or mobile architecture description must provide a specification of how the architecture of the software system can change at runtime. Enabling specification of dynamic and mobile architectures is a large challenge for an Architecture Description Language (ADL). This article describes πADL, a novel ADL that has been designed in the ArchWare European Project to address specification of dynamic and mobile architectures. It is a formal, wellfounded theoretically language based on the higherorder typed πcalculus. While most ADLs focus on describing software architectures from a structural viewpoint, πADL focuses on formally describing architectures encompassing both the structural and behavioural viewpoints. The πADL design principles, concepts and notation are presented. How πADL can be used for specifying static, dynamic and mobile architectures is illustrated through case studies. The πADL toolset is outlined.
A model checking language for concurrent valuepassing systems
 Proc. of FM’2008, LNCS
, 2008
"... Abstract. Modal µcalculus is an expressive specification formalism for temporal properties of concurrent programs represented as Labeled Transition Systems (Ltss). However, its practical use is hampered by the complexity of the formulas, which makes the specification task difficult and errorpron ..."
Abstract

Cited by 36 (7 self)
 Add to MetaCart
(Show Context)
Abstract. Modal µcalculus is an expressive specification formalism for temporal properties of concurrent programs represented as Labeled Transition Systems (Ltss). However, its practical use is hampered by the complexity of the formulas, which makes the specification task difficult and errorprone. In this paper, we propose Mcl (Model Checking Language), an enhancement of modal µcalculus with highlevel operators aimed at improving expressiveness and conciseness of formulas. The main Mcl ingredients are parameterized fixed points, action patterns extracting data values from Lts actions, modalities on transition sequences described using extended regular expressions and programming language constructs, and an infinite looping operator specifying fairness. We also present a method for onthefly model checking of Mcl formulas on finite Ltss, based on the local resolution of boolean equation systems, which has a lineartime complexity for alternationfree and fairness formulas. Mcl is supported by the Evaluator 4.0 model checker developed within the Cadp verification toolbox. 1
The existence of finite abstractions for branching time model checking
 In LICS (2004
"... Abstraction is often essential to verify a program with model checking. Typically, a concrete source program with an infinite (or finite, but large) state space is reduced to a small, finite state, abstract program on which a correctness property can be checked. The fundamental question we investig ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
(Show Context)
Abstraction is often essential to verify a program with model checking. Typically, a concrete source program with an infinite (or finite, but large) state space is reduced to a small, finite state, abstract program on which a correctness property can be checked. The fundamental question we investigate in this paper is whether such a reduction to finite state programs is always possible, for arbitrary branching time temporal properties. We begin by showing that existing abstraction frameworks are inherently incomplete for verifying purely existential or mixed universalexistential properties. We then propose a new, complete abstraction framework which is based on a class of focused transition systems (FTS’s). The key new feature in FTS’s is a way of “focusing ” an abstract state to a set of more precise abstract states. While focus operators have been defined for specific contexts, this result shows their fundamental usefulness for proving nonuniversal properties. The constructive completeness proof provides linear size maximal models for properties expressed in logics such as CTL and the mucalculus. This substantially improves upon known (worstcase) exponential size constructions for their universal fragments. 1.