Abstract
We apply the ASM semantics framework to define the await construct in the context of concurrent ASMs. We link + CAL programs to concurrent control state ASMs with turbo ASM submachines.
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
Abrial, J.-R.: The B-Book. Cambridge University Press, Cambridge (1996)
Börger, E.: Why use Evolving Algebras for hardware and software engineering? In: Bartosek, M., Staudek, J., Wiedermann, J. (eds.) SOFSEM 1995. LNCS, vol. 1012, pp. 236–271. Springer, Heidelberg (1995)
Börger, E.: High-level system design and analysis using Abstract State Machines. In: Hutter, D., Stephan, W., Traverso, P., Ullmann, M. (eds.) FM-Trends 1998. LNCS, vol. 1641, pp. 1–43. Springer, Heidelberg (1999)
Börger, E.: The origins and the development of the ASM method for high-level system design and analysis. J. Universal Computer Science 8(1), 2–74 (2002)
Börger, E.: The ASM refinement method. Formal Aspects of Computing 15, 237–257 (2003)
Börger, E., Päppinghaus, P., Schmid, J.: Report on a practical application of ASMs in software design. In: Gurevich, Y., Kutter, P.W., Odersky, M., Thiele, L. (eds.) ASM 2000. LNCS, vol. 1912, pp. 361–366. Springer, Heidelberg (2000)
Börger, E., Schmid, J.: Composition and submachine concepts for sequential ASMs. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 41–60. Springer, Heidelberg (2000)
Börger, E., Stärk, R.F.: Abstract State Machines. In: A Method for High-Level System Design and Analysis. Springer, Heidelberg (2003)
Del Castillo, G., Winter, K.: Model checking support for the ASM high-level language. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol. 1785, pp. 331–346. Springer, Heidelberg (2000)
Farahbod, R., et al.: The CoreASM Project, http://www.coreasm.org
Farahbod, R., Gervasi, V., Glässer, U.: CoreASM: An Extensible ASM Execution Engine. Fundamenta Informaticae XXI (2006)
Foundations of Software Engineering Group, Microsoft Research. AsmL. Web pages (2001), http://research.microsoft.com/foundations/AsmL/
Fruja, N.G., Stärk, R.F.: The hidden computation steps of turbo Abstract State Machines. In: Börger, E., Gargantini, A., Riccobene, E. (eds.) ASM 2003. LNCS, vol. 2589, pp. 244–262. Springer, Heidelberg (2003)
Gargantini, A., Riccobene, E., Rinzivillo, S.: Using Spin to generate tests from ASM specifications. In: Börger, E., Gargantini, A., Riccobene, E. (eds.) ASM 2003. LNCS, vol. 2589, pp. 263–277. Springer, Heidelberg (2003)
Gawanmeh, A., Tahar, S., Winter, K.: Interfacing ASMs with the MDG tool. In: Börger, E., Gargantini, A., Riccobene, E. (eds.) ASM 2003. LNCS, vol. 2589, pp. 278–292. Springer, Heidelberg (2003)
Gawanmeh, A., Tahar, S., Winter, K.: Formal verification of asms using mdgs. Journal of Systems Architecture 54(1-2), 15–34 (2008)
Glässer, U., Rastkar, S., Vajihollahi, M.: Computational Modeling and Experimental Validation of Aviation Security Procedures. In: Mehrotra, S., Zeng, D.D., Chen, H., Thuraisingham, B., Wang, F.-Y. (eds.) ISI 2006. LNCS, vol. 3975, pp. 420–431. Springer, Heidelberg (2006)
Knuth, D.: Structured programming with goto statements. Computing Surveys 6 (December 1974)
Lamport, L.: A fast mutual exclusion algorithm. ACM Transactions of Computer Systems 5(1), 1–11 (1987)
Lamport, L.: A +CAL user’s manual.P-syntax version. (June 29, 2007), http://research.microsoft.com/users/lamport/tla
Lamport, L.: The +CAL algorithm language. (February 14, 2008), http://research.microsoft.com/users/lamport/tla/pluscal.html
Plonka, C.N.: Model checking for the design with Abstract State Machines. Diplom thesis, CS Department of University of Ulm, Germany (January 2000)
Slissenko, A., Vasilyev, P.: Simulation of timed Abstract State Machines with predicate logic model-checking. J. Universal Computer Science 14(12), 1984–2007 (2008)
Stärk, R.F., Schmid, J., Börger, E.: Java and the Java Virtual Machine: Definition, Verification, Validation. Springer, Heidelberg (2001)
Winter, K.: Model checking for Abstract State Machines. J. Universal Computer Science 3(5), 689–701 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Altenhofen, M., Börger, E. (2009). Concurrent Abstract State Machines and + CAL Programs. In: Corradini, A., Montanari, U. (eds) Recent Trends in Algebraic Development Techniques. WADT 2008. Lecture Notes in Computer Science, vol 5486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03429-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-03429-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03428-2
Online ISBN: 978-3-642-03429-9
eBook Packages: Computer ScienceComputer Science (R0)