281 search results - page 37 / 57 » A formal framework for compositional compilation |
AGP
1996
IEEE
13 years 12 months ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Recent work has led to the development of an elegant theory of Linearly Solvable Markov Decision Processes (LMDPs) and related Path-Integral Control Problems. Traditionally, LMDPs...
JAIR
2007
13 years 7 months ago
2007
Numerous formalisms and dedicated algorithms have been designed in the last decades to model and solve decision making problems. Some formalisms, such as constraint networks, can ...
SOCO
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The need to use position-dependent parameters often hamdefinition of flexible, extensible, and reusable abstractions for software composition. This observation has led ...
FM
2006
Springer
13 years 11 months ago
2006
Springer
We propose a new look at one of the most fundamental types of behavioral interfaces: discrete time specifications of communication--directly related to the work of de Alfaro and H...