Results 1  10
of
18
Foundations of Timed Concurrent Constraint Programming
 Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science
, 1994
"... 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 process algebras, we develop some combinators expressible in this model, and reconcile their operational, logical and denota ..."
Abstract

Cited by 87 (10 self)
 Add to MetaCart
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 process algebras, we develop some combinators expressible in this model, and reconcile their operational, logical and denotational character. We show how programs may be compiled into finitestate machines with loopfree computations at each state, thus guaranteeing bounded response time. 1 Introduction and Motivation Reactive systems [12,3,9] are those that react continuously with their environment at a rate controlled by the environment. Execution in a reactive system proceeds in bursts of activity. In each phase, the environment stimulates the system with an input, obtains a response in bounded time, and may then be inactive (with respect to the system) for an arbitrary period of time before initiating the next burst. Examples of reactive systems are controllers and signalprocessing systems. The primary issu...
Proving Concurrent Constraint Programs Correct
, 1994
"... We develop a compositional proofsystem for the partial correctness of concurrent constraint programs. Soundness and (relative) completeness of the system are proved with respect to a denotational semantics based on the notion of strongest postcondition. The strongest postcondition semantics provide ..."
Abstract

Cited by 58 (13 self)
 Add to MetaCart
We develop a compositional proofsystem for the partial correctness of concurrent constraint programs. Soundness and (relative) completeness of the system are proved with respect to a denotational semantics based on the notion of strongest postcondition. The strongest postcondition semantics provides a justification of the declarative nature of concurrent constraint programs, since it allows to view programs as theories in the specification logic. 1 Introduction Concurrent constraint programming ([24, 25, 26]) (ccp, for short) is a concurrent programming paradigm which derives from replacing the storeasvaluation conception of von Neumann computing by the storeas constraint model. Its computational model is based on a global store, represented by a constraint, which expresses some partial information on the values of the variables involved in the computation. The concurrent execution of different processes, which interact through the common store, refines the partial information of...
Generalized Semantics and Abstract Interpretation for Constraint Logic Programs
, 1995
"... We present a simple and powerful generalized algebraic semantics for constraint logic programs that is parameterized with respect to the underlying constraint system. The idea is to abstract away from standard semantic objects by focusing on the general properties of any possibly nonstandard ..."
Abstract

Cited by 38 (5 self)
 Add to MetaCart
We present a simple and powerful generalized algebraic semantics for constraint logic programs that is parameterized with respect to the underlying constraint system. The idea is to abstract away from standard semantic objects by focusing on the general properties of any possibly nonstandard  semantic definition. In constraint logic programming, this corresponds to a suitable definition of the constraint system supporting the semantic definition. An algebraic structure is introduced to formalize the notion of a constraint system, thus making classical mathematical results applicable. Both topdown and bottomup semantics are considered. Nonstandard semantics for constraint logic programs can then be formally specified using the same techniques used to define standard semantics. Different nonstandard semantics for constraint logic languages can be specified in this ...
On the Expressive Power of Concurrent Constraint Programming Languages
 IN PPDP 2002
, 2002
"... The tcc paradigm is a formalism for timed concurrent constraint programming. Several tcc languages di#ering in their way of expressing infinite behavior have been proposed in the literature. In this paper ..."
Abstract

Cited by 15 (15 self)
 Add to MetaCart
The tcc paradigm is a formalism for timed concurrent constraint programming. Several tcc languages di#ering in their way of expressing infinite behavior have been proposed in the literature. In this paper
Testing concurrent systems: An interpretation of intuitionistic logic
"... Abstract. We present the natural confluence of higherorder hereditary Harrop formulas (HH formulas) as developed concretely in λProlog, Constraint Logic Programming (CLP, [JL87]), and Concurrent Constraint Programming (CCP, [Sar93]) as a fragment of (intuitionistic, higherorder) logic. The combina ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Abstract. We present the natural confluence of higherorder hereditary Harrop formulas (HH formulas) as developed concretely in λProlog, Constraint Logic Programming (CLP, [JL87]), and Concurrent Constraint Programming (CCP, [Sar93]) as a fragment of (intuitionistic, higherorder) logic. The combination is motivated by the need for a simple executable, logical presentation for static and dynamic semantics of modern programming languages. The power of HH formulas is needed for higherorder abstract syntax, and the power of constraints is needed to naturally abstract the underlying domain of computation. Underpinning this combination is a sound and complete operational interpretation of a twosided sequent presentation of (a large fragment of) intuitionistic logic in terms of behavioral testing of concurrent systems. Formulas on the left hand side of a sequent style presentation are viewed as a system of concurrent agents, and formulas on the right hand side as tests against this evolving system. The language permits recursive definitions of agents and tests, allows tests to augment the system being tested and allows agents to be contingent on the success of a test. We present a condition on proofs, operational derivability (OD), and show that the operational semantics generates only operationally derivable proofs. We show that a sequent in this logic has a proof iff it has an operationally derivable proof. 1
On the Expressive Power of Temporal Concurrent Constraint Programming Languages
 In Proceedings of the 4th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming
, 2002
"... The tcc paradigm is a formalism for timed concurrent constraint programming. Several tcc languages differing in their way of expressing infinite behavior have been proposed in the literature. In this paper we study the expressive power of some of these languages. In particular, we show that (1) recu ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
The tcc paradigm is a formalism for timed concurrent constraint programming. Several tcc languages differing in their way of expressing infinite behavior have been proposed in the literature. In this paper we study the expressive power of some of these languages. In particular, we show that (1) recursion using procedures with parameters is behaviorally equivalent to parameterless procedures with dynamic scoping, that (2) replication is behaviorally equivalent to parameterless procedures with static scoping, and that (3) the languages from (1) are strictly more expressive than the languages from (2). Furthermore, we show that behavioral equivalence is undecidable for the languages from (1), but decidable for the languages from (2). Both undecidability results hold even if the process variables take values from a fixed finite domain.
Concurrent Constraint Programming and NonCommutative Linear Logic (Extended Abstract)
, 1996
"... This paper presents a precise connection between a noncommutative version of intuitionistic linear logic (INLL) and concurrent constraint programming (cc). The contribution of this paper is twofold: ffl on the one hand, we refine existing logical characterizations of operational aspects of concu ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
This paper presents a precise connection between a noncommutative version of intuitionistic linear logic (INLL) and concurrent constraint programming (cc). The contribution of this paper is twofold: ffl on the one hand, we refine existing logical characterizations of operational aspects of concurrent constraint programming, by providing a logical interpretation of finer observable properties of cc programs, namely successes and suspensions. ffl on the other ha...
On the expressiveness of linearity vs persistence in the asychronous picalculus
 In Proc. of LICS’06. IEEE Computer Society
, 2006
"... We present an expressiveness study of linearity and persistence of processes. We choose the πcalculus, one of the main representatives of process calculi, as a framework to conduct our study. We consider four fragments of the πcalculus. Each one singles out a natural source of linearity/persistenc ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We present an expressiveness study of linearity and persistence of processes. We choose the πcalculus, one of the main representatives of process calculi, as a framework to conduct our study. We consider four fragments of the πcalculus. Each one singles out a natural source of linearity/persistence also present in other frameworks such as Concurrent Constraint Programming (CCP), Linear CCP, and several calculi for security. The study is presented by providing (or proving the nonexistence of) encodings among the fragments, a processesasformulae interpretation and a reduction from Minsky machines. 1
Deriving Labels and Bisimilarity for Concurrent Constraint Programming
, 2010
"... Abstract. Concurrent constraint programming (ccp) is a wellestablished model for concurrency that builds upon operational and algebraic notions from process calculi and firstorder logic. Bisimilarity is one of the central reasoning techniques in concurrency. The standard definition of bisimilarity ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract. Concurrent constraint programming (ccp) is a wellestablished model for concurrency that builds upon operational and algebraic notions from process calculi and firstorder logic. Bisimilarity is one of the central reasoning techniques in concurrency. The standard definition of bisimilarity, however, is not completely satisfactory for ccp since it yields an equivalence that is too fine grained. By building upon recent foundational investigations, we introduce a labelled w.r.t. the typical observational equivalence in ccp. This way we provide ccp with a new proof technique for ccp coherent with existing ones.
Reactive Constraint Programming
"... The tcc model is a concurrent constraint programming formalism for timed, reactive and deterministic computation. A remarkable feature of the tcc model is that programs and specifications are given in the same language. In this report we develop an extension of tcc that allows the specification o ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The tcc model is a concurrent constraint programming formalism for timed, reactive and deterministic computation. A remarkable feature of the tcc model is that programs and specifications are given in the same language. In this report we develop an extension of tcc that allows the specification of nondeterministic computation. We call this extension the ntcc model. The ntcc model is based upon ideas from both concurrent constraint programming and CCSlike models. The expressiveness of ntcc is illustrated by showing derived constructs such as parameterless recursion, cells and valuebroadcasting processes, and by specifying temporal requirements such as eventuality, timebounded response and timebounded invariance. We claim the applicability of ntcc by modeling reactive system examples of RCX controllers. We present ongoing work on a denotational semantics and a proof system for the model. In the spirit of Process Algebra, we also define a behavioral equivalence for the ntcc model based upon the notion of (weak) bisimulation.