Add to ORKGWe consider an extension of logic programs, called ω-programs, that can be used to define predicates over infinite lists. ω-programs allow us to specify properties of the infinite behavior of reactive systems and, in general, properties of infinite sequences of events. The semantics of ω-programs is an extension of the perfect model semantics. We present variants of the familiar unfold/fold rules which can be used for transforming ω-programs. We show that these new rules are correct, that is, their application preserves the perfect model semantics. Then we outline a general methodology based on program transformation for verifying properties of ω-programs. We demonstrate the power of our transformation-based verification methodology by prov...
We illustrate the use of logic programming techniques for finite model checking of CTL formulae. We ...
The contribution of this thesis consists in the extension of the techniques for the transformation o...
We present an overview of the program transformation techniques which have been proposed over the pa...
We consider an extension of logic programs, called ω-programs, that can be used to define predicates...
We consider an extension of the class of logic programs, called !-programs, that can be used to def...
We consider an extension of logic programs, called ω-programs, that can be used to define predicates...
We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL...
We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL...
We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL...
We present a new method for verifying Linear Temporal Logic (LTL) properties of finite state reacti...
We present an automated abstract verification method for infinite-state systems specified by logic...
We present an automated abstract verification method for infinite-state systems specified by logic p...
We establish principles for proving properties about infinite computations by reasoning about finit...
We illustrate the use of logic programming techniques for finite model checking of CTL formulae. We ...
We present an overview of the program transformation techniques which have been proposed over the pa...
We illustrate the use of logic programming techniques for finite model checking of CTL formulae. We ...
The contribution of this thesis consists in the extension of the techniques for the transformation o...
We present an overview of the program transformation techniques which have been proposed over the pa...
We consider an extension of logic programs, called ω-programs, that can be used to define predicates...
We consider an extension of the class of logic programs, called !-programs, that can be used to def...
We consider an extension of logic programs, called ω-programs, that can be used to define predicates...
We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL...
We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL...
We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL...
We present a new method for verifying Linear Temporal Logic (LTL) properties of finite state reacti...
We present an automated abstract verification method for infinite-state systems specified by logic...
We present an automated abstract verification method for infinite-state systems specified by logic p...
We establish principles for proving properties about infinite computations by reasoning about finit...
We illustrate the use of logic programming techniques for finite model checking of CTL formulae. We ...
We present an overview of the program transformation techniques which have been proposed over the pa...
We illustrate the use of logic programming techniques for finite model checking of CTL formulae. We ...
The contribution of this thesis consists in the extension of the techniques for the transformation o...
We present an overview of the program transformation techniques which have been proposed over the pa...