Sciweavers

756 search results - page 41 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
ICML
2004
IEEE
16 years 7 months ago
Bellman goes relational
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
Kristian Kersting, Martijn Van Otterlo, Luc De Rae...
MODELS
2007
Springer
16 years 7 days ago
Piecewise Modelling with State Subtypes
Abstract. Models addressing both structure and behaviour of a system are usually quite complex. Much of the complexity is caused by the necessity to distinguish between different c...
Friedrich Steimann, Thomas Kühne
AMAST
2004
Springer
15 years 9 months ago
A Language for Configuring Multi-level Specifications
Abstract. This paper shows how systems can be built from their component parts with specified sharing. Its principle contribution is a modular language for configuring systems. A c...
Gillian Hill, Steven Vickers
175
Voted
IPPS
2006
IEEE
16 years 4 days ago
An extensible global address space framework with decoupled task and data abstractions
ions Sriram Krishnamoorthy½ Umit Catalyurek¾ Jarek Nieplocha¿ Atanas Rountev½ P. Sadayappan½ ½ Dept. of Computer Science and Engineering, ¾ Dept. of Biomedical Informatics T...
Sriram Krishnamoorthy, Ümit V. Çataly&...
ESOP
2008
Springer
15 years 7 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