Abstract
We present an approach for the verification of spatial properties with Spin. We first extend one of Spin’s main property specification mechanisms, i.e., the linear-time temporal logic LTL, with spatial connectives that allow us to restrict the reasoning of the behaviour of a system to some components of the system, only. For instance, one can express whether the system can reach a certain state from which a subset of processes can evolve alone until some property is fulfilled. We give a model checking algorithm for the logic and propose how Spin can be minimally extended to include the algorithm. We also discuss potential improvements to mitigate the exponential complexity introduced by spatial connectives. Finally, we present some experiments that compare our Spin extension with a spatial model checker for the π-calculus.
This work has been supported by the EU within the FETPI Global Computing, project IST-2005-016004 SEnSOria (Software Engineering for Service-Oriented Overlay Computers).
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
Holzmann, G.: The Spin Model Checker, Primer and Reference Manual. Addison-Wesley, Reading, Massachusetts (2004)
Havelund, K., Pressburger, T.: Model checking java programs using java pathfinder. International Journal on Software Tools for Technology Transfer 2(4) (2000)
Corbett, J.C., Dwyer, M.B., Hatcliff, J., Laubach, S., Pasareanu, C.S., Robby, Z.H.: Bandera: Extracting finite-state models from Java source code. In: 22nd International Conference on Software Engineering (ICSE), IEEE Computer Society Press, Los Alamitos (2000)
Varró, D.: Automated formal verification of visual modeling languages by model checking. Software and System Modeling 3(2), 85–113 (2004)
Song, H., Compton, K.J.: Verifying π-calulus processes by promela translation. Technical Report CSE-TR-472-03, University of Michigan (2003)
Wu, P.: Interpreting π-calculus with spin/promela. Technical report, Lab. for Computer Science, Institute of Software, Chinese Academy of Sciences (2001)
Milner, R.: Communicating and Mobile Systems: The π-calculus. Cambridge University Press, Cambridge (1992)
Manna, Z., Pnueli, A.: The temporal logic of reactive systems. Springer, Heidelberg (1991)
Reif, J., Sistla, A.P.: A multiprocess network logic with temporal and spatial modalities. J. Comput. Syst. Sci. 30(1), 41–53 (1985)
Browne, M.C., Clarke, E.M., Grumberg, O.: Reasoning about networks with many identical finite state processes. Inf. Comput. 81(1), 13–31 (1989)
German, S.M., Sistla, A.P.: Reasoning about systems with many processes. J. ACM 39(3), 675–735 (1992)
Caires, L., Cardelli, L.: A spatial logic for concurrency (part II). In: Proceedings of the 13th International Conference on Concurrency Theory, pp. 209–225. Springer, Heidelberg (2002)
Caires, L., Cardelli, L.: A spatial logic for concurrency (part I). Inf. Comput. 186(2), 194–235 (2003)
Caires, L., Cardelli, L.: Behavioral and spatial observations in a logic for the π-calculus. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 72–87. Springer, Heidelberg (2004)
Cardelli, L., Gordon, A.D.: Ambient logic. Mathematical Structures in Computer Science (to appear)
Reynolds, J.: Separation logic: A logic for shared mutable data structures. In: Logic in Computer Science, pp. 55–74. IEEE Computer Society Press, Los Alamitos (2002)
Cardelli, L., Gardner, P., Ghelli, G.: Manipulating trees with hidden labels. In: Gordon, A.D. (ed.) ETAPS 2003 and FOSSACS 2003. LNCS, vol. 2620, pp. 216–232. Springer, Heidelberg (2003)
Cardelli, L., Gardner, P., Ghelli, G.: A spatial logic for querying graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 597–610. Springer, Heidelberg (2002)
Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Rozenberg, G., (ed.) Handbook of Graph Grammars and Computing by Graph Transformation. World Scientific, pp. 313–400 (1997)
Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Inf. 1, 115–138 (1971)
Dwyer, M.B., Avrunin, G.S., Corbett, J.C.: Patterns in property specifications for finite-state verification. In: ICSE, pp. 411–420 (1999)
Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)
Vieira, H.: L.C.: The spatial logic model checker user’s manual. Technical Report TR-DI/FCT/UNL-03/2004, Faculty of Science and Technology New University of Lisbon (2004)
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)
Holzmann, G.J., Peled, D.: An improvement in formal verification. In: FORTE. IFIP Conference Proceedings, vol. 6, pp. 197–211. Chapman & Hall, Sydney, Australia (1994)
Edelkamp, S., Leue, S., Lluch Lafuente, A.: Directed explicit-state model checking in the validation of communication protocols. STTT 5(2-3), 247–267 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lluch Lafuente, A. (2007). Towards Model Checking Spatial Properties with SPIN . In: Bošnački, D., Edelkamp, S. (eds) Model Checking Software. SPIN 2007. Lecture Notes in Computer Science, vol 4595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73370-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-73370-6_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73369-0
Online ISBN: 978-3-540-73370-6
eBook Packages: Computer ScienceComputer Science (R0)