Castellani, I. and M. Hennessy (1998). Testing theories for asynchronous languages. Lecture Notes in Computer Science 1530, 90-101.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....the synchronous calculus in the asynchronous calculus is sound. Other work on may testing equivalence involves finding alternative (usually trace based) interpretations of equivalence. Examples of such work include papers by de Nicola and Hennessy (1983) Boreale, De Nicola, and Pugliese (1999) Castellani and Hennessy (1998) and Laneve (1996) 136 Chapter 8 Conclusions 8.1 Summary In this thesis, we presented various operational techniques for studying programming languages. In particular, we defined a compiler and abstract machine for a sequential imperative object calculus, produced a concurrent object calculus ....

Castellani, I. and M. Hennessy (1998). Testing theories for asynchronous languages. Lecture Notes in Computer Science 1530, 90--101.

....control policy. We also give a precise statement of our non interference result, and give counter examples to related conjectures based on equivalences other than may testing. The proof of our main theorem depends on an analysis of may testing in terms of asynchronous sequences of actions [6] which in turn depends on a more explicit operational semantics for our language, where actions are paramterised relative to a typing environment. The details may be found in the full version of the paper, 16] Fig. 1 Syntax P; Q : Terms u hvi Output u (X : A)P Input if u = v then P else Q ....

Ilaria Castellani and Matthew Hennessy. Testing theories for asynchronous languages. In V Arvind and R Ramanujam, editors, 18th Conference on Foundations of Software Technology and Theoretical Computer Science (Chennai, India, December 17--19, 1998), LNCS 1530. Springer-Verlag, December 1998.

....but infinitary is put forward. Asynchronous variants of CCS came later, essentially as means for studying Linda communication primitives in a simple, process algebraic setting [34, 15, 12] In the realm of ACCS calculus, the only other work on testing semantics we are aware of is the recent [13], by Castellani and Hennessy. There, the authors present a complete axiomatization of the must testing preorder for ACCS. Differently from ours, their alternative characterization of the must preorder relies on an infinitary operational semantics similar to the one in [24] The problem of ....

I. Castellani, M. Hennesy. Testing Theories for Asynchronous Languages. Proc. of FSTTCS, LNCS 1530 (V. Arvind, R. Ramanujam, Eds.), pp.90-101, Springer, 1998.

....the only paper that presents an axiomatization is [1] There, a complete axiomatization of strong bisimilarity for asynchronous calculus is proposed, but the problem of axiomatizing weak ( forgetful) variants of the equivalence is left open. A paper closely related to ours is the recent [10]. There, for a variant of asynchronous CCS, the authors present a complete axiomatization of must testing semantics, which is more appropriate for reasoning on liveness properties. No finitary model is presented and the problem of extending the results to the asynchronous calculus is left open. ....

I. Castellani, M. Hennesy. Testing Theories for Asynchronous Languages. Proc. FSTTCS, LNCS , to appear Dec. 1998.

No context found.

Ilaria Castellani and Matthew Hennessy. Testing theories for asynchronous languages. In V Arvind and R Ramanujam, editors, 18th Conference on Foundations of Software Technology and Theoretical Computer Science (Chennai, India, December 17-19, 1998.

....control policy. We also give a precise statement of our non interference result, and give counter examples to related conjectures based on equivalences other than may testing. The proof of our main theorem depends on an analysis of may testing in terms of asynchronous sequences of actions [5] which in turn depends on detailed operational semantics for our language, where actions are paramterised relative to a typing environment. The details may be found in the full version of the paper, 15] Fig. 1 Syntax P; Q : Terms u hvi Output u (X : A)P Input if u = v then P else Q ....

Ilaria Castellani and Matthew Hennessy. Testing theories for asynchronous languages. In V Arvind and R Ramanujam, editors, 18th Conference on Foundations of Software Technology and Theoretical Computer Science (Chennai, India, December 17-19, 1998), LNCS 1530. Springer-Verlag, December 1998.

No context found.

Castellani, I. and M. Hennessy (1998). Testing theories for asynchronous languages. Lecture Notes in Computer Science 1530, 90-101.

No context found.

I. Castellani and M. Hennessy. Testing theories for asynchronous languages. In V. Arvind and R. Ramanujam, editors, Proceedings of FSTTCS '98, volume 1530 of LNCS, pages 90--101. Springer, Dec. 1998.

No context found.

I. Castellani, M. Hennesy. Testing Theories for Asynchronous Languages. Proc. of FSTTCS, LNCS 1530 (V. Arvind, R. Ramanujam, Eds.), pp.90-101, Springer, 1998.

No context found.

I. Castellani and M. Hennessy. Testing theories for asynchronous languages. In Proc. FST-TCS'98, volume 1530 of Lecture Notes in Computer Science. Springer Verlag, 1998.

No context found.

Ilaria Castellani and Matthew Hennessy. Testing theories for asynchronous languages. In V Arvind and R Ramanujam, editors, 18th Conference on Foundations of Software Technology and Theoretical Computer Science (Chennai, India, December 17-19, 1998.

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