Fages, F., P. Ruet and S. Soliman, Phase semantics and verification of concurrent constraint programs, in: Proceedings of the 13th IEEE Colloquium on Logic in Computer Science --- LICS'98.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of ccp, 8] a now then else operator has been introduced which can simulate the operator #. A store in ccp is monotonic. This is not the case in our approach as we allow the deletion of clauses (see e.g. Del) Some variants of ccp with nonmonotonic stores have been proposed, see e.g. [29, 9, 28, 4, 11]. In [9] an operator update x is used to hide the name of a variable. Our Del operator is more precise and allows us to describe for instance the example of philosophers without special requirements on the structure of the constraint system. In fact, the program: phil(x) eat(x) eat(x) ....

...., leftfork) # use(x 3 , rightfork) use(x n , leftfork) # use(x 1 , rightfork) false Note that this condition in combination with the atomic tell (atell) is needed to model the atomic request for two forks. Another di#erent approach to handle non monotonic stores is presented in [29, 4, 11]. This approach is based on linear logic and allows the implicit deletion of information thanks to the semantics of the linear ask. 28] is based on default logic. Thus, if an action is taken based on the absence of information, it is assumed that this information will not be present in the ....

F. Fages, P. Ruet, and S. Soliman. Phase semantics and verification of concurrent constraint programs. In Proc. of the 13 th Annual IEEE Symp. on Logic in Computer Science (LICS '98), 1998. 19

....of the known expspace complete satisfiability in metric interval temporal logic [5] Beyond the real time systems, it would be quite interesting to see how the more general hybrid systems [2, 8] fit into our framework. After the completion of this work, we became aware of the work of Fages et al. [16] on using phase models of linear logic for the verification of concurrent constraint programs. While their approach is model based, it would be interesting to understand common points of their approach and ours and to investigate possible gains of combining them. Acknowledgements: Kanovich and ....

F. Fages, P. Ruet, and S. Soliman. Phase semantics and verification of concurrent constraint programs. In Proc. 13-th Annual IEEE Symposium on Logic in Computer Science, Indianapolis, 1998.

....over reals, and then programming one (of many possible) constraint solvers faithful to the cc ask tell paradigm as an lcc program on top of that constraint system. The rest of the paper is organized as follows. Section 2 gives the necessary background on the lcc framework as developed in [13, 4], and describes the tight correspondance between lcc computations and proofs in linear logic. Section 3 then introduces the constraint system LC designed to serve as a base for (nonmonotonic) constraint computing over reals. Section 4 illustrates the use of LC by expressing a constraint solver ....

....solver that is complete with respect to satisfiability and entailment of linear equations and inequations as a couple of lcc agents, effectively defining a cc(R) language. 2 The lcc Framework We recall below the main features of the linear concurrent constraint framework as defined in [4, 13] 2.1 Syntax Definition 21 (Linear constraint system) A linear constraint system is a pair (C; C ) where: C is a set of formulas of intuitionistic linear logic (ILL) see for example [5] called the linear constraints, built from a set V of variables, a set Sigma of function and relation ....

[Article contains additional citation context not shown here]

F.Fages, P.Ruet, and S.Soliman. Phase semantics and verification of concurrent constraint programs. In LICS, 1998.

..... 22 3.3.1 Frontier calculus . 22 3.3.2 Logical semantics. 23 This paper is an extended version of [7]. The main part of this work was done when the three authors were at CNRS, Ecole Normale Sup erieure, Paris. 1 4 Phase semantics 24 4.1 Phase semantics of intuitionistic linear logic . 24 4.2 Proving safety properties of LCC programs with the phase ....

F. Fages, P. Ruet, and S. Soliman. Phase semantics and verification of concurrent constraint programs. In Proc. 13th Annual IEEE Symposium on Logic in Computer Science, Indianapolis, 1998.

....linear implication consumes its premises to establish the conclusion. This naturally models state change in a logical setting. There have been various proposals to combine CC programming with linear logic (see [SL92] Pal97] We use here the linear concurrent constraint language LCC described in [FRS98a, FRS98b], and used for example in [Sch98] to express global constraint solvers where non monotonic imperative data structures have to be handled. A linear constraint system is a generalization of a classical constraint system, where the constraint language is a fragment of first order linear logic ....

F. Fages, P. Ruet, S. Soliman. Phase semantics and verification of concurrent constraint programs. Logic in Computer Science LICS'98, Indianapolis. 1998.

..... 18 3.3 Must properties . 23 3.3.1 Frontier calculus . 23 3.3.2 Logical semantics. 24 1 This paper is an extended version of [7]. 4 Phase semantics 25 4.1 Phase semantics of intuitionistic linear logic . 25 4.2 Proving safety properties of LCC programs with the phase semantics . 27 4.3 Example 1 Dining philosophers . ....

F. Fages, P. Ruet, and S. Soliman. Phase semantics and verification of concurrent constraint programs. In Proc. 13th Annual IEEE Symposium on Logic in Computer Science, Indianapolis, 1998.

No context found.

Fages, F., P. Ruet and S. Soliman, Phase semantics and verification of concurrent constraint programs, in: Proceedings of the 13th IEEE Colloquium on Logic in Computer Science --- LICS'98.

No context found.

F. Fages, P. Ruet, and S. Soliman. Phase semantics and verification of concurrent constraint programs. In Proceedings of the 13th IEEE Colloquium on Logic in Computer Science --- LICS'98.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC