Efficient CTL model-checking for pushdown systems
From MaRDI portal
Publication:402129
Recommendations
- Efficient CTL model-checking for pushdown systems
- scientific article; zbMATH DE number 2080197
- scientific article; zbMATH DE number 1670780
- Model-Checking HyperLTL for Pushdown Systems
- Improving Pushdown System Model Checking
- Model-checking \(\mathrm{CTL}^*\) over flat Presburger counter systems
- Model-checking bounded multi-pushdown systems
Cites work
- scientific article; zbMATH DE number 1670767 (Why is no real title available?)
- scientific article; zbMATH DE number 1670780 (Why is no real title available?)
- scientific article; zbMATH DE number 1980931 (Why is no real title available?)
- scientific article; zbMATH DE number 2080197 (Why is no real title available?)
- scientific article; zbMATH DE number 1796143 (Why is no real title available?)
- scientific article; zbMATH DE number 2086664 (Why is no real title available?)
- scientific article; zbMATH DE number 794257 (Why is no real title available?)
- scientific article; zbMATH DE number 2242594 (Why is no real title available?)
- A lattice-theoretical fixpoint theorem and its applications
- A saturation method for the modal \(\mu \)-calculus over pushdown systems
- An automata-theoretic approach to infinite-state systems
- Complexity results on branching-time pushdown model checking
- Computer Aided Verification
- Deciding emptiness for stack automata on infinite trees
- Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains
- Model checking LTL with regular valuations for pushdown systems
- Model checking the full modal mu-calculus for infinite sequential processes
- Note on winning positions on pushdown games with \(\omega\)-regular conditions
- Pushdown Module Checking
- Pushdown module checking
- Reachability analysis of pushdown automata: Application to model-checking
- Uniform solution of parity games on prefix-recognizable graphs
Cited in
(22)- Branching Temporal Logic of Calls and Returns for Pushdown Systems
- Model checking LTL with regular valuations for pushdown systems
- scientific article; zbMATH DE number 1980931 (Why is no real title available?)
- scientific article; zbMATH DE number 1670780 (Why is no real title available?)
- An extension of pushdown system and its model checking method.
- Practical CTL* model checking: Should SPIN be extended?
- Not all bugs are created equal, but robust reachability can tell the difference
- Improving Pushdown System Model Checking
- Model checking dynamic pushdown networks
- Model checking dynamic pushdown networks
- Bounded model checking of recursive programs with pointers in K
- A Branching Time Variant of CaRet
- Efficient CTL model-checking for pushdown systems
- On the analysis of interacting pushdown systems
- scientific article; zbMATH DE number 2080052 (Why is no real title available?)
- scientific article; zbMATH DE number 2080197 (Why is no real title available?)
- Pushdown model checking for malware detection
- Model-Checking HyperLTL for Pushdown Systems
- Introducing robust reachability
- Analyzing pushdown systems with stack manipulation
- scientific article; zbMATH DE number 2242594 (Why is no real title available?)
- LTL model-checking for malware detection
This page was built for publication: Efficient CTL model-checking for pushdown systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402129)
