R. Pugliese. Semantic Theories for Asynchronous Languages. Ph.D. Thesis VIII-96-6, Univ. di Roma "La Sapienza", Dip. Scienze dell'Informazione, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

No context found.

R. Pugliese. Semantic Theories for Asynchronous Languages. Ph.D. Thesis VIII-96-6, Univ. di Roma "La Sapienza", Dip. Scienze dell'Informazione, 1996.

....in Table 10, is introduced. Hereafter, we use for denoting localities, locality variables and sites and assume that allocation environments are extended to sites; over them they act as the identity function. For further explanations and comments we refer the interested reader to [18] Like in [19, 33], we model tuples as processes. To this aim, we extend KLAIM syntax with processes of the form out(et) for denoting evaluated tuples (referred to as et) The evaluation function for tuples, T = # , makes use of an allocation environment for resolving locality names and relies on an evaluation ....

R. Pugliese, Semantic theories for asynchronous languages, Ph.D. Thesis VIII-96-6, Univ. di Roma "La Sapienza", Dip. Scienze dell'Informazione, 1996.

....in Table 10, is introduced. Hereafter, we use for denoting localities, locality variables and sites and assume that allocation environments are extended to sites; over them they act as the identity function. For further explanations and comments we refer the interested reader to [18] Like in [19, 33], we model tuples as processes. To this aim, we extend Klaim syntax with processes of the form out(et) for denoting evaluated tuples (referred to as et) The evaluation function for tuples, T [ ae , makes use of an allocation environment for resolving locality names and relies on an ....

R. Pugliese. Semantic Theories for Asynchronous Languages. Ph.D. Thesis VIII-96-6, Univ. di Roma "La Sapienza", Dip. Scienze dell'Informazione, 1996.

....in order to avoid providing PAL with a counterintuitive and unsatisfactory semantics that models recursive terms differently from their unfoldings. The use of action prefixing instead of full sequential composition has also been essential for reusing the semantical machinery introduced in [22, 43] for PAL. Had we chosen to use sequential composition, terms would inherit stores and the equivalences would not be congruences. The development of a similar framework to deal with full sequential program composition rather than with action prefixing is under progress. In [21] we have already ....

R. Pugliese. Semantic Theories for Asynchronous Languages. Ph.D. Thesis, University of Rome "La Sapienza", Dipartimento di Scienze dell'Informazione, 1996.

....defined over the syntax of tuples by the rules in Table 4, where we use E [ e ] to denote the value of the closed expression e; the evaluation of a process, say T [ P ] ae, yields a process closure, i.e. Pfaeg. The rules defining the pattern matching predicate are reported in Table 5. As in [18, 37], we model tuples as processes and we introduce auxiliary processes to denote evaluated tuples, referred to as et. Thus Klaim syntax is extended with the process out(et) whose symbolic semantics is expressed by the following structural rule out(et) o(et) self Gamma Gamma Gamma Gamma Gamma ....

....be equipped with cryptographic primitives as done in spi calculus [1] We plan to develop observational semantics as a foundation for programming logics and verification techniques. To this end, our starting point will be the testing framework developed for a process calculus based on Linda in [18, 37]. We are currently exploring the possibility of allowing nets to communicate and move processes and tuples between them. The current Klava implementation appears to be well suited also to program this feature, that will lead to providing Klaim and Klava with hierarchical nets. Klaim has been ....

R. Pugliese. Semantic Theories for Asynchronous Languages. Ph.D. Thesis VIII-96-6, Univ. di Roma "La Sapienza", Dip. Scienze dell'Informazione, 1996.

....in Table 10, is introduced. Hereafter, we use for denoting localities, locality variables and sites and assume that allocation environments are extended to sites; over them they act as the identity function. For further explanations and comments we refer the interested reader to [21] Like in [22, 36], we model tuples as processes. To this aim, we extend Klaim syntax with processes of the form out(et) for denoting evaluated tuples (referred to as et) The evaluation function for tuples, T [ ae , makes use of an allocation environment for resolving locality names and relies on an ....

R. Pugliese. Semantic Theories for Asynchronous Languages. Ph.D. Thesis VIII-96-6, Univ. di Roma "La Sapienza", Dip. Scienze dell'Informazione, 1996.

....Here, we use a simpler operational modelling and show that a single additional law is sufficient for the complete equational characterization of IPAL. The use of action prefixing instead of full sequential composition has also been essential for reusing the semantical machinery introduced in [24, 45] for PAL. Indeed, since the effects of the executions of terms based on their private stores are local and not visible to any external observer, equivalent processes may have different stores. Had we chosen to use sequential composition, terms could inherit stores and the equivalences could not be ....

R. Pugliese. Semantic Theories for Asynchronous Languages. Ph.D. Thesis, University of Rome "La Sapienza", Dipartimento di Scienze dell'Informazione, 1996.

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