U. Nestmann. On Determinacy and Nondeterminacy in Concurrent Programming. PhD thesis, Universitat Erlangen, November 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

No context found.

U. Nestmann. On Determinacy and Nondeterminacy in Concurrent Programming. PhD thesis, Universitat Erlangen, November 1996.

....simply defined away (by using administrative normal forms) since, in general, they are not confluent: imagine a process containing two choices that compete for a single message; both choices could evolve by consuming the message, but each would pre empt the other. In the first author s PhD thesis [Nes96], the discussion of appropriate notions of correctness as well as a discussion of possible (correct) and impossible (incorrect) variants of the proposed choice encodings are carried out in considerably more detail. 5 Correctness proof by decoding In this section, we prove the correctness of ....

U. Nestmann. On Determinacy and Nondeterminacy in Concurrent Programming. PhD thesis, Technische Fakultat, Universitat Erlangen, November 1996. Arbeitsbericht IMMD29 (14).

....of y [x] if x then P else Q with the usual meaning of if, which is only defined, if the name received for x is a boolean. For T with booleans, we require for the grammar above that y N, while x, z V : N# B. Note that booleans can be cleanly encoded into the intended target language T (cf. [Nes96]) As Milner [Mil93] we assume that all processes are well typed according to the correct use of polyadic channels, i.e. matching senders and receivers always have the same expectation about the arity or the boolean type of transmitted values. This also prevents us from restriction on, ....

U. Nestmann. On Determinacy and Nondeterminacy in Concurrent Programming. PhD thesis, Technische Fakultat, Universitat Erlangen, November 1996. Arbeitsbericht IMMD-29(14).

....of y [x] if x then P else Q with the usual meaning of if , which is only defined, if the name received for x is a boolean. For T with booleans, we require x; y 2 N, while z 2 V : N [ B . Note that the boolean primitives can be cleanly encoded into the intended target language T (cf. [Nes96]) S : Delta Delta Delta y [ x] P ) j (y [ z] Q Delta Delta Delta) Gamma Pf = x g j Q : Delta Delta Delta y [ x] P ) j y [ z] Gamma Pf ; T : y [ x] P j y [ z] Gamma Pf = x g j y T : if z N then y [ x] P j y [ z] Gamma Pf T : test y then ....

U. Nestmann. On Determinacy and Nondeterminacy in Concurrent Programming. PhD thesis, Universitat Erlangen, November 1996. Arbeitsbericht IMMD-29(14).

....simply defined away (by using administrative normal forms) since, in general, they are not confluent: imagine a process containing two choices that compete for a single message; both choices could evolve by consuming the message, but each would pre empt the other. In the first author s PhD thesis [Nes96], the discussion of appropriate notions of correctness as well as a discussion of possible (correct) and impossible (incorrect) variants of the proposed choice encodings are carried out in considerably more detail. 5 Correctness proof by decoding In this section, we prove the correctness of the ....

U. Nestmann. On Determinacy and Nondeterminacy in Concurrent Programming. PhD thesis, Universitat Erlangen, November 1996. Arbeitsbericht IMMD-29(14).

....taking advantage of a subject reduction property, yields a sufficient criterion for guaranteeing confluence. This work was started while both authors were staying at the Universitat Erlangen Nurnberg, Germany. The main results and proofs have appeared previously in the first authors PhD thesis [Nes96]. y Corresponding author: INRIA Rocquencourt, Projet PARA, Domaine de Voluceau, Rocquencourt, B.P. 105, F 78153 Le Chesnay Cedex (France) Email: Uwe.Nestmann INRIA.fr z Supported by an ERCIM fellowship and a grant of the DAAD program HSPII AUFE. x Supported by the DFG, ....

....9, We check that only a cases for the decomposition of the span (cf Fact 8) are allowed by Delta fl P . Theorem 24 ( Confluence) Let Delta fl P . Then P is confluent. Proof. By Proposition 23, the diamond property (Lemma 11) and labeled subject reduction (Lemma 20) for closed processes. In [Nes96], we have also studied typing systems for a merely signal passing setting like choicefree CCS (typing rules are much simpler, since no names are passed around) and proved that both Milner s weak confluence and Groote Sellink s strong confluence hold. 7 Related typing approaches The polarized ....

U. Nestmann. On Determinacy and Nondeterminacy in Concurrent Programming. PhD thesis, Technische Fakultat, Universitat Erlangen, 1996. Arbeitsbericht 29(14) des IMMD.

No context found.

Uwe Nestmann. On Determinacy and Nondeterminacy in Concurrent Programming. PhD thesis, Technische Fakultat, Universitat Erlangen, November 1996. Arbeitsbericht IMMD-29(14).

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