155 search results - page 17 / 31 » Compositional Predicate Abstraction from Game Semantics |
TFM
2009
Springer
14 years 1 months ago
2009
Springer
action and Modelling - a complementary partnership” 10h30 – 11h 00 Coffee break 11h-12h30 Session 1 “Model Transformation: Foundations” Algebraic models for bidirectional m...
HASKELL
2009
ACM
14 years 1 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
AUSAI
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. We compare Kripke models and hypercube systems, a simpli ed notion of Interpreted Systems, as semantic structures for reasoning about knowledge. Our method is to de ne a ...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
CAI
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...