Sciweavers

4 search results - page 1 / 1
» A Saturation Method for the Modal Mu-Calculus with Backwards...
Sort
View
CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 5 months ago
A Saturation Method for the Modal Mu-Calculus with Backwards Modalities over Pushdown Systems
We present an algorithm for computing directly the denotation of a modal
Matthew Hague, C.-H. Luke Ong
SPIN
2010
Springer
13 years 3 months ago
Analysing Mu-Calculus Properties of Pushdown Systems
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown par...
Matthew Hague, C.-H. Luke Ong
FOSSACS
2009
Springer
13 years 12 months ago
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
Christopher Broadbent, C.-H. Luke Ong
CADE
2007
Springer
14 years 5 months ago
Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4
We present a multi-context focused sequent calculus whose derivations are in bijective correspondence with normal natural deductions in the propositional fragment of the intuitioni...
Samuli Heilala, Brigitte Pientka