Sciweavers

AMAST
2006
Springer
13 years 8 months ago
A Compositional Semantics of Plan Revision in Intelligent Agents
This paper revolves around the so-called plan revision rules of the agent programming language 3APL. These rules can be viewed as a generalization of procedures. This generalizatio...
M. Birna van Riemsdijk, John-Jules Ch. Meyer
AMAST
2006
Springer
13 years 8 months ago
The Substitution Vanishes
Abstract. Accumulation techniques were invented to transform functional programs, which intensively use append functions (like inefficient list reversal), into more efficient progr...
Armin Kühnemann, Andreas Maletti
AMAST
2006
Springer
13 years 8 months ago
Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic
This paper proposes a modal extension of Separation Logic [8, 11] for reasoning about data-parallel programs that manipulate heap allocated linked data structures. Separation Logi...
Susumu Nishimura
AMAST
2006
Springer
13 years 8 months ago
Data Movement Optimisation in Point-Free Form
Programs written in point-free form express computation purely in terms of functions. Such programs are especially amenable to local transformation. In this paper, we describe a pr...
Brad Alexander, Andrew L. Wendelborn
AMAST
2006
Springer
13 years 8 months ago
Formal Islands
Abstract. Motivated by the proliferation and usefulness of Domain Specific Languages as well as the demand in enriching well established languages by high level capabilities like p...
Emilie Balland, Claude Kirchner, Pierre-Etienne Mo...
AMAST
2006
Springer
13 years 8 months ago
Hyperfinite Approximations to Labeled Markov Transition Systems
The problem of finding an approximation to a labeled Markov transition system through hyperfinite transition systems is addressed. It is shown that we can find for each countable ...
Ernst-Erich Doberkat
AMAST
2006
Springer
13 years 8 months ago
Fork Algebras as a Sufficiently Rich Universal Institution
Algebraization of computational logics in the theory of fork algebras has been a research topic for a while. This research allowed us to interpret classical first-order logic, seve...
Carlos López Pombo, Marcelo F. Frias
AMAST
2006
Springer
13 years 8 months ago
Testing Semantics: Connecting Processes and Process Logics
We propose a methodology based on testing as a framework to capture the interactions of a machine represented in a denotational model and the data it manipulates. Using a duality t...
Dusko Pavlovic, Michael W. Mislove, James Worrell