Abstract
Abstract State Machines (ASMs) represent a general model of computation which subsumes all other classic computational models. Since the notion of ASM state naturally captures the classic notion of program state, ASMs are suitable to be verified through a predicate abstraction approach. The aim of this paper is to discuss how predicates over ASM states can support the formal verification of ASM-based models. The proposal can overcome the main limitations that penalize traditional model checking techniques applied to ASMs.
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
Agrawal, D.P., Zeng, Q.A.: Introduction to Wireless and Mobile Systems. Thomson Brooks/Cole (2003)
Alpern, B., Schneider, F.B.: Defining Liveness. Information Processing Letters 21(4), 181–185 (1985)
Arcaini, P., Gargantini, A., Riccobene, E.: AsmetaSMV: AWay to link high-level ASM models to low-level NuSMV specifications. In: 2th International Conference on Abstract State Machines, Alloy, B and Z, pp. 61–74 (2010)
Arcaini, P., Gargantini, A., Riccobene, E.: CoMA: conformance monitoring of java programs by abstract state machines. In: Khurshid, S., Sen, K. (eds.) RV 2011. LNCS, vol. 7186, pp. 223–238. Springer, Heidelberg (2012)
Baier, C., Katoen, J.P.: Principles of Model Chacking. The MIT Press (2008)
Bianchi, A., Manelli, L., Pizzutilo, S.: An ASM-based Model for Grid Job Management. Informatica (Slovenia) 37(3), 295–306 (2013)
Bianchi, A., Pizzutilo, S., Vessio, G.: Suitability of Abstract State Machines for Discussing Mobile Ad-hoc Networks. Global Journal of Advanced Software Engineering 1, 29–38 (2014)
Blass, A., Gurevich, Y.: Abstract State Machines Capture Parallel Algorithms. ACM Transactions on Computational Logic 4(4), 578–651 (2003)
Börger, E., Stärk, R.: Abstract State Machines: A Method for High-Level System Design and Analysis. Springer (2003)
Chen, Z., Zhou, C., Ding, D.: Automatic abstraction refinement for petri nets verification. In: 10th Int. Workshop on High-Level Design, Validation and Test, pp. 168–174 (2005)
Das, S., Dill, D.L., Park, S.: Experience with predicate abstraction. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 160–171. Springer, Heidelberg (1999)
Dershowitz, N.: The Generic Model of Computation. Electronic Proceedings in Theoretical Computer Science (2013)
Dijkstra, E.W.: Hierarchical Ordering of Sequential Processes. ACTA Informatica 1(2), 115–138 (1971)
Farahbod, R., Glässer, U., Ma, G.: Model Checking CoreASM Specifications. In: 14th International ASM Workshop (2007)
Gabrisch, W.: A Hoare-Style Verification Calculus for Control State ASMs. In: 5th Balkan Conference on Informatics, pp. 205–210 (2012)
Gargantini, A., Riccobene, E., Rinzivillo, S.: Using spin to generate testsfrom ASM specifications. In: Börger, E., Gargantini, A., Riccobene, E. (eds.) ASM 2003. LNCS, vol. 2589, pp. 263–277. Springer, Heidelberg (2003)
Gervasi, V.: An ASM model of concurrency in a web browser. In: Derrick, J., Fitzgerald, J., Gnesi, S., Khurshid, S., Leuschel, M., Reeves, S., Riccobene, E. (eds.) ABZ 2012. LNCS, vol. 7316, pp. 79–93. Springer, Heidelberg (2012)
Glausch, A., Reisig, W.: An ASM-characterization of a class of distributed algorithms. In: Abrial, J.-R., Glässer, U. (eds.) Rigorous Methods for Software Construction and Analysis. LNCS, vol. 5115, pp. 50–64. Springer, Heidelberg (2009)
Graf, S., Saidi, H.: Construction of abstract state graphs with PVS. In: 9th International Conference on Computer Aided Verification, pp. 72–83 (1997)
Gurevich, Y.: Sequential Abstract State Machines Capture Sequential Algorithms. ACM Transactions on Computational Logic 1(1), 77–111 (2000)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)
Klai, K., Desel, J.: Checking soundness of business processes compositionally using symbolic observation graphs. In: Giese, H., Rosu, G. (eds.) FORTE 2012 and FMOODS 2012. LNCS, vol. 7273, pp. 67–83. Springer, Heidelberg (2012)
Kindler, E.: Safety and Liveness Properties: A Survey. EATCS Bulletin 53, 268–272 (1994)
Laplante, P.: Dictionary of Computer Science, Engineering and Technology. CRC Press (2000)
Luzzana, A., Rossetti, M., Righettini, P., Scandurra, P.: Modeling synchronization/communication patterns in vision-based robot control applications using ASMs. In: Derrick, J., Fitzgerald, J., Gnesi, S., Khurshid, S., Leuschel, M., Reeves, S., Riccobene, E. (eds.) ABZ 2012. LNCS, vol. 7316, pp. 331–335. Springer, Heidelberg (2012)
Perkins, C.E., Belding-Royer, E.M., Das, S.R.: Ad hoc On-Demand Distance Vector (AODV) Routing. RFC 3561 http://tools.ietf.org/html/rfc3561 (2003)
Reisig, W.: The Expressive Power of Abstract State Machines. Computing and Informatics 22, 209–219 (2003)
Singhal, M.: Deadlock Detection in Distributed Systems. IEEE Computer 22(11), 37–48 (1989)
Spielmann, M.: Automatic verification of abstract state machines. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 431–442. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Bianchi, A., Pizzutilo, S., Vessio, G. (2015). Applying Predicate Abstraction to Abstract State Machines. In: Gaaloul, K., Schmidt, R., Nurcan, S., Guerreiro, S., Ma, Q. (eds) Enterprise, Business-Process and Information Systems Modeling. BPMDS EMMSAD 2015 2015. Lecture Notes in Business Information Processing, vol 214. Springer, Cham. https://doi.org/10.1007/978-3-319-19237-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-19237-6_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19236-9
Online ISBN: 978-3-319-19237-6
eBook Packages: Computer ScienceComputer Science (R0)