Model checking fixed point logic with chop

DOI10.1007/3-540-45931-6_18MaRDI QIDQ4738230zbMATH OpenFDO

Authors Martin Lange, Colin Stirling

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2303/23030250.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Local model checking games for fixed point logic with chop
• Three notes on the complexity of model checking fixpoint logic with chop
• A modal fixpoint logic with chop
• Parallel and symbolic model checking for fixpoint logic with chop
• On model checking for the -calculus and its fragments

Cited in

(14)

• On hierarchically developing reactive systems
• The alternation hierarchy in fixpoint logic with chop is strict too
• Alternating context-free languages and linear time -calculus with sequential composition
• Parallel and symbolic model checking for fixpoint logic with chop
• Compositional properties of sequential processes
• Non-regular fixed-point logics and games
• A modal fixpoint logic with chop
• Local model checking games for fixed point logic with chop
• Computer Aided Verification
• Theoretical Aspects of Computing – ICTAC 2005
• Three notes on the complexity of model checking fixpoint logic with chop
• Model checking timed recursive CTL
• A sequent calculus for trace formula implication
• Propositional dynamic logic of context-free programs and fixpoint logic with chop

This page was built for publication: Model checking fixed point logic with chop

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4738230)