Sciweavers

672 search results - page 82 / 135
» On the Expressive Power of the Loop Language
Sort
View
AI
2005
Springer
15 years 6 months ago
: Compiling problem specifications into SAT
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
Marco Cadoli, Andrea Schaerf
ICFP
2003
ACM
16 years 6 months ago
A sound and complete axiomatization of delimited continuations
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
Yukiyoshi Kameyama, Masahito Hasegawa
JLP
2008
121views more  JLP 2008»
15 years 4 months ago
A process algebraic view of shared dataspace coordination
Coordination languages were introduced in the early 80's as programming notations to manage the interaction among concurrent collaborating software entities. Process algebras...
Nadia Busi, Gianluigi Zavattaro
SIGMOD
2005
ACM
93views Database» more  SIGMOD 2005»
16 years 6 months ago
Supporting Executable Mappings in Model Management
Model management is an approach to simplify the programming of metadata-intensive applications. It offers developers powerful operators, such as Compose, Diff, and Merge, that are...
Sergey Melnik, Philip A. Bernstein, Alon Y. Halevy...
CONCUR
2008
Springer
15 years 8 months ago
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
In this paper, we present a unified approach to evaluating the relative expressive power of process calculi. In particular, we identify a small set of criteria (that have already b...
Daniele Gorla