Results 1  10
of
243
Combination Methods for Satisfiability and ModelChecking of InfiniteState Systems. Accepted for publication
 in CADE 2007. Available at http://homes.dsi.unimi.it/ ∼ zucchell/publications/conference/ GhiNiRaZuCADE07.pdf
"... Abstract. Manna and Pnueli have extensively shown how a mixture of firstorder logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problems for the class of reactive systems. Theories in FOL model the (possibly infinite) data structures used by a r ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
reactive system while LTL specifies its (dynamic) behavior. In this paper, we derive undecidability and decidability results for both the satisfiability of (quantifierfree) formulae and the modelchecking of safety properties by lifting combination methods for (nondisjoint) theories in FOL. The proofs
Combination Methods for Satisfiability and ModelChecking of InfiniteState Systems
, 2007
"... Manna and Pnueli have extensively shown how a mixture of firstorder logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problems for the vast class of reactive systems. Theories in FOL model the (possibly infinite) data structures used by a reacti ..."
Abstract
 Add to MetaCart
reactive system while LTL specifies its (dynamic) behavior. The combination of LTL and FOL allows us to specify infinite state systems and the subtle ways in which their data flow influences the control flow. Indeed, the capability of automatically solving satisfiability and modelchecking problems
Combination Methods for ModelChecking of InfiniteState Systems ∗
"... Manna and Pnueli have extensively shown how a mixture of firstorder logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problems for the class of reactive systems. Theories in FOL model the (possibly infinite) data structures used by a reactive sys ..."
Abstract
 Add to MetaCart
in FOL and the exploration of a safety graph (associated to the system) can be integrated. This paves the way to employ efficient Satisfiability Modulo Theories solvers in the modelchecking of infinite state systems. We illustrate our technique on an example. 1
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 13 (0 self)
 Add to MetaCart
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
A Unified Framework for Hybrid Control: Model and Optimal Control Theory
 IEEE TRANSACTIONS ON AUTOMATIC CONTROL
, 1998
"... Complex natural and engineered systems typically possess a hierarchical structure, characterized by continuousvariable dynamics at the lowest level and logical decisionmaking at the highest. Virtually all control systems todayfrom flight control to the factory floorperform computercoded chec ..."
Abstract

Cited by 305 (9 self)
 Add to MetaCart
coded checks and issue logical as well as continuousvariable control commands. The interaction of these different types of dynamics and information leads to a challenging set of "hybrid" control problems. We propose a very general framework that systematizes the notion of a hybrid system, combining
Lazy theorem proving for bounded model checking over infinite domains
, 2002
"... Abstract. We investigate the combination of propositional SAT checkers with domainspecific theorem provers as a foundation for bounded model checking over infinite domains. Given a program M over an infinite state type, a linear temporal logic formula ' with domainspecific constraints over pr ..."
Abstract

Cited by 91 (11 self)
 Add to MetaCart
, and investigate the lazy integration of SAT solving and theorem proving. 1 Introduction Model checking decides the problem of whether a system satisfies a temporal logic property by exploring the underlying state space. It applies primarily to finitestate systems but also to certain infinitestate systems
Abstraction in directed model checking
 In ICAPSWorkshop on Connecting Planning Theory with Practice
, 2004
"... Abstraction is one of the most important issues to cope with large and infinite state spaces in model checking system satisfies a correctness specification, so does the concrete one. However, abstractions may introduce a behavior violating the specification that is not present in the original system ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Abstraction is one of the most important issues to cope with large and infinite state spaces in model checking system satisfies a correctness specification, so does the concrete one. However, abstractions may introduce a behavior violating the specification that is not present in the original
Fluent Model Checking for Eventbased Systems
 In Proceedings of FSE
, 2003
"... Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in which atomic propositions are predicates over state variables of the system. In eventbased system descriptions, states ..."
Abstract

Cited by 72 (9 self)
 Add to MetaCart
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in which atomic propositions are predicates over state variables of the system. In eventbased system descriptions, states
Model Checking Software Systems: A Case Study
, 1995
"... Model checking is a proven successful technology for verifying hardware. It works, however, on only finite state machines, and most software systems have infinitely many states. Our approach to applying model checking to software hinges on identifying appropriate abstractions that exploit the nature ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
Model checking is a proven successful technology for verifying hardware. It works, however, on only finite state machines, and most software systems have infinitely many states. Our approach to applying model checking to software hinges on identifying appropriate abstractions that exploit
A Case Study in Model Checking Software Systems
 Science of Computer Programming
, 1997
"... Model checking is a proven successful technology for verifying hardware. It works, however, on only finite state machines, and most software systems have infinitely many states. Our approach to applying model checking to software hinges on identifying appropriate abstractions that exploit the nature ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
Model checking is a proven successful technology for verifying hardware. It works, however, on only finite state machines, and most software systems have infinitely many states. Our approach to applying model checking to software hinges on identifying appropriate abstractions that exploit
Results 1  10
of
243