Results 1  10
of
625
A type system equivalent to the modal mucalculus model checking of higherorder recursion schemes
 IN: PROCEEDINGS OF LICS
, 2009
"... The model checking of higherorder recursion schemes has important applications in the verification of higherorder programs. Ong has previously shown that the modal mucalculus model checking of trees generated by ordern recursion scheme is nEXPTIME complete, but his algorithm and its correctness ..."
Abstract

Cited by 41 (12 self)
 Add to MetaCart
The model checking of higherorder recursion schemes has important applications in the verification of higherorder programs. Ong has previously shown that the modal mucalculus model checking of trees generated by ordern recursion scheme is nEXPTIME complete, but his algorithm and its
Model checking the full modal mucalculus for infinite sequential processes
 Theoretical Computer Science
, 1997
"... Infinitestate systems, contextfree processes, pushdown processes, regular graphs, modal mucalculus, modelchecking. In this paper we develop a new elementary algorithm for modelchecking infinite sequential processes, including contextfree processes, pushdown processes, and regular graphs, that ..."
Abstract

Cited by 39 (0 self)
 Add to MetaCart
Infinitestate systems, contextfree processes, pushdown processes, regular graphs, modal mucalculus, modelchecking. In this paper we develop a new elementary algorithm for modelchecking infinite sequential processes, including contextfree processes, pushdown processes, and regular graphs
Complexity of Model Checking Recursion Schemes for Fragments of the Modal MuCalculus
"... Abstract. Ong has shown that the modal mucalculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possiblyinfinite ranked trees generated by ordern recursion schemes is nEXPTIME complete. We consider two subclasses of APT and investigate t ..."
Abstract

Cited by 14 (9 self)
 Add to MetaCart
Abstract. Ong has shown that the modal mucalculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possiblyinfinite ranked trees generated by ordern recursion schemes is nEXPTIME complete. We consider two subclasses of APT and investigate
PartialOrder Reduction in the Weak Modal MuCalculus
 Proceedings of the Eighth International Conference on Concurrency Theory (CONCUR '97), volume 1243 of Lecture Notes in Computer Science
, 1997
"... . We present a partialorder reduction technique for local model checking of hierarchical networks of labeled transition systems in the weak modal mucalculus. We have implemented our technique in the Concurrency Factory specification and verification environment; experimental results show that part ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
. We present a partialorder reduction technique for local model checking of hierarchical networks of labeled transition systems in the weak modal mucalculus. We have implemented our technique in the Concurrency Factory specification and verification environment; experimental results show
The mucalculus and modelchecking
"... This chapter presents a part of the theory of the mucalculus that is relevant to the, broadly understood, modelchecking problem. The mucalculus is one of the most important logics in modelchecking. It is a logic with an exceptional balance between expressiveness and algorithmic properties. The ..."
Abstract
 Add to MetaCart
This chapter presents a part of the theory of the mucalculus that is relevant to the, broadly understood, modelchecking problem. The mucalculus is one of the most important logics in modelchecking. It is a logic with an exceptional balance between expressiveness and algorithmic properties
Vacuity Checking in the Modal MuCalculus
 In Proceedings of AMASTâ€™02, volume 2422 of LNCS
, 2002
"... Abstract. Vacuity arises when a logical formula is trivially true in a given model due, for example, to antecedent failure. Beer et al. have recently introduced a logicindependent notion of vacuity and shown that certain logics, i.e., those with polarity, admit an efficient decision procedure for v ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
of antecedent failure that escape traditional vacuity analysis, including vacuous actions in temporal modalities and unnecessarily strong temporal operators. Furthermore, we have implemented an efficient redundancy checker for the modal mucalculus in the context of the XMC model checker. Our checker generates
Incremental Model Checking in the Modal MuCalculus
 IN CAV, VOLUME 818 OF LNCS
, 1994
"... We present an incremental algorithm for model checking in the alternation free fragment of the modal mucalculus, the first incremental algorithm for model checking of which we are aware. The basis for our algorithm, which we call MCI (for Model Checking Incrementally), is a lineartime algorithm d ..."
Abstract

Cited by 41 (3 self)
 Add to MetaCart
We present an incremental algorithm for model checking in the alternation free fragment of the modal mucalculus, the first incremental algorithm for model checking of which we are aware. The basis for our algorithm, which we call MCI (for Model Checking Incrementally), is a lineartime algorithm
On the Parallel Complexity of Model Checking in the Modal MuCalculus
 In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science
, 1994
"... The modal mucalculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We show that Model Checking in the Modal MuCalculus (MCMMC)  the problem of checking whether an LTS is a model of a form ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
The modal mucalculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We show that Model Checking in the Modal MuCalculus (MCMMC)  the problem of checking whether an LTS is a model of a
Model checking and the Mucalculus
 DIMACS Series in Discrete Mathematics
, 1997
"... There is a growing recognition of the need to apply formal mathematical methods in the design of "high confidence" computing systems. Such systems operate in safety critical contexts (e.g., air traffic control systems) or where errors could have major adverse economic consequences (e.g., ..."
Abstract

Cited by 47 (0 self)
 Add to MetaCart
attention on a particularly important type of temporal logic known as the Mucalculus.
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 758 (41 self)
 Add to MetaCart
of states. We describe a general method that represents the state space symbolical/y instead of explicitly. The generality of our method comes from using a dialect of the MuCalculus as the primary specification language. We describe a model checking algorithm for MuCalculus formulas that uses Bryantâ€™s
Results 1  10
of
625