56 search results - page 1 / 12 » The Complexity of Model Checking Higher Order Fixpoint Logic |
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
LMCS
2007
13 years 4 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
FSTTCS
2010
Springer
13 years 1 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We introduce model-checking games that allow local secondorder power on sets of independent transitions in the underlying partial order models where the games are played....
ITA
2007
13 years 4 months ago
2007
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...