Results 1  10
of
524
OnTheFly Model Checking of RCTL Formulas
 In Proc. 10 th International Conference on Computer Aided Verification (CAV’98), LNCS 1427
, 1998
"... The specification language RCTL, an extension of CTL, is defined by adding the power of regular expressions to CTL. In addition to being a more expressive and natural hardware specification language than CTL, a large family of RCTL formulas can be verified onthefly (during symbolic reachability ..."
Abstract

Cited by 48 (15 self)
 Add to MetaCart
reachability analysis). Onthefly model checking, as a powerful verification paradigm, is especially efficient when the specification is false and extremely efficient when the computation needed to get to a failing state is short. It is suitable for the inherently gradual design process since it detects a
Combining Partial Order Reductions with Onthefly Modelchecking
, 1994
"... Abstract Partial order modelchecking is an approach to reduce time and memory in modelchecking concurrent programs. Onthefly modelchecking is a technique to eliminate part of the search by intersecting an automaton representing the (negation of the) checked property with the state space during i ..."
Abstract

Cited by 212 (14 self)
 Add to MetaCart
Abstract Partial order modelchecking is an approach to reduce time and memory in modelchecking concurrent programs. Onthefly modelchecking is a technique to eliminate part of the search by intersecting an automaton representing the (negation of the) checked property with the state space during
OntheFly Model Checking of Security Protocols
, 2008
"... Security protocols, although each of them only contains several flows, easily cause attacks even without breaking cryptography algorithms. Design and analysis of security protocols prove to be a challenging problem over 30 years. Many formalisms have been adopted to describe security protocols, and ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
of principals one principal communicates with, and an unbounded number of messages intruders and dishonest principals produce. A dilemma has occurred when one tries to propose a methodology for security protocol analysis, dealing with the infinity factors introduced above. On the one hand, a model for security
OntheFly Model checking under Fairness that Exploits Symmetry
 CAV97, LNCS 1254
, 1997
"... . An onthefly algorithm for model checking under fairness is presented. The algorithm utilizes symmetry in the program to reduce the state space, and employs novel techniques that make the onthefly model checking feasible. The algorithm uses state symmetry and eliminates parallel edges in the re ..."
Abstract

Cited by 31 (4 self)
 Add to MetaCart
. An onthefly algorithm for model checking under fairness is presented. The algorithm utilizes symmetry in the program to reduce the state space, and employs novel techniques that make the onthefly model checking feasible. The algorithm uses state symmetry and eliminates parallel edges
Onthefly Model Checking from Interval Logic Specifications
 ACM SIGPLAN Notices
"... Future Interval Logic (FIL) and its intuitive graphical representation, Graphical Interval Logic (GIL), can be used as the formal description language of model checking tools to verify hardware and software systems. An interval clearly defines the temporal scope over which properties are evaluated. ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
. From interval formulas specifying the temporal behavior of a system we obtain their semantically equivalent Büchi automata, but in such a way that our algorithm can be integrated into an onthefly model checking tool. As the property automaton can be generated simultaneously with, and guided by
"Next" Heuristic For OnTheFly Model Checking
, 1999
"... . We present a new heuristic for onthefly enumerative invariant verification. The heuristic is based on a construct for temporal scaling, called next, that compresses a sequence of transitions leading to a given target set into a single metatransition. First, we give an onthefly algorithm to s ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
. We present a new heuristic for onthefly enumerative invariant verification. The heuristic is based on a construct for temporal scaling, called next, that compresses a sequence of transitions leading to a given target set into a single metatransition. First, we give an onthefly algorithm
Distributed onthefly model checking and test case generation
 In Antti Valmari, editor, Proceedings of the 13th International SPIN Workshop on Model Checking of Software SPIN’2006
"... ap por t de r ech er ch e ..."
OntheFly Model Checking of Program Runs for Automated Debugging
, 1998
"... In this paper, an onthefly algorithm is developed for model checking of temporal logic safety properties on partially ordered occurrence net structures. This algorithm is used for the automated debugging of parallel programs. During the monitoring of a program run, a state action net is constructe ..."
Abstract
 Add to MetaCart
In this paper, an onthefly algorithm is developed for model checking of temporal logic safety properties on partially ordered occurrence net structures. This algorithm is used for the automated debugging of parallel programs. During the monitoring of a program run, a state action net
OnTheFly Model Checking of Timed Properties on Time Petri Nets
"... Abstract. This paper deals with model checking of timed systems modeled by Time Petri nets (TPN). We propose a new finite graph, called Timed Aggregate Graph (TAG), abstracting the behavior of bounded TPNs with strong time semantics. The main feature of this abstract representation compared to exi ..."
Abstract
 Add to MetaCart
to existing approaches is the encoding of the time information. This is done in a pure way within each node of the TAG allowing to compute the minimum and maximum elapsed time in every path of the graph. The TAG preserves runs and reachable states of the corresponding TPN and allows for onthefly
FBT: A Tool for Applying Interval Logic Specifications to Onthefly Model Checking
"... Abstract: This paper presents the FBT (FIL to Büchi automaton Translator) tool which automatically translates any formula from FIL (Future Interval Logic) into its semantically equivalent Büchi automaton. There are two advantages of using this logic for specifying and verifying system properties ins ..."
Abstract
 Add to MetaCart
, intuitive, graphical representation. The underlying algorithm of the tool is based on the tableau method and is specially intended for application in onthefly model checking. In addition to a description of the design and implementation structure of FBT, we also present some experimental results obtained
Results 1  10
of
524