Abstract
Distributed and mobile systems are typically composed of heterogeneous computational units that interact with each other following a predefined protocol. Process algebras and modal logics have been largely used as tools for specifying and verifying such kind of systems. However, to use these tools a complete system description has to be provided. This is not always possible. Indeed, even if the protocol governing the interactions among the system components is completely specified, the precise implementation of each component, as well as the number of network elements, is generally unknown. In this paper we present a set of formal tools that permits specifying systems by means of mixed specifications: a system is not considered in isolation, but under the assumption that the enclosing environment satisfies a given set of properties. A model-checking algorithm is also defined to verify whether considered specifications satisfy or not the expected properties. In the former case, it is also guaranteed that whenever the context is instantiated with components satisfying the assumptions, property satisfaction is preserved.
This work has been partially supported by the EU project ASCENS 257414.
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
Abadi, M., Plotkin, G.D.: A logical view of composition. Theoretical Computer Science 114(1), 3–30 (1993)
Antonik, A., Huth, M., Larsen, K.G., Nyman, U., Wasowski, A.: 20 years of modal and mixed specifications. Bulletin of the EATCS 95, 94–129 (2008)
Baldan, P., Bracciali, A., Bruni, R.: A semantic framework for open processes. Theoretical Computer Science 389(3), 446–483 (2007)
Bensalem, S., Bozga, M., Nguyen, T.-H., Sifakis, J.: Compositional verification for component-based systems and application. IET Software, Special Issue on Automated Compositional Verification: Techniques, Applications and Empirical Studies 4(3), 181–193 (2010)
Berezin, S., Campos, S., Clarke, E.M.: Compositional Reasoning in Model Checking. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol. 1536, pp. 81–102. Springer, Heidelberg (1998)
Bettini, L., Bono, V., De Nicola, R., Ferrari, G., Gorla, D., Loreti, M., Moggi, E., Pugliese, R., Tuosto, E., Venneri, B.: The Klaim Project: Theory and Practice. In: Priami, C. (ed.) GC 2003. LNCS, vol. 2874, pp. 88–150. Springer, Heidelberg (2003)
Beyer, D., Chakrabarti, A., Henzinger, T.A.: Web service interfaces. In: Ellis, A., Hagino, T. (eds.) Proceedings of the 14th International Conference on World Wide Web, WWW 2005, pp. 148–159. ACM (2005)
Gheorghiu Bobaru, M., Păsăreanu, C.S., Giannakopoulou, D.: Automated Assume-Guarantee Reasoning by Abstraction Refinement. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 135–148. Springer, Heidelberg (2008)
Caires, L., Cardelli, L.: A spatial logic for concurrency (part I). Information and Computation, 1–37 (2001)
Caires, L., Cardelli, L.: A Spatial Logic for Concurrency (Part II). In: Brim, L., Jančar, P., Křetínský, M., Kučera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 209–225. Springer, Heidelberg (2002)
De Nicola, R., Loreti, M.: MoMo: A Modal Logic for Reasoning About Mobility. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2004. LNCS, vol. 3657, pp. 95–119. Springer, Heidelberg (2005)
D’Errico, L., Loreti, M.: Assume-Guarantee Verification of Concurrent Systems. In: Field, J., Vasconcelos, V.T. (eds.) COORDINATION 2009. LNCS, vol. 5521, pp. 288–305. Springer, Heidelberg (2009)
D’Errico, L., Loreti, M.: Property-Preserving Refinement of Concurrent Systems. In: Wirsing, M., Hofmann, M., Rauschmayer, A. (eds.) TGC 2010. LNCS, vol. 6084, pp. 222–236. Springer, Heidelberg (2010)
Gabbay, M., Pitts, A.M.: A new approach to abstract syntax involving binders. In: Proceedings of 14th IEEE Symposium on Logic in Computer Science, pp. 214–224 (1999)
Gelernter, D.: Multiple Tuple Spaces in Linda. In: Odijk, E., Rem, M., Syre, J.-C. (eds.) PARLE 1989. LNCS, vol. 366, pp. 20–27. Springer, Heidelberg (1989)
Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of ACM 32(1), 137–161 (1985)
Larsen, K., Xinxin, L.: Compositionality through an operational semantics of contexts. Journal of Logic and Computation 1(6), 761–795 (1991)
Milner, R.: Communication and Concurrency. Prentice Hall (1989)
De Nicola, R., Ferrari, G.L., Pugliese, R.: KLAIM: A kernel language for agents interaction and mobility. IEEE Transactions on Software Engineering 24(5), 315–330 (1998)
Winskel, G.: Topics in concurrency. Lecture notes. University of Cambridge (2008), http://www.cl.cam.ac.uk/~gw104/TIC08.ps
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
D’Errico, L., Loreti, M. (2012). Context Aware Specification and Verification of Distributed Systems. In: Bruni, R., Sassone, V. (eds) Trustworthy Global Computing. TGC 2011. Lecture Notes in Computer Science, vol 7173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30065-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-30065-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30064-6
Online ISBN: 978-3-642-30065-3
eBook Packages: Computer ScienceComputer Science (R0)