Sciweavers

LMCS
2007
132views more  LMCS 2007»
13 years 11 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
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...
Roland Axelsson, Martin Lange, Rafal Somla
LMCS
2007
61views more  LMCS 2007»
13 years 11 months ago
Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem
Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Ben...