Publication: Modular specification in rewriting logic (extended version)
Loading...
Official URL
Full text at PDC
Publication Date
2017
Authors
Advisors (or tutors)
Editors
Journal Title
Journal ISSN
Volume Title
Publisher
Citations
Exportar
Abstract
Our aim is to bring modularity to system specification in rewriting logic. Modularity here is in the sense of decomposing a system into its functional components, coding the specification for each component as a separate system, and then assembling them back. Rewriting logic is well suited for the specification of concurrent and non-deterministic systems but, up to now, modularity could hardly be addressed within it. The base of our proposal is the operation that we call synchronous composition. We discuss the reasons and implications of our proposal, and formalize it for rewriting logic and also for transition structures, to be used as semantics. To show the power of our approach, we include a few small but realistic examples and a larger example on cached computer architecture.
Description
UCM subjects
Unesco subjects
Keywords
Citation
[1] Bachmair, L., Tiwari, A., and Vigneron, L. Abstract Congruence Closure. Journal of Automated Reasoning 31, 2 (2003), 129–168.
[2] Bruni, R., and Meseguer, J. Semantic foundations for generalized rewrite theories. Theoretical Computer Science 360, 1 (2006), 386–414.
[3] Bruns, G., and Godefroid, P. Model Checking Partial State Spaces with 3-Valued Temporal Logics. In Computer Aided Verification: 11th
International Conference, CAV ’99 (Trento, Italy, 1999), N. Halbwachs and D. Peled, Eds., vol. 1633 of Lecture Notes in Computer Science, Springer-Verlag, pp. 274–287.
[4] Bruns, G., and Godefroid, P. Generalized Model Checking: Reasoning about Partial State Spaces. In CONCUR 2000—Concurrency Theory: 11th International Conference (University Park, PA, USA, 2000), C. Palamidessi, Ed., vol. 1877 of Lecture Notes in Computer Science, Springer, pp. 168–182.
[5] Clarke, E. M. J., Grumberg, O., and Peled, D. A. Model Checking.MIT Press, Cambridge, MA, USA, 1999.
[6] Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N.,Meseguer, J., and Talcott, C. L. All About Maude - A High-
Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic, vol. 4350 of Lecture Notes in Computer Science. Springer, Berlin, Heidelberg, 2007.
[7] Clavel, M., and Meseguer, J. Internal strategies in a reflective logic.In Proceedings of the CADE-14 Workshop on Strategies in Automated Deduction (Townsville, Australia, 1997), B. Gramlich and H. Kirchner, Eds., Springer, pp. 1–12.
[8] De Nicola, R., Fantechi, A., Gnesi, S., and Ristori, G. An actionbased framework for veryfying logical and behavioural properties of concurrent systems. Computer Networks and ISDN Systems 25, 7 (1993), 761–778.
[9] De Nicola, R., and Vaandrager, F. Three Logics for Branching Bisimulation. Journal of the Association for Computing Machinery 42, 2 (mar 1995), 458–487.
[10] Eker, S., Martí-Oliet, N., Meseguer, J., and Verdejo, A. Deduction, Strategies, and Rewriting. In Proceedings of the 6th International Workshop on Strategies in Automated Deduction (STRATEGIES 2006) (Seattle, WA, USA, 2007), M. Archer, T. B. de la Tour, and C. Mu˜noz, Eds., vol. 174 of Electronic Notes in Theoretical Computer Science, Elsevier, pp. 3–25.
[11] Godefroid, P., and Huth, M. Model Checking vs. Generalized Model Checking: Semantic Minimizations for Temporal Logics. In Proc. 20th Annual IEEE Symposium on Logic in Computer Science (LICS’ 05) (Chicago, IL, USA, 2005), IEEE, pp. 158–167.
[12] Handy, J. The Cache Memory Book, 2 ed. The Morgan Kaufmann Series in Computer Architecture and Design Series. Academic Press Inc., 1998.
[13] Harel, D., Marron, A., and Weiss, G. Behavioural Programming. Communications of the Association for Computing Machinery 55, 7 (2012), 90–100.
[14] Hoare, C. A. R. Communicating Sequential Processes. Communications of the Association for Computing Machinery 21, 8 (1978), 666–677.
[15] Hopcroft, J. E., Motwani, R., and Ullman, J. D. Introduction to Automata Theory, Languages, and Computation (3rd Edition). Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2006.
[16] Huth, M., Jagadeesan, R., and Schmidt, D. Modal Transition Systems: A Foundation for Three-Valued Program Analysis. In Programming Languages and Systems: 10th European Symposium on Programming, ESOP 2001 (Genova, Italy, 2001), D. Sands, Ed., vol. 2028 of Lecture Notes in Computer Science, Springer, pp. 155–169.
[17] Jensen, K., and Kristensen, L. M. Coloured Petri Nets. Springer Berlin Heidelberg, Berlin, Heidelberg, 2009.
[18] Kiczales, G., Lamping, J., Mendhekar, A., Maeda, C., Lopes, C. V., Loingtier, J.-M., Irwin, J., and Lopes, C. Aspect-Oriented Programming. In ECOOP ’97—Object-Oriented Programming (Jyv¨askyl¨a, Finland, 1997), vol. 1241 of Lecture Notes in Computer Science, Springer-Verlag, pp. 220–242.
[19] Kindler, E., and Vesper, T. ESTL: A temporal logic for events and states. In Application and Theory of Petri Nets 1998: 19th International Conference, ICATPN ’98 (Lisbon, Portugal, 1998), J. Desel and M. Silva, Eds., vol. 1420 of Lecture Notes in Computer Science, Springer, pp. 365–384.
[20] Lescanne, P. Completion Procedures as Transition Rules + Control.In TAPSOFT ’89: Proceedings of the International Joint Conference on Theory and Practice of Software Development (Berlin, Heidelberg, 1989), J. Díaz and F. Orejas, Eds., vol. 351 of Lecture Notes in Computer Science, Springer, pp. 28–41.
[21] Martí-Oliet, N., Meseguer, J., and Verdejo, A. Towards a strategy language for Maude. In Proceedings of the Fifth International Workshop on Rewriting Logic and Its Applications (WRLA 2004) (Barcelona, Spain, 2004), N. Martí-Oliet, Ed., vol. 117 of Electronic Notes in Theoretical Computer Science, Elsevier, pp. 417–441.
[22] Martí-Oliet, N., Meseguer, J., and Verdejo, A. A Rewriting Semantics for Maude Strategies. In Proceedings of the Seventh International Workshop on Rewriting Logic and its Applications (WRLA 2008) (Budapest, Hungary, 2009), G. Rosu, Ed., vol. 238 of Electronic Notes in Theoretical Computer Science, Elsevier, pp. 227–247.
[23] Martín, Ó., Verdejo, A., and Martí-Oliet, N. Egalitarian State-Transition Systems. In Rewriting Logic and Its Applications: WRLA 2016 (Eindhoven, The Netherlands, 2016), D. Lucanu, Ed., vol. 9942 of Lecture Notes in Computer Science, Springer, pp. 98–117.
[24] Martín, Ó., Verdejo, A., and Martí-Oliet, N. Synchronous products of rewrite systems. In Automated Technology for Verification and Analysis: ATVA 2016 (Cham, 2016), C. Artho, A. Legay, and D. A. Peled, Eds., vol. 9938 of Lecture Notes in Computer Science, Springer, pp. 141–156.
[25] Martín, Ó., Verdejo, A., and Martí-Oliet, N. Compositional specification in rewriting logic. Submitted for publication.
[26] Mazurkiewicz, A. Compositional semantics of pure place/transition systems. In Advances in Petri nets: APN 1987 (Oxford, UK, 1988), G. Rozenberg, Ed., vol. 340 of Lecture Notes in Computer Science, Springer, pp. 307–330.
[27] Meseguer, J. Conditional rewriting logic as a unified model of concurrency.Theoretical Computer Science 96, 1 (1992), 73–155.
[28] Meseguer, J. The temporal logic of rewriting: A gentle introduction. In Concurrency, Graphs and Models (Berlin, Heidelberg, 2008), P. Degano, R. D. Nicola, and J. Meseguer, Eds., vol. 5065 of Lecture Notes in Computer Science, Springer, pp. 354–382.
[29] Meseguer, J., and Thati, P. Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. Higher-Order and Symbolic Computation 20 (2007), 123–160.
[30] Milner, R. A Calculus of Communicating Systems, vol. 92 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, 1980.
[31] Reisig, W. Petri Nets: an Introduction. EATCS Monographs in Theoretical Computer Science. Springer, Berlin, Heidelberg, 1985.
[32] Soboci´nski, P. Compositional model checking of concurrent systems, with Petri nets. In Developements in Computational Models: DCM 2015 Proc. (Cali, Colombia, 2016), C. A. Mu˜noz and J. A. P´erez, Eds., vol. 204 of Electronics Proceedings in Theoretical Computer Science, Open Publishing Association, pp. 19–30.
[33] Verdejo, A., and Martí-Oliet, N. Basic completion strategies as another application of the Maude strategy language. In Workshop on Reduction Strategies in Rewriting and Programming (WRS2011) (Novi Sad, Serbia, 2012), S. Escobar, Ed., vol. 82 of Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, pp. 17–36.