48 search results - page 2 / 10 » Temporal Concurrent Constraint Programming: Denotation, Logi... |
126
Voted
LICS
1994
IEEE
15 years 5 months ago
1994
IEEE
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
143
Voted
ESOP
1999
Springer
15 years 5 months ago
1999
Springer
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...
106
click to vote
POPL
1995
ACM
15 years 4 months ago
1995
ACM
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
119
Voted
ICLP
2003
Springer
15 years 6 months ago
2003
Springer
Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in...
107
Voted
LPAR
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. The ZETA system is a Z-based tool environment for developing formal specifications. It contains a component for executing the Z language based on the implementation techn...