Sciweavers

7 search results - page 2 / 2
» Varieties Generated by Certain Models of Reversible Finite A...
Sort
View
FOSSACS
2005
Springer
15 years 5 months ago
Model Checking for Nominal Calculi
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto
ESOP
2008
Springer
15 years 2 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong