Sciweavers

170 search results - page 19 / 34
» Bisimilarity in Concurrent Constraint Programming
Sort
View
POPL
2009
ACM
15 years 10 months ago
Relaxed memory models: an operational approach
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
Gérard Boudol, Gustavo Petri
76
Voted
RISE
2004
Springer
15 years 2 months ago
A Symbolic Model Checker for tccp Programs
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
María Alpuente, Moreno Falaschi, Alicia Vil...
RTAS
2009
IEEE
15 years 4 months ago
Execution Strategies for PTIDES, a Programming Model for Distributed Embedded Systems
—We define a family of execution policies for a programming model called PTIDES (Programming Temporally Integrated Distributed Embedded Systems). A PTIDES application (factory a...
Jia Zou, Slobodan Matic, Edward A. Lee, Thomas Hui...
ESOP
2009
Springer
15 years 4 months ago
Conversation Types
We present a type theory for analyzing concurrent multiparty interactions as found in service-oriented computing. Our theory introduces a novel and flexible type structure, able t...
Luís Caires, Hugo Torres Vieira
ASAP
1997
IEEE
144views Hardware» more  ASAP 1997»
15 years 1 months ago
Automatic data mapping of signal processing applications
This paper presents a technique to map automatically a complete digital signal processing (DSP) application onto a parallel machine with distributed memory. Unlike other applicati...
Corinne Ancourt, Denis Barthou, Christophe Guettie...