Abstract
Recent trends in formal models of web services description languages and session types focus on the asynchronicity of communications. In this paper, we study a core of these models that arose from our modelling of the Sing# programming language, and demonstrate correspondences between Sing# contracts, asynchronous session behaviors, and the subclass of communicating automata with two participants that satisfy the half-duplex property. This correspondence better explains the criteria proposed by Stengel and Bultan for Sing# contracts to be reliable, and possibly indicate useful criteria for the design of WSDL. We moreover establish a polynomial-time complexity for the analysis of communication contracts under arbitrary models of asynchronicity, and we investigate the model-checking problems against LTL formulas.
The European Research Council has provided financial support under the European Community’s Seventh Framework Programme (FP7/2007-2013) / ERC grant agreement no 259267.The second author acknowledges support from EPSRC.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Inf. Comput. (1996)
Alur, R., Etessami, K., Yannakakis, M.: Inference of message sequence charts. In: Software Concepts and Tools (2003)
Barbanera, F., de’Liguoro, U.: Two notions of sub-behaviour for session-based client/server systems. In: PPDP (2010)
Basu, S., Bultan, T.: Choreography conformance via synchronizability. In: WWW (2011)
Bono, V., Messa, C., Padovani, L.: Typing Copyless Message Passing. In: Barthe, G. (ed.) ESOP 2011. LNCS, vol. 6602, pp. 57–76. Springer, Heidelberg (2011)
Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular Model Checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 403–418. Springer, Heidelberg (2000)
Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM (1983)
Bravetti, M., Zavattaro, G.: Contract Compliance and Choreography Conformance in the Presence of Message Queues. In: Bruni, R., Wolf, K. (eds.) WS-FM 2008. LNCS, vol. 5387, pp. 37–54. Springer, Heidelberg (2009)
Cécé, G., Finkel, A.: Verification of programs with half-duplex communication. Inf. Comput. (2005)
Cécé, G., Finkel, A., Purushothaman Iyer, S.: Unreliable channels are easier to verify than perfect channels. Inf. Comput (January 1996)
Esparza, J.: Decidability and complexity of Petri net problems - an introduction. In: Petri Nets (1996)
Fähndrich, M., Aiken, M., Hawblitzel, C., Hodson, O., Hunt, G.C., Larus, J.R., Levi, S.: Language support for fast and reliable message-based communication in Singularity OS. In: EuroSys (2006)
Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci. (April 2001)
Gay, S.J., Vasconcelos, V.T.: Linear type theory for asynchronous session types. J. Funct. Program (2010)
Gouda, M.G., Manning, E.G., Yu, Y.-T.: On the progress of communications between two finite state machines. Information and Control (1984)
Honda, K., Vasconcelos, V.T., Kubo, M.: Language Primitives and Type Discipline for Structured Communication-Based Programming. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol. 1381, pp. 122–138. Springer, Heidelberg (1998)
Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. In: POPL (2008)
Mayr, R.: Undecidable problems in unreliable computations. Theor. Comput. Sci. (2003)
Padovani, L.: Fair Subtyping for Multi-party Session Types. In: De Meuter, W., Roman, G.-C. (eds.) COORDINATION 2011. LNCS, vol. 6721, pp. 127–141. Springer, Heidelberg (2011)
Schnoebelen, P.: Lossy Counter Machines Decidability Cheat Sheet. In: Kučera, A., Potapov, I. (eds.) RP 2010. LNCS, vol. 6227, pp. 51–75. Springer, Heidelberg (2010)
Stengel, Z., Bultan, T.: Analyzing singularity channel contracts. In: ISSTA (2009)
Takeuchi, K., Honda, K., Kubo, M.: An Interaction-based Language and Its Typing System. In: Halatsis, C., Philokyprou, G., Maritsas, D., Theodoridis, S. (eds.) PARLE 1994. LNCS, vol. 817, pp. 398–413. Springer, Heidelberg (1994)
Villard, J.: Heaps and Hops. PhD Thesis, LSV, ENS Cachan (February 2011)
Villard, J., Lozes, É., Calcagno, C.: Proving Copyless Message Passing. In: Hu, Z. (ed.) APLAS 2009. LNCS, vol. 5904, pp. 194–209. Springer, Heidelberg (2009)
Wolper, P., Boigelot, B.: Verifying Systems with Infinite but Regular State Spaces. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol. 1427, pp. 88–97. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lozes, É., Villard, J. (2012). Reliable Contracts for Unreliable Half-Duplex Communications. In: Carbone, M., Petit, JM. (eds) Web Services and Formal Methods. WS-FM 2011. Lecture Notes in Computer Science, vol 7176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29834-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-29834-9_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29833-2
Online ISBN: 978-3-642-29834-9
eBook Packages: Computer ScienceComputer Science (R0)