Results 1  10
of
1,462,491
On Reachability And Safety In InfiniteState Systems
"... We introduce some new models of infinitestate transition systems. The basic model, called a (reversalbounded) counter machine (CM), is a nondeterministic finite automaton augmented with finitely many reversalbounded counters (i.e. each counter can be incremented or decremented by 1 and tested ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
that allow the use of linearrelation tests among the counters and parameterized constants as "primitive" predicates. We investigate the conditions under which these problems are still solvable. Keywords: automated verification, infinitestate systems, reachability, invariants 1.
Verification of Infinitestate Systems
, 2000
"... ion by Syntactic Program Transformations 9 8 Unfoldings of Innite State Systems 9 9 Provability in a Logic for Concurrent Objects is Wellstructured! 10 10 On the Complexity of Bisimulation Equivalence 11 11 Simulation and bisimulation over onecounter processes 12 12 Deciding rstorder nonregular ..."
Abstract
 Add to MetaCart
ion by Syntactic Program Transformations 9 8 Unfoldings of Innite State Systems 9 9 Provability in a Logic for Concurrent Objects is Wellstructured! 10 10 On the Complexity of Bisimulation Equivalence 11 11 Simulation and bisimulation over onecounter processes 12 12 Deciding rstorder non
Interprocedural dataflow analysis via graph reachability
, 1994
"... The paper shows how a large class of interprocedural dataflowanalysis problems can be solved precisely in polynomial time by transforming them into a special kind of graphreachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow fun ..."
Abstract

Cited by 454 (34 self)
 Add to MetaCart
The paper shows how a large class of interprocedural dataflowanalysis problems can be solved precisely in polynomial time by transforming them into a special kind of graphreachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow
Alternatingtime Temporal Logic
 Journal of the ACM
, 1997
"... Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general var ..."
Abstract

Cited by 615 (55 self)
 Add to MetaCart
Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general
Reachability Analysis of Pushdown Automata: Application to ModelChecking
, 1997
"... We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like mode ..."
Abstract

Cited by 385 (39 self)
 Add to MetaCart
We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like
Symbolic Algorithms for InfiniteState Games
, 2001
"... A procedure for the analysis of state spaces is called symbolic if it manipulates not individual states, but sets of states that are represented by constraints. Such a procedure can be used for the analysis of infinite state spaces, provided termination is guaranteed. We present symbolic procedures, ..."
Abstract

Cited by 52 (5 self)
 Add to MetaCart
, and corresponding termination criteria, for the solution of infinitestate games, which occur in the control and modular verification of infinitestate systems. To characterize the termination of symbolic procedures for solving infinitestate games, we classify these game structures into four increasingly
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) 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 1384 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) 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
A Framework for Defining Logics
 JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
, 1993
"... The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system of ariti ..."
Abstract

Cited by 807 (45 self)
 Add to MetaCart
conditions and leads to a uniform treatment of rules and proofs whereby rules are viewed as proofs of higherorder judgements and proof checking is reduced to type checking. The practical benefit of our treatment of formal systems is that logicindependent tools such as proof editors and proof checkers
The Semantics Of Constraint Logic Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract

Cited by 872 (14 self)
 Add to MetaCart
This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new
Results 1  10
of
1,462,491