71 search results - page 14 / 15 » A Calculus for Team Automata |
CHARME
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
FOSSACS
2005
Springer
13 years 11 months ago
2005
Springer
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 ...
ESOP
2008
Springer
13 years 7 months ago
2008
Springer
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...
ICFP
2005
ACM
14 years 5 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
RTAS
2009
IEEE
14 years 14 days ago
2009
IEEE
Over the last few years, Real-Time Calculus has been used extensively to model and analyze embedded systems processing continuous data/event streams. Towards this, bounds on the a...