article

The rewriting logic semantics project: A progress report

Authors:

José Meseguer,

Grigore RoşuAuthors Info & Claims

Information and Computation, Volume 231

Pages 38 - 69

https://doi.org/10.1016/j.ic.2013.08.004

Published: 01 October 2013 Publication History

Abstract

Rewriting logic is an executable logical framework well suited for the semantic definition of languages. Any such framework has to be judged by its effectiveness to bridge the existing gap between language definitions on the one hand, and language implementations and language analysis tools on the other. We give a progress report on how researchers in the rewriting logic semantics project are narrowing the gap between theory and practice in areas such as: modular semantic definitions of languages; scalability to real languages; support for real time; semantics of software and hardware modeling languages; and semantics-based analysis tools such as static analyzers, model checkers, and program provers.

References

[1]

Meseguer, J. and Roşu, G., Rewriting logic semantics: From language specifications to formal analysis tools. In: Lecture Notes in Computer Science, vol. 3097. Springer. pp. 1-44.

Digital Library

[2]

Meseguer, J. and Roşu, G., The rewriting logic semantics project. Theoretical Computer Science. v373. 213-237.

[3]

Şerb¿nu¿¿, T.F., Roşu, G. and Meseguer, J., A rewriting logic approach to operational semantics. Information and Computation. v207 i2. 305-340.

[4]

Meseguer, J. and Rosu, G., The rewriting logic semantics project: A progress report. In: Owe, O., Steffen, M., Telle, J.A. (Eds.), Lecture Notes in Computer Science, vol. 6914. Springer. pp. 1-37.

[5]

Plotkin, G.D., A structural approach to operational semantics. Journal of Logic and Algebraic Programming. v60-61. 17-139.

[6]

Kahn, G., Natural semantics. In: Lecture Notes in Computer Science, vol. 247. Springer. pp. 22-39.

Digital Library

[7]

Mosses, P.D., Modular structural operational semantics. Journal of Logic and Algebraic Programming. v60-61. 195-228.

[8]

A syntactic approach to type soundness. Information and Computation. v115 i1. 38-94.

[9]

Felleisen, M. and Friedman, D.P., Control operators, the SECD-machine, and the λ-calculus. In: 3rd Working Conference on the Formal Description of Programming Concepts, pp. 193-219.

[10]

The chemical abstract machine. Theoretical Computer Science. v96 i1. 217-248.

[11]

Wand, M., First-order identities as a defining language. Acta Informatica. v14. 337-357.

[12]

Goguen, J.A. and Parsaye-Ghomi, K., Algebraic denotational semantics using parameterized abstract modules. In: Diaz, J., Ramos, I. (Eds.), Lecture Notes in Computer Science, vol. 107. Springer-Verlag. pp. 292-309.

[13]

Broy, M., Wirsing, M. and Pepper, P., On the algebraic definition of programming languages. ACM Transactions on Programming Languages and Systems. v9 i1. 54-99.

[14]

Mosses, P.D., Unified algebras and action semantics. In: Lecture Notes in Computer Science, vol. 349. Springer. pp. 17-35.

Digital Library

[15]

Goguen, J. and Malcolm, G., Algebraic Semantics of Imperative Programs. 1996. MIT Press.

[16]

van Deursen, A., Heering, J. and Klint, P., Language Prototyping: An Algebraic Specification Approach. 1996. World Scientific.

[17]

Scott, D., Outline of a mathematical theory of computation. In: Proceedings, Fourth Annual Princeton Conference on Information Sciences and Systems, Princeton University. pp. 169-176.

[18]

Scott, D. and Strachey, C., Toward a mathematical semantics for computer languages. In: Microwave Research Institute Symposia Series, vol. 21: Proc. Symp. on Computers and Automata, Polytechnical Institute of Brooklyn.

[19]

Schmidt, D.A., Denotational Semantics - A Methodology for Language Development. 1986. Allyn and Bacon, Boston, MA.

[20]

Mosses, P.D., Denotational semantics. In: van Leeuwen, J. (Ed.), Handbook of Theoretical Computer Science, vol. B, Chapter 11, North-Holland.

[21]

Friedman, D.P., Wand, M. and Haynes, C.T., Essentials of Programming Languages. 2001. 2nd edition. MIT Press, Cambridge, MA.

[22]

Pierce, B., Types and Programming Languages. 2002. MIT Press.

[23]

Kaufmann, M., Manolios, P. and Moore, J.S., Computer-Aided Reasoning: ACL2 Case Studies. 2000. Kluwer Academic Press.

[24]

An abstract view of programming languages. June 1989. Edinburgh University, Dept. of Computer Science.

[25]

Wadler, P., The essence of functional programming. In: Proc. POPL ¿92, ACM Press, New York, NY, USA. pp. 1-14.

[26]

Liang, S., Hudak, P. and Jones, M., Monad transformers and modular interpreters. In: Proc. POPL'95, ACM Press. pp. 333-343.

[27]

Pfenning, F. and Elliott, C., Higher-order abstract syntax. In: Proc. PLDI¿88, ACM Press. pp. 199-208.

[28]

Harper, R., Honsell, F. and Plotkin, G.D., A framework for defining logics. Journal of the ACM. v40 i1. 143-184.

[29]

Nadathur, G. and Miller, D., An overview of λ-Prolog. In: Bowen, K., Kowalski, R. (Eds.), Fifth Int. Joint Conf. and Symp. on Logic Programming, MIT Press. pp. 810-827.

[30]

Miller, D., Representing and reasoning with operational semantics. In: Lecture Notes in Computer Science, vol. 4130. pp. 4-20.

[31]

Borras, P., Clément, D., Despeyroux, T., Incerpi, J., Kahn, G., Lang, B. and Pascual, V., CENTAUR: The system. In: Software Development Environments (SDE), pp. 14-24.

[32]

Clément, D., Despeyroux, J., Hascoet, L. and Kahn, G., Natural semantics on the computer. In: Fuchi, K., Nivat, M. (Eds.), Proceedings, France-Japan AI and CS Symposium, pp. 49-89.

[33]

Slonneger, K. and Kurtz, B.L., Formal Syntax and Semantics of Programming Languages. 1995. Addison-Wesley.

[34]

Gurevich, Y., Evolving algebras 1993: Lipari Guide. In: Börger, E. (Ed.), Specification and Validation Methods, Oxford University Press. pp. 9-37.

[35]

Stärk, R.F., Schmid, J. and Börger, E., Java and the Java Virtual Machine: Definition, Verification, Validation. 2001. Springer.

[36]

Braga, C., Rewriting logic as a semantic framework for modular structural operational semantics. 2001. Departamento de Informática, Pontifícia Universidade Católica do Rio de Janeiro, Brazil.

[37]

Verdejo, A. and Martí-Oliet, N., Implementing CCS in Maude 2. Electronic Notes in Theoretical Computer Science. v71. 282-300.

[38]

Thati, P., Sen, K. and Martí-Oliet, N., An executable specification of asynchronous Pi-Calculus semantics and may testing in Maude 2.0. Electronic Notes in Theoretical Computer Science. v71. 261-281.

[39]

Stehr, M.-O. and Talcott, C., PLAN in Maude: Specifying an active network programming language. Electronic Notes in Theoretical Computer Science. v71. 240-260.

[40]

Meseguer, J., Software specification and verification in rewriting logic. In: Broy, M., Pizka, M. (Eds.), Models, Algebras, and Logic of Engineering Software, IOS Press. pp. 133-193.

[41]

Verdejo, A., Maude como marco semántico ejecutable. 2003. Facultad de Informática, Universidad Complutense, Madrid, Spain.

[42]

Chen, F., Roşu, G. and Venkatesan, R.P., Rule-based analysis of dimensional safety. In: Lecture Notes in Computer Science, vol. 2706. pp. 197-207.

[43]

Roşu, G., Venkatesan, R.P., Whittle, J. and Leustean, L., Certifying optimality of state estimation programs. In: Lecture Notes in Computer Science, vol. 2725. Springer. pp. 301-314.

Digital Library

[44]

Verdejo, A. and Martí-Oliet, N., Executable structural operational semantics in Maude. Journal of Logic and Algebraic Programming. v67 i1-2. 226-293.

[45]

Farzan, A., Meseguer, J. and Roşu, G., Formal JVM code analysis in JavaFAN. In: Lecture Notes in Computer Science, vol. 3116. Springer. pp. 132-147.

Digital Library

[46]

Farzan, A., Cheng, F., Meseguer, J. and Roşu, G., Formal analysis of Java programs in JavaFAN. In: Lecture Notes in Computer Science, vol. 3114.

[47]

Johnsen, E.B., Owe, O. and Axelsen, E.W., A runtime environment for concurrent objects with asynchronous method calls. Electronic Notes in Theoretical Computer Science. v117. 375-392.

[48]

Braga, C. and Meseguer, J., Modular rewriting semantics in practice. Electronic Notes in Theoretical Computer Science. v117. 393-416.

[49]

Meseguer, J. and Braga, C., Modular rewriting semantics of programming languages. In: Lecture Notes in Computer Science, vol. 3116. Springer. pp. 364-378.

Digital Library

[50]

Chalub, F. and Braga, C., A modular rewriting semantics for CML. Journal of Universal Computer Science. v10 i7. 789-807.

[51]

Chalub, F., An implementation of Modular SOS in Maude. May 2005. Universidade Federal Fluminense, Niterói, RJ, Brazil.

[52]

Farzan, A. and Meseguer, J., Partial order reduction for rewriting semantics of programming languages. Electronic Notes in Theoretical Computer Science. v176 i4. 61-78.

[53]

Clavel, M. and Santa-Cruz, J., ASIP + ITP: A verification tool based on algebraic semantics. In: López-Fraguas, F.J. (Ed.), Actas de las V Jornadas sobre Programación y Lenguajes, Thomson. pp. 149-158.

[54]

Sasse, R., Taclets vs. rewriting logic - Relating semantics of Java. May 2005. Fakultät für Informatik, Universität Karlsruhe, Germany.

[55]

Ahrendt, W., Roth, A. and Sasse, R., Automatic validation of transformation rules for java verification against a rewriting semantics. In: Lecture Notes in Computer Science, vol. 3835. Springer-Verlag. pp. 412-426.

[56]

Stehr, M.-O. and Talcott, C.L., Practical techniques for language design and prototyping. In: Fiadeiro, J.L., Montanari, U., Wirsing, M. (Eds.), Abstracts Collection of the Dagstuhl Seminar 05081 on Foundations of Global Computing, Schloss Dagstuhl, Wadern, Germany.

[57]

d'Amorim, M. and Roşu, G., An equational specification for the scheme language. Journal of Universal Computer Science. v11 i7. 1327-1348.

[58]

Sasse, R. and Meseguer, J., Java + itp: A verification tool based on Hoare logic and algebraic semantics. Electronic Notes in Theoretical Computer Science. v176 i4. 29-46.

[59]

Katelman, M. and Meseguer, J., A rewriting semantics for Abel with applications to hardware/software co-design and analysis. Electronic Notes in Theoretical Computer Science. v176 i4. 47-60.

[60]

Hills, M., Şerb¿nu¿¿, T.F. and Roşu, G., A rewrite framework for language definitions and for generation of efficient interpreters. Electronic Notes in Theoretical Computer Science. v176 i4. 215-231.

[61]

Garrido, A., Meseguer, J. and Johnson, R., Algebraic semantics of the C preprocessor and correctness of its refactorings. February 2006. Department of Computer Science, University of Illinois at Urbana-Champaign.

[62]

Farzan, A., Static and dynamic formal analysis of concurrent systems and languages: A semantics-based approach. 2007. University of Illinois at Urbana-Champaign.

[63]

AlTurki, M. and Meseguer, J., Real-time rewriting semantics of Orc. In: Leuschel, M., Podelski, A. (Eds.), Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, ACM. pp. 131-142.

[64]

Meseguer, J., Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science. v96 i1. 73-155.

[65]

Bruni, R. and Meseguer, J., Semantic foundations for generalized rewrite theories. Theoretical Computer Science. v360 i1-3. 386-414.

[66]

Clavel, M., Durán, F., Eker, S., Meseguer, J., Lincoln, P., Martí-Oliet, N. and Talcott, C., All About Maude - A High-Performance Logical Framework. 2007. Lecture Notes in Computer Science, 2007.Springer.

[67]

Viry, P., Equational rules for rewriting logic. Theoretical Computer Science. v285. 487-517.

[68]

Meseguer, J., Futatsugi, K. and Winkler, T., Using rewriting logic to specify, program, integrate, and reuse open concurrent systems of cooperating agents. In: Proceedings of the 1992 International Symposium on New Models for Software Architecture, Research Institute of Software Engineering, Tokyo, Japan. pp. 61-106.

[69]

Martí-Oliet, N. and Meseguer, J., Rewriting logic as a logical and semantic framework. In: Gabbay, D.M., Guenthner, F. (Eds.), Handbook of Philosophical Logic, Second Edition, vol. 9, Kluwer Academic Publishers. pp. 1-87.

[70]

Verdejo, A. and Martí-Oliet, N., Two case studies of semantics execution in Maude: CCS and LOTOS. Formal Methods in System Design. v27 i1-2. 113-172.

[71]

Ölveczky, P.C. and Meseguer, J., Specification of real-time and hybrid systems in rewriting logic. Theoretical Computer Science. v285 i2. 359-405.

[72]

Ölveczky, P.C. and Meseguer, J., Semantics and pragmatics of Real-Time Maude. Higher-Order and Symbolic Computation. v20 i1-2. 161-196.

[73]

Agha, G., Meseguer, J. and Sen, K., PMaude: Rewrite-based specification language for probabilistic object systems. Electronic Notes in Theoretical Computer Science. v153 i2. 213-239.

[74]

Meseguer, J., A rewriting logic sampler. In: Lecture Notes in Computer Science, vol. 3722. Springer. pp. 1-28.

Digital Library

[75]

Meseguer, J. and Sharykin, R., Specification and analysis of distributed object-based stochastic hybrid systems. In: Lecture Notes in Computer Science, vol. 3927. Springer.

[76]

AlTurki, M. and Meseguer, J., PVeStA: A parallel statistical model-checking and quantitative analysis tool. In: Lecture Notes in Computer Science, vol. 6859. Springer. pp. 386-392.

Digital Library

[77]

Kim, M., Stehr, M.-O., Talcott, C.L., Dutt, N.D. and Venkatasubramanian, N., A probabilistic formal analysis approach to cross layer optimization in distributed embedded systems. In: Lecture Notes in Computer Science, vol. 4468. Springer. pp. 285-300.

Digital Library

[78]

Katelman, M., Meseguer, J. and Hou, J.C., Redesign of the LMST wireless sensor protocol through formal modeling and statistical model checking. In: Lecture Notes in Computer Science, vol. 5051. Springer. pp. 150-169.

Digital Library

[79]

Probabilistic modeling and analysis of DoS protection for the ASV protocol. Electronic Notes in Theoretical Computer Science. v234. 3-18.

[80]

Eckhardt, J., Mühlbauer, T., AlTurki, M., Meseguer, J. and Wirsing, M., Stable availability under denial of service attacks through formal patterns. In: de Lara, J., Zisman, A. (Eds.), Lecture Notes in Computer Science, vol. 7212. Springer. pp. 78-93.

[81]

Eker, J., Janneck, J.W., Lee, E.A., Liu, J., Liu, X., Ludvig, J., Neuendorffer, S., Sachs, S. and Xiong, Y., Taming heterogeneity-The Ptolemy approach. Proceedings of the IEEE. v91 i2. 127-144.

[82]

Roşu, G., Ellison, C. and Schulte, W., Matching logic: An alternative to Hoare/Floyd logic. In: Lecture Notes in Computer Science, vol. 6486. pp. 142-162.

[83]

Roşu, G. and Ştef¿nescu, A., Matching logic: A new program verification approach (NIER track). In: Proc. ICSE¿11, ACM.

[84]

Rosu, G. and Stefanescu, A., Towards a unified theory of operational and axiomatic semantics. In: Lecture Notes in Computer Science, vol. 7392. Springer. pp. 351-363.

Digital Library

[85]

Rosu, G. and Stefanescu, A., From Hoare logic to matching logic reachability. In: Lecture Notes in Computer Science, vol. 7436. Springer.

[86]

Rosu, G. and Stefanescu, A., Checking reachability using matching logic. In: Proc. OOPSLA¿12, ACM.

[87]

Braga, C., Haeusler, E.H., Meseguer, J. and Mosses, P.D., Mapping modular SOS to rewriting logic. In: Lecture Notes in Computer Science, vol. 2664. pp. 262-277.

[88]

http://www.ic.uff.br/~frosario/2o-workshop-vas-novembro-2004.pdf

[89]

Roşu, G. and Şerb¿nu¿¿, T.F., An overview of the K semantic framework. Journal of Logic and Algebraic Programming. v79 i6. 397-434.

[90]

Serbanuta, T.F. and Rosu, G., A truly concurrent semantics for the K framework based on graph transformations. In: Lecture Notes in Computer Science, vol. 7562. Springer.

[91]

Şerb¿nu¿¿, T.F., A rewriting approach to concurrent programming language design and semantics. December 2010. University of Illinois at Urbana-Champaign.

[92]

Roşu, G., CS322, Fall 2003 - Programming language design: Lecture notes. 2003. University of Illinois at Urbana-Champaign, Dept. of Computer Science.

[93]

Şerb¿nu¿¿, T.F. and Roşu, G., KRAM-Extended report. September 2010. UIUC.

[94]

Goguen, J.A. and Malcolm, G., Algebraic Semantics of Imperative Programs, Foundations of Computing. 1996. MIT Press.

[95]

Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R. and Löwe, M., Algebraic approaches to graph transformation: Basic concepts and double pushout approach. In: Handbook of Graph Grammars, vol. 1, World Sci. pp. 163-246.

[96]

Meseguer, J., Rewriting logic as a semantic framework for concurrency: A progress report. In: Lecture Notes in Computer Science, vol. 1119. Springer. pp. 331-372.

[97]

Ellison, C. and Roşu, G., An executable formal semantics of C with applications. In: Proceedings of the 39th Symposium on Principles of Programming Languages, ACM. pp. 533-544.

[98]

Meredith, P., Hills, M. and Roşu, G., A K definition of scheme. 2007. University of Illinois at Urbana-Champaign.

[99]

Gurevich, Y. and Huggins, J.K., The semantics of the C programming language. In: Lecture Notes in Computer Science, vol. 702. pp. 274-308.

[100]

Cook, J.V., Cohen, E.L. and Redmond, T.S., A formal denotational semantics for C. September 1994. Trusted Information Systems.

[101]

Cook, J.V. and Subramanian, S., A formal semantics for C in Nqthm. Nov. 1994. Trusted Information Systems.

[102]

Norrish, M., C formalised in HOL. December 1998. University of Cambridge.

[103]

Papaspyrou, N.S., Denotational semantics of ANSI C. Computer Standards and Interfaces. v23 i3. 169-185.

[104]

Blazy, S. and Leroy, X., Mechanized semantics for the Clight subset of the C language. Journal of Automated Reasoning. v43 i3. 263-288.

[105]

Papaspyrou, N.S., A formal semantics for the C programming language. February 1998. National Technical University of Athens.

[106]

AlTurki, M., Dhurjati, D., Yu, D., Chander, A. and Inamura, H., Formal specification and analysis of timing properties in software systems. In: Lecture Notes in Computer Science, vol. 5503. Springer. pp. 262-277.

Digital Library

[107]

Misra, J., Computation orchestration: A basis for wide-area computing. In: Broy, M. (Ed.), NATO Advanced Study Institutes Series,

[108]

Misra, J. and Cook, W.R., Computation orchestration. Software and System Modeling. v6 i1. 83-110.

[109]

Wehrman, I., Kitchin, D., Cook, W.R. and Misra, J., A timed semantics of Orc. Theoretical Computer Science. v402 i2-3. 234-248.

[110]

AlTurki, M. and Meseguer, J., Reduction semantics and formal analysis of Orc programs. Electronic Notes in Theoretical Computer Science. v200 i3. 25-41.

[111]

AlTurki, M. and Meseguer, J., Dist-Orc: A rewriting-based distributed implementation of Orc with formal analysis. In: Electronic Proceedings in Theoretical Computer Science, vol. 36. CoRR. pp. 26-45.

[112]

Bjørk, J., Johnsen, E.B., Owe, O. and Schlatte, R., Lightweight time modeling in timed Creol. In: Electronic Proceedings in Theoretical Computer Science, vol. 36. CoRR. pp. 67-81.

[113]

Bjørk, J., de Boer, F., Johnsen, E., Schlatte, R. and Tapia Tarifa, S., User-defined schedulers for real-time concurrent objects. Innovations in Systems and Software Engineering. v9 i1. 29-43.

[114]

Wirsing, M. and Knapp, A., A formal approach to object-oriented software engineering. Electronic Notes in Theoretical Computer Science. v4. 322-360.

[115]

Nakajima, S. and Futatsugi, K., An object-oriented modeling method for algebraic specifications in CafeOBJ. In: Proceedings of the 19th International Conference on Software Engineering, ACM Press.

[116]

Nakajima, S., Using algebraic specification techniques in development of object-oriented frameworks. In: Lecture Notes in Computer Science, vol. 1709. Springer. pp. 1664-1683.

[117]

Fernández Alemán, J.L. and Toval Álvarez, J.A., Can intuition become rigorous? Foundations for UML model verification tools. In: Proc. ISSRE¿00, IEEE. pp. 344-355.

[118]

Knapp, A., Generating rewrite theories from UML collaborations. In: Futatsugi, K., Nakagawa, A.T., Tamai, T. (Eds.), Cafe: An Industrial-Strength Algebraic Formal Method, Elsevier. pp. 97-120.

[119]

Knapp, A., A Formal Approach to Object-Oriented Software Engineering. 2001. Shaker Verlag, Aachen, Germany.

[120]

Wirsing, M. and Knapp, A., A formal approach to object-oriented software engineering. Theoretical Computer Science. v285 i2. 519-560.

[121]

Aoumeur, N. and Saake, G., Integrating and rapid-prototyping UML structural and behavioural diagrams using rewriting logic. In: Lecture Notes in Computer Science, vol. 2348. Springer. pp. 296-310.

Digital Library

[122]

Clavel, M. and Egea, M., ITP/OCL: A rewriting-based validation tool for UML + OCL static class diagrams. In: Lecture Notes in Computer Science, vol. 4019. Springer. pp. 368-373.

Digital Library

[123]

Mokhati, F., Gagnon, P. and Badri, M., Verifying UML diagrams with model checking: A rewriting logic based approach. In: Proc. QSIC¿07, IEEE. pp. 356-362.

[124]

Mokhati, F. and Badri, M., Generating Maude specifications from UML use case diagrams. Journal of Object Technology. v8 i2. 119-136.

[125]

Mokhati, F., Sahraoui, B., Bouzaher, S. and Kimour, M.T., A tool for specifying and validating agents¿ interaction protocols: From Agent UML to Maude. Journal of Object Technology. v9 i3. 59-77.

[126]

Boronat, A., Carsí, J.A. and Ramos, I., Automatic reengineering in MDA using rewriting logic as transformation engine. In: Proc. CSMR¿05, IEEE. pp. 228-231.

Digital Library

[127]

Boronat, A., MOMENT: A formal framework for MOdel ManageMENT. 2007. Universitat Politècnica de València, Spain.

[128]

Boronat, A., Heckel, R. and Meseguer, J., Rewriting logic semantics and verification of model transformations. In: Chechik, M., Wirsing, M. (Eds.), Lecture Notes in Computer Science, vol. 5503. Springer. pp. 18-33.

[129]

Boronat, A. and Meseguer, J., MOMENT2: EMF model transformations in Maude. In: Vallecillo, A., Sagardui, G. (Eds.), Actas de las XIV Jornadas de Ingeniería del Software y Bases de Datos, pp. 178-179.

[130]

Boronat, A. and Meseguer, J., An algebraic semantics for MOF. Formal Aspects of Computing. v22 i3-4. 269-296.

[131]

Membership algebra as a logical framework for equational specification. In: Parisi-Presicce, F. (Ed.), Lecture Notes in Computer Science, vol. 1376. Springer. pp. 18-61.

[132]

Boronat, A. and Meseguer, J., Algebraic semantics of OCL-constrained metamodel specifications. In: Lecture Notes in Business Information, vol. 33. Springer. pp. 96-115.

[133]

Boronat, A. and Ölveczky, P.C., Formal real-time model transformations in MOMENT2. In: Lecture Notes in Computer Science, vol. 6013. Springer. pp. 29-43.

[134]

Lee, E.A., Modeling concurrent real-time processes using discrete events. Annals of Software Engineering. v7. 25-45.

[135]

Bae, K., Ölveczky, P.C., Feng, T.H. and Tripakis, S., Verifying Ptolemy II discrete-event models using Real-Time Maude. In: Lecture Notes in Computer Science, vol. 5885. Springer. pp. 717-736.

Digital Library

[136]

Bae, K. and Ölveczky, P.C., Extending the Real-Time Maude semantics of Ptolemy to hierarchical DE models. In: Electronic Proceedings in Theoretical Computer Science, vol. 36. CoRR. pp. 46-66.

[137]

Ölveczky, P.C., Boronat, A. and Meseguer, J., Formal semantics and analysis of behavioral AADL models in Real-Time Maude. In: Lecture Notes in Computer Science, vol. 6117. Springer. pp. 47-62.

Digital Library

[138]

Meseguer, J. and Ölveczky, P.C., Formalization and correctness of the PALS architectural pattern for real-time systems. In: Lecture Notes in Computer Science, vol. 6447. Springer. pp. 303-320.

Digital Library

[139]

Bae, K., Ölveczky, P.C., Al-Nayeem, A. and Meseguer, J., Synchronous AADL and its formal analysis in Real-Time Maude. 2005. University of Illinois at Urbana-Champaign.

[140]

Rivera, J.E., Durán, F. and Vallecillo, A., On the behavioral semantics of real-time domain specific visual languages. In: Lecture Notes in Computer Science, vol. 6381. Springer. pp. 174-190.

Digital Library

[141]

Bae, K., Ölveczky, P.C., Feng, T.H., Lee, E.A. and Tripakis, S., Verifying hierarchical Ptolemy II discrete-event models using Real-Time Maude. Science of Computer Programming. v77 i12. 1235-1271.

[142]

Bae, K., Ölveczky, P.C., Al-Nayeem, A. and Meseguer, J., Synchronous AADL and its formal analysis in Real-Time Maude. In: Qin, S., Qiu, Z. (Eds.), Lecture Notes in Computer Science, vol. 6991. Springer. pp. 651-667.

[143]

Ölveczky, P.C., Semantics, simulation, and formal analysis of modeling languages for embedded systems in Real-Time Maude. In: Agha, G., Danvy, O., Meseguer, J. (Eds.), Lecture Notes in Computer Science, vol. 7000. Springer. pp. 368-402.

[144]

Miller, S., Cofer, D., Sha, L., Meseguer, J. and Al-Nayeem, A., Implementing logical synchrony in integrated modular avionics. In: Proc. 28th Digital Avionics Systems Conference, IEEE.

[145]

Bae, K., Ölveczky, P.C., Al-Nayeem, A. and Meseguer, J., Synchronous AADL and its formal analysis in Real-Time Maude. 2011. Department of Computer Science, University of Illinois at Urbana-Champaign.

[146]

Katelman, M., Meseguer, J. and Escobar, S., Directed-logical testing for functional verification of microprocessors. In: MEMOCODE¿08, IEEE. pp. 89-100.

[147]

Katelman, M. and Meseguer, J., vlogsl: A strategy language for simulation-based verification of hardware. In: Barner, S., Harris, I., Kroening, D., Raz, O. (Eds.), Lecture Notes in Computer Science, vol. 6504. Springer, Berlin/Heidelberg. pp. 129-145.

[148]

Katelman, M.K., A meta-language for functional verification. 2011. Department of Computer Science, University of Illinois at Urbana-Champaign.

[149]

Meredith, P., Katelman, M., Meseguer, J. and Roşu, G., A formal executable semantics of Verilog. In: Proc. MEMOCODE¿10, IEEE. pp. 179-188.

[150]

Katelman, M., Keller, S. and Meseguer, J., Concurrent rewriting semantics and analysis of asynchronous digital circuits. In: Lecture Notes in Computer Science, vol. 6381. Springer. pp. 140-156.

[151]

Hills, M., Chen, F. and Roşu, G., Pluggable Policies for C. 2008. University of Illinois at Urbana-Champaign.

[152]

Ellison, C., Şerb¿nu¿¿, T.F. and Roşu, G., A rewriting logic approach to type inference. In: Lecture Notes in Computer Science, vol. 5486. Springer. pp. 135-151.

Digital Library

[153]

Alba-Castro, M., Alpuente, M. and Escobar, S., Abstract certification of global non-interference in rewriting logic. In: Lecture Notes in Computer Science, vol. 6286. Springer. pp. 105-124.

Digital Library

[154]

Alba-Castro, M., Alpuente, M. and Escobar, S., Approximating non-interference and erasure in rewriting logic. In: Proc. SYNASC, IEEE. pp. 124-132.

Digital Library

[155]

Goguen, J. and Meseguer, J., Security policies and security models. In: Proceedings of the 1982 Symposium on Security and Privacy, IEEE. pp. 11-20.

[156]

Schorr, H. and Waite, W.M., An efficient machine-independent procedure for garbage collection in various list structures. Communications of the ACM. v10 i8. 501-506.

[157]

Hubert, T. and Marché, C., A case study of C source code verification: The Schorr-Waite algorithm. In: SEFM, pp. 190-199.

Digital Library

[158]

Loginov, A., Reps, T.W. and Sagiv, M., Automated verification of the Deutsch-Schorr-Waite tree-traversal algorithm. In: SAS,

Cited By

de Boer FJohnsen EPun VTapia Tarifa S(2024)Proving Correctness of Parallel Implementations of Transition System ModelsACM Transactions on Programming Languages and Systems10.1145/366063046:3(1-50)Online publication date: 20-Apr-2024
https://dl.acm.org/doi/10.1145/3660630
Bae KÖlveczky P(2023)Formal Model Engineering of Distributed CPSs Using AADL: From Behavioral AADL Models to Multirate Hybrid Synchronous AADLFormal Aspects of Component Software10.1007/978-3-031-52183-6_7(127-152)Online publication date: 26-Oct-2023
https://dl.acm.org/doi/10.1007/978-3-031-52183-6_7
Ölveczky P(2022)Teaching Formal Methods to Undergraduate Students Using MaudeRewriting Logic and Its Applications10.1007/978-3-031-12441-9_5(85-110)Online publication date: 2-Apr-2022
https://dl.acm.org/doi/10.1007/978-3-031-12441-9_5
Show More Cited By

The rewriting logic semantics project: A progress report
1. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
2. Theory of computation
  1. Formal languages and automata theory
    1. Formalisms
  2. Semantics and reasoning
    1. Program reasoning

Recommendations

Real-time rewriting semantics of orc
PPDP '07: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming

Orc is a language proposed by Jayadev Misra [19] for orchestration of distributed services. Orc is very simple and elegant, based on a few basic constructs, and allows succinct and understandable programming of sophisticated applications. However, ...
Two case studies of semantics execution in Maude: CCS and LOTOS

We explore the features of rewriting logic and, in particular, of the rewriting logic language Maude as a logical and semantic framework for representing and executing inference systems. In order to illustrate the general ideas we consider two ...
A Rewriting Logic Approach to Operational Semantics (Extended Abstract)

This paper shows how rewriting logic semantics (RLS) can be used as a computational logic framework for operational semantic definitions of programming languages. Several operational semantics styles are addressed: big-step and small-step structural ...

Comments

Information & Contributors

Information

Published In

cover image Information and Computation

Information and Computation Volume 231, Issue

October, 2013

230 pages

ISSN:0890-5401

Issue’s Table of Contents

Copyright © © 2013.

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 October 2013

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

de Boer FJohnsen EPun VTapia Tarifa S(2024)Proving Correctness of Parallel Implementations of Transition System ModelsACM Transactions on Programming Languages and Systems10.1145/366063046:3(1-50)Online publication date: 20-Apr-2024
https://dl.acm.org/doi/10.1145/3660630
Bae KÖlveczky P(2023)Formal Model Engineering of Distributed CPSs Using AADL: From Behavioral AADL Models to Multirate Hybrid Synchronous AADLFormal Aspects of Component Software10.1007/978-3-031-52183-6_7(127-152)Online publication date: 26-Oct-2023
https://dl.acm.org/doi/10.1007/978-3-031-52183-6_7
Ölveczky P(2022)Teaching Formal Methods to Undergraduate Students Using MaudeRewriting Logic and Its Applications10.1007/978-3-031-12441-9_5(85-110)Online publication date: 2-Apr-2022
https://dl.acm.org/doi/10.1007/978-3-031-12441-9_5
Awar NJain KRossbach CGligoric M(2021)Programming and execution models for parallel bounded exhaustive testingProceedings of the ACM on Programming Languages10.1145/34855435:OOPSLA(1-28)Online publication date: 15-Oct-2021
https://dl.acm.org/doi/10.1145/3485543
Asă?Voae IAsă?Voae MRiesco A(2018)Slicing from formal semanticsInternational Journal on Software Tools for Technology Transfer (STTT)10.5555/3288063.328808120:6(739-769)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.5555/3288063.3288081
Tahara YOhsuga AHoniden SGarlan DNuseibeh B(2017)Formal verification of dynamic evolution processes of UML models using aspectsProceedings of the 12th International Symposium on Software Engineering for Adaptive and Self-Managing Systems10.1109/SEAMS.2017.4(152-162)Online publication date: 20-May-2017
https://dl.acm.org/doi/10.1109/SEAMS.2017.4
Alturki M(2017)A Symbolic Rewriting Semantics of the COMPASS Modeling Language2017 IEEE International Conference on Information Reuse and Integration (IRI)10.1109/IRI.2017.62(283-290)Online publication date: 4-Aug-2017
https://dl.acm.org/doi/10.1109/IRI.2017.62
Bekki KBelbachir HKasri W(2015)A K-BPEL SemanticsProceedings of the International Conference on Intelligent Information Processing, Security and Advanced Communication10.1145/2816839.2816889(1-5)Online publication date: 23-Nov-2015
https://dl.acm.org/doi/10.1145/2816839.2816889

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents