Abstract
We present a semantics for an imperative programming language, Lunsen, with constructs for concurrency and communication. The semantics is given through a translation into CCS. We have implemented this translation within the framework of the Concurrency Workbench, which is a tool for analysis of finite-state systems in CCS. The point of the translational semantics is that by imposing restrictions on Lunsen so that the semantics of a program is finite-state, we can analyze Lunsen programs automatically using the Concurrency Workbench. As an illustration we include an analysis of a mutual exclusion algorithm.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. Astesiano and E. Zucca. Semantics of CSP via translation into CCS. In Mathematical Foundations of Computer Science, volume 118 of LNCS, pages 172–182. Springer Verlag, 1981.
G. Boudol, R. de Simone, and D. Vergamini. Experiment with Auto and Autograph on a simple case sliding window protocol. Technical Report 870, Inria, July 1988.
K. Bartlett, R. Scantlebury, and P. Wilkinson. A note on reliable full-duplex transmissions over half duplex lines. Communications of the ACM, 2(5):260–261, 1969.
E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specification. ACM Trans. on Programming Languages and Systems, 8(2):244–263, April 1986.
R. Cleaveland, J. Parrow, and B. Steffen. A semantics-based verification tool for finite-state systems. In Protocol Specification, Testing, and Verification IX, pages 287–302, 1989. North-Holland.
J.C. Godskesen, K.G. Larsen, and M. Zeeberg. TAV users manual. In Proc. Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, 1989.
M. Hennessy and W. Li. Translating a subset of Ada into CCS. In D. Bjoerner, editor, Formal Description of Programming Concepts II, pages 227–249, Amsterdam, 1983. North-Holland.
L. Lamport. The mutual exclusion problem part II — statement and solutions. Journal of the ACM, 33(2), 1986.
R. Milner. Communication and Concurrency. Prentice Hall, 1989.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, part I. Technical Report ECS-LFCS-89-85, Department of Computer Science, University of Edinburgh, 1989.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, part II. Technical Report ECS-LFCS-89-86, Department of Computer Science, University of Edinburgh, 1989.
J.L. Peterson and A. Silberschatz. Operating System Concepts. Addison-Wesley, 1985.
J. Richier, C. Rodriguez, J. Sifakis, and J. Voiron. Verification in XESAR of the sliding window protocol. In Protocol Specification, Testing, and Verification VII. North-Holland, 1987.
S.A. Smolka and R.E. Strom. A CCS semantics for NIL. In M. Wirsing, editor, Formal Description of Programming Concepts III, pages 347–368, Amsterdam, 1986. North-Holland.
D.J. Walker. Automated analysis of mutual exclusion algorithms using CCS. Formal Aspects of Computing, 1:273–292, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fredlund, Lå., Jonsson, B., Parrow, J. (1990). An implementation of a translational semantics for an imperative language. In: Baeten, J.C.M., Klop, J.W. (eds) CONCUR '90 Theories of Concurrency: Unification and Extension. CONCUR 1990. Lecture Notes in Computer Science, vol 458. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039064
Download citation
DOI: https://doi.org/10.1007/BFb0039064
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53048-0
Online ISBN: 978-3-540-46395-5
eBook Packages: Springer Book Archive