8099 search results - page 6 / 1620 » Higher-Order Task Models |
CAV
2009
Springer
14 years 10 months ago
2009
Springer
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
FOSSACS
2009
Springer
14 years 4 months ago
2009
Springer
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...
CHES
2007
Springer
14 years 3 months ago
2007
Springer
LICS
2006
IEEE
14 years 3 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
FSTTCS
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. Synchronous languages are well suited for the design of dependable real-time systems: they enable a very high-level specification and an extremely modular implementation ...