Results 1  10
of
30,056
CTLProperty Transformations along an Incremental Design Process
 In AVOCS’04, volume 128 of ENCS
, 2004
"... Abstract. This paper formalizes an incremental approach to design VCI to PI protocol converters (VCIPI wrappers) and presents a hierarchy of wrappers ranking from the simplest one up to the most complex one. In order to formally verify the correctness of a wrapper, a set of CTL properties is assign ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. This paper formalizes an incremental approach to design VCI to PI protocol converters (VCIPI wrappers) and presents a hierarchy of wrappers ranking from the simplest one up to the most complex one. In order to formally verify the correctness of a wrapper, a set of CTL properties
Model checking CTL Properties of Pushdown Systems
 In FSTTCS’00, LNCS 1974
, 2000
"... A pushdown system is a graph G(P ) of configurations of a pushdown automaton P . The model checking problem for a logic L is: given a pushdown automaton P and a formula # # L decide if # holds in the vertex of G(P ) which is the initial configuration of P . Computation Tree Logic (CTL) and its fra ..."
Abstract

Cited by 55 (1 self)
 Add to MetaCart
A pushdown system is a graph G(P ) of configurations of a pushdown automaton P . The model checking problem for a logic L is: given a pushdown automaton P and a formula # # L decide if # holds in the vertex of G(P ) which is the initial configuration of P . Computation Tree Logic (CTL) and its
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 574 (50 self)
 Add to MetaCart
, many standard program properties, such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does
Compositional Model Checking
, 1999
"... We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type of approac ..."
Abstract

Cited by 3218 (68 self)
 Add to MetaCart
component with its interface processes and then checking properties of this composition, we can guarantee that these properties will be preserved at the global level. We give two example compositional systems based on the logic CTL*.
Verifying CTL Properties of Infinite State Systems by Specializing Constraint Logic Programs
, 2001
"... this paper we assume that a system makes transitions from states to states and its evolution can be formalized using a computation tree which is dened as follows. Given a system S and its initial state s 0 , the root of the computation tree for S is s 0 , and every node s i of the computation tree f ..."
Abstract

Cited by 28 (19 self)
 Add to MetaCart
this paper we assume that a system makes transitions from states to states and its evolution can be formalized using a computation tree which is dened as follows. Given a system S and its initial state s 0 , the root of the computation tree for S is s 0 , and every node s i of the computation tree for S has a child node s j i there exists in S a transition from state s i to state s j , called a successor state of s i . The set of all states of a system may be nite or innite. We assume that in every system for every state s i there exists at least one successor state
CTL Property Language in Formal Verification of Systems A System Approach
"... Abstract: We use symbolic model checking to verify a VHDL design. This paper mainly focuses on Computational Tree Logic (CTL) for model checking problem. We have explained these two terms “CTL” and “model checking ” for providing a clear idea about these two. Most importantly we have explored the w ..."
Abstract
 Add to MetaCart
the ways of uses of CTL formulae in the case of model checking. The importance of the model checking, the ways of specifying properties in CTL and some most commonly used CTL formulae in checking are also stated. Also the uses and importance of fairness constraints in CTL formula and the conversion of CTL
Checking Extended CTL properties Using Guarded Quotient Structures
"... We extend CTL logic to a logic called COUNT CTL (CCTL) for specifying properties of concurrent programs with large number of processes. We present a model checking algorithm for symmetric or partially symmetric systems when their correctness specification is given in CCTL. The modelchecking algorit ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We extend CTL logic to a logic called COUNT CTL (CCTL) for specifying properties of concurrent programs with large number of processes. We present a model checking algorithm for symmetric or partially symmetric systems when their correctness specification is given in CCTL. The model
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 system. We also show how this approach can be adapted to handle fairness. We argue that our technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finitestate concurrent systems. Experimental results show that state machines with several hundred states can be checked in a matter of seconds.
Temporal and modal logic
 HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract

Cited by 1300 (17 self)
 Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
Results 1  10
of
30,056