Abstract
A schema of communication elimination laws for distributed programs and systems is mathematically justified in a new equivalence, which was introduced in a recent work. A complete set of applicability conditions is derived for them. A formal communication elimination algorithm, applying the laws as reductions, is mathematically justified for an important class of distributed programs and systems, whose communications are outside the scope of selections. The analysis provides the basis for extensions to general statements. State-vector reduction stands as one of the motivations for this static analysis approach. It has already been applied in an equivalence proof of a non-trivial pipelined distributed system, reported in prior works. The state-vector reduction obtained in this proof, yielding a reduction factor of 2− − 607 for the upper-bound on the number of states, is presented in this communication.
Work partially supported by the CICYT under project TIC2003-09420-C02-02.
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
INMOS-Limited: Occam Programming Manual. Prentice Hall, Englewood Cliffs (1985)
INMOS-Limited: Occam 2 Reference Manual. Prentice Hall, Englewood Cliffs (1988)
Jones, G.: Programming in Occam. Prentice Hall, Englewood Cliffs (1987)
Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems. Specification. Springer, Heidelberg (1991)
Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems. Safety. Springer, Heidelberg (1995)
Holtzmann, G.: Design and Validation of Computer Protocols. Prentice Hall, Englewood Cliffs (1991)
de Roever, W.P., de Boer, F., Hanneman, U., Lakhnech, Y., Poel, M., Zwiers, J.: Concurrency Verification: Introduction to Compositonal and Noncompositional Methods. Cambridge University Press, Cambridge (2001)
Yorav, K., Grumberg, O.: Static Analysis for State-space Reductions. Formal Methods in System Design 25, 67–96 (2004)
Kurshan, R., Levin, V., Minea, M., Peled, D., Yenigun, H.: Static Partial Order Reduction. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 335–357. Springer, Heidelberg (1998)
Clarke, E.M., Grumberg, O., Long, D.: Model Cheking and Abstraction. ACM Transactions on Programming Languages and Systems 16, 1512–1542 (1994)
Bertran, M., Babot, F., Climent, A., Nicolau, M.: Communication and Parallelism Introduction and Elimination in Imperative Concurrent Programs. In: Cousot, P. (ed.) SAS 2001. LNCS, vol. 2126, pp. 20–39. Springer, Heidelberg (2001)
Bertran, M., Babot, F.X., Climent, A.: An Input/output Semantics for Distributed Program Equivalence Reasoning. Electronic Notes in Theoretical Computer Science 137 (2005)
Francesco, N.D., Santone, A.: A Transformation System for Concurrent Processes. Acta Informatica 35, 1037–1073 (1998)
Schenke, M., Olderog, E.R.: Transformation Design for Real-Time Systems. part i: From Requirements to Program Specifications. Acta Informatica 36, 1–65 (1999)
Schenke, M.: Transformation Design for Real-Time Systems. part ii: From Program Specifications to Programs. Acta Informatica 36, 67–96 (1999)
Roscoe, A., Hoare, C.: The laws of OCCAM programming. Theoretical Computer Science 60, 177–229 (1988)
Elrad, T., Francez, N.: Decomposition of Distributed Programs into Communication Closed Layers. Science of Computer Programming 2, 155–173 (1982)
Babot, F., Bertran, M., Riera, J., Puig, R., Climent, A.: Mechanized Equivalence Proofs of Pipelined Processor Software Models. In: Actas de las III Jornadas de Programación y Lenguajes, Alicante, Universitat d’Alacant, 91–104 (2003)
Babot, F.X.: Contributions to Communication Elimination Proofs for Distributed Program Simplification. Ph.d. dissertation, Escola Tècnica Superior d’Enginyeria Electrònica i Informàtica La Salle, Universitat Ramon Llull (2005)
Hennessy, J.L., Patterson, D.A.: Computer Architecture: A Quantitative Approach. Morgan Kaufmann Publishers Inc., San Mateo (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Babot, F., Bertran, M., Climent, A. (2005). A Static Communication Elimination Algorithm for Distributed System Verification. In: Lau, KK., Banach, R. (eds) Formal Methods and Software Engineering. ICFEM 2005. Lecture Notes in Computer Science, vol 3785. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11576280_26
Download citation
DOI: https://doi.org/10.1007/11576280_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29797-0
Online ISBN: 978-3-540-32250-4
eBook Packages: Computer ScienceComputer Science (R0)