Results 1 
2 of
2
Global modelchecking of infinitestate systems
 in: Proc. 16th International Conference on Computer Aided Verification, CAV’04, in: LNCS
, 2004
"... Abstract. We extend the automatatheoretic framework for reasoning about infinitestate sequential systems to handle also the global modelchecking problem. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed a ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract. We extend the automatatheoretic framework for reasoning about infinitestate sequential systems to handle also the global modelchecking problem. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finitestate automata. Checking that the system satisfies a temporal property can then be done by a twoway automaton that navigates through the tree. The framework is known for local model checking. For branching time properties, the framework uses twoway alternating automata. For linear time properties, the framework uses twoway path automata. In order to solve the global modelchecking problem we show that for both types of automata, given a regular tree, we can construct a nondeterministic word automaton that accepts all the nodes in the tree from which an accepting run of the automaton can start. 1
Model Checking for Database Theoreticians
 IN ICDT’05
, 2005
"... Algorithmic verification is one of the most successful applications of automated reasoning in computer science. In algorithmic verification one uses algorithmic techniques to establish the correctness of the system under verification with respect to a given property. Model checking is an algorithmi ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Algorithmic verification is one of the most successful applications of automated reasoning in computer science. In algorithmic verification one uses algorithmic techniques to establish the correctness of the system under verification with respect to a given property. Model checking is an algorithmicverification technique that is based on a small number of key ideas, tying together graph theory, automata theory, and logic. In this selfcontained talk I will describe how this "holy trinity" gave rise to algorithmicverification tools, and discuss its applicability to database verification.