A rewriting logic approach to operational semantics
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 operational semantics (SOS), modular SOS, reductio...
Gespeichert in:
| Veröffentlicht in: | Information and computation Jg. 207; H. 2; S. 305 - 340 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier Inc
01.02.2009
|
| Schlagworte: | |
| ISSN: | 0890-5401, 1090-2651 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| 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 operational semantics (SOS), modular SOS, reduction semantics with evaluation contexts, continuation-based semantics, and the chemical abstract machine. Each of these language definitional styles can be
faithfully captured as an RLS theory, in the sense that there is a one-to-one correspondence between computational steps in the original language definition and computational steps in the corresponding RLS theory. A major goal of this paper is to show that RLS does not force or pre-impose any given language definitional style, and that its flexibility and ease of use makes RLS an appealing framework for exploring new definitional styles. |
|---|---|
| AbstractList | 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 operational semantics (SOS), modular SOS, reduction semantics with evaluation contexts, continuation-based semantics, and the chemical abstract machine. Each of these language definitional styles can be
faithfully captured as an RLS theory, in the sense that there is a one-to-one correspondence between computational steps in the original language definition and computational steps in the corresponding RLS theory. A major goal of this paper is to show that RLS does not force or pre-impose any given language definitional style, and that its flexibility and ease of use makes RLS an appealing framework for exploring new definitional styles. |
| Author | Roşu, Grigore Şerbănuţă, Traian Florin Meseguer, José |
| Author_xml | – sequence: 1 givenname: Traian Florin surname: Şerbănuţă fullname: Şerbănuţă, Traian Florin email: tserban2@cs.uiuc.edu organization: Department of Computer Science, University of Illinois at Urbana-Champaign, USA – sequence: 2 givenname: Grigore surname: Roşu fullname: Roşu, Grigore email: grosu@cs.uiuc.edu organization: Department of Computer Science, University of Illinois at Urbana-Champaign, USA – sequence: 3 givenname: José surname: Meseguer fullname: Meseguer, José email: meseguer@cs.uiuc.edu organization: Department of Computer Science, University of Illinois at Urbana-Champaign, USA |
| BookMark | eNp9z99LwzAQwPEgE9ym7z72H2i9JM2t9W0Mf8HAF30OaXqdGV1TkqD439s5nwR9uuPgc_BdsNngB2LsmkPBgePNvnC2EABVAbIAgWdszqGGXKDiMzaHatpVCfyCLWLcA3CuSpwzuc4CfQSX3LDLer9zNjPjGLyxb1nymR8pmOT8YPos0sEMydl4yc4700e6-plL9np_97J5zLfPD0-b9Ta3oi5TbmshOlSGK0VSia4zEhvAlipbQgulqRE7UXHTKFGCkg1iJXE13QxS06zkksHprw0-xkCdHoM7mPCpOehjtN5rZ_UxWoPUU_RE8BexLn0HpGBc_x-8PUGagt4dBR2to8FS6wLZpFvv_sZfWa5xjw |
| CitedBy_id | crossref_primary_10_1145_3660630 crossref_primary_10_1007_s00165_009_0140_9 crossref_primary_10_1007_s12652_010_0016_0 crossref_primary_10_1016_j_cl_2015_08_004 crossref_primary_10_1016_j_scico_2014_11_016 crossref_primary_10_1016_j_jlamp_2019_100497 crossref_primary_10_1016_j_jlamp_2025_101056 crossref_primary_10_1016_j_jlap_2010_03_012 crossref_primary_10_1016_j_jlamp_2015_03_003 crossref_primary_10_1016_j_jsc_2016_07_012 crossref_primary_10_1007_s00165_016_0361_7 crossref_primary_10_1016_j_ic_2013_08_004 crossref_primary_10_1016_j_entcs_2020_09_005 crossref_primary_10_1016_j_entcs_2014_05_005 crossref_primary_10_1016_j_scico_2022_102859 crossref_primary_10_1145_2994595 crossref_primary_10_1016_j_entcs_2014_05_002 crossref_primary_10_1016_j_jlap_2012_06_003 crossref_primary_10_1007_s12652_012_0159_2 |
| Cites_doi | 10.1016/j.entcs.2007.06.007 10.1145/9758.10501 10.1016/j.entcs.2007.06.012 10.1007/3-540-44881-0_15 10.1016/S0304-3975(01)00357-7 10.1016/S1571-0661(05)82538-1 10.1007/11591191_29 10.1016/S0304-3975(01)00358-9 10.1016/0304-3975(92)90185-I 10.1017/S0956796800001945 10.1007/11560647_1 10.1007/978-3-540-27815-3_14 10.1016/j.tcs.2006.04.012 10.1145/138027.138060 10.1016/S1571-0661(05)82539-3 10.1145/567097.567099 10.1145/199448.199528 10.1016/j.entcs.2004.06.015 10.1016/S1571-0661(05)80125-2 10.1016/j.entcs.2007.06.008 10.1016/j.tcs.2006.12.018 10.1016/j.entcs.2005.10.040 10.1016/S1571-0661(04)00032-5 10.1007/BF01019462 10.1142/3831 10.1007/11814771_3 10.1016/S0304-3975(01)00359-0 10.1016/j.jlap.2005.09.008 10.1016/S1571-0661(05)82540-X 10.1017/S0960129500001407 10.1007/3-540-45719-4_3 10.1007/978-3-540-27813-9_46 10.1007/978-3-540-25984-8_1 10.1007/BFb0028970 10.1145/143165.143169 10.1007/3-540-61604-7_64 10.1016/j.entcs.2007.06.017 10.1145/64137.65005 10.1006/inco.1994.1093 10.1016/0304-3975(92)90182-F 10.1016/j.entcs.2006.03.017 10.21236/ADA484494 10.1016/j.entcs.2007.06.006 10.1016/j.entcs.2004.06.012 10.1007/BFb0039592 10.1016/j.entcs.2004.06.023 10.1145/96709.96712 10.1016/j.entcs.2004.06.019 10.1007/BF00286491 10.1007/BF01019459 10.1007/978-94-017-0464-9_1 10.1145/1273920.1273938 10.1007/3-540-10699-5_106 10.1145/53990.54010 10.1007/978-3-540-27815-3_29 10.1016/0167-6423(90)90044-E 10.1016/j.jlap.2004.03.008 10.1016/S0304-3975(01)00366-8 10.7146/brics.v11i26.21851 10.1016/j.jlap.2004.05.001 |
| ContentType | Journal Article |
| Copyright | 2009 |
| Copyright_xml | – notice: 2009 |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.ic.2008.03.026 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1090-2651 |
| EndPage | 340 |
| ExternalDocumentID | 10_1016_j_ic_2008_03_026 S0890540108001302 |
| GroupedDBID | --K --M --Z -~X .~1 0R~ 1B1 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 6I. 6TJ 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABAOU ABBOA ABFNM ABJNI ABMAC ABTAH ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADMUD AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CAG COF CS3 DM4 DU5 E3Z EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HVGLF HZ~ H~9 IHE IXB J1W KOM LG5 LX9 M41 MHUIS MO0 MVM N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG RNS ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SSV SSW SSZ T5K TN5 WH7 WUQ XJT XPP ZMT ZU3 ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c294t-c922f65a155e352ffa36b06de8c40d04a966f281ab524053b6683676f2a6ebb73 |
| ISICitedReferencesCount | 43 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000264109400011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0890-5401 |
| IngestDate | Sat Nov 29 01:56:31 EST 2025 Tue Nov 18 21:46:36 EST 2025 Fri Feb 23 02:25:03 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Operational semantics Rewriting logic Rewriting logic semantics |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c294t-c922f65a155e352ffa36b06de8c40d04a966f281ab524053b6683676f2a6ebb73 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.ic.2008.03.026 |
| PageCount | 36 |
| ParticipantIDs | crossref_primary_10_1016_j_ic_2008_03_026 crossref_citationtrail_10_1016_j_ic_2008_03_026 elsevier_sciencedirect_doi_10_1016_j_ic_2008_03_026 |
| PublicationCentury | 2000 |
| PublicationDate | 2009-02-01 |
| PublicationDateYYYYMMDD | 2009-02-01 |
| PublicationDate_xml | – month: 02 year: 2009 text: 2009-02-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationTitle | Information and computation |
| PublicationYear | 2009 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Mosses (bib65) 2004; 60–61 Goguen, Malcolm (bib37) 1996 Milner (bib59) 1992; 2 R. Sasse, Taclets vs. Rewriting Logic—Relating Semantics of Java, Master’s thesis, Fakultät für Informatik, Universität Karlsruhe, Germany, May 2005, Technical Report in Computing Science No. 2005-16. P. Borovanský, H. Cirstea, H. Dubois, C. Kirchner, H. Kirchner, P.-E. Moreau, C. Ringeissen, M. Vittek, ELAN V 3.4 User Manual, LORIA, Nancy (France), fourth ed., January 2000. ITP: a verification tool based on algebraic semantics, in: PROLE 2005: V Jornadas sobre Programacin y Lenguajes, Thomson, 2005, pp. 149–158. Friedman, Wand, Haynes (bib35) 2001 Kaufmann, Manolios, Moore (bib46) 2000 M.-O. Stehr, C.L. Talcott, Practical techniques for language design and prototyping, in: J.L. Fiadeiro, U. Montanari, M. Wirsing (Eds.), Abstracts Collection of the Dagstuhl Seminar 05081 on Foundations of Global Computing, February 20–25, 2005, Schloss Dagstuhl, Wadern, Germany, 2005. G. Kahn, Natural semantics, in: F.-J. Brandenburg, G. Vidal-Naquet, M. Wirsing (Eds.), STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Germany, February 19–21, 1987, Proceedings, Lecture Notes in Computer Science, vol. 247, Springer, 1987, pp. 22–39. A. Farzan, J. Meseguer, Partial order reduction for rewriting semantics of programming languages, in: G. Denker, C. Talcott (Eds.), Proceedings of the Sixth International Workshop on Rewriting Logic and its Applications (WRLA 2006), Electronic Notes in Theoretical Computer Science, vol. 176, No. 4, Elsevier, 2007, pp. 61–78. van Deursen, Heering, Klint (bib88) 1996 Benaissa, Briaud, Lescanne, Rouyer-Degli (bib7) 1996; 6 Berry, Boudol (bib8) 1992; 96 E. Visser, Program transformation with Stratego/XT: rules, strategies, tools, and systems in Stratego/XT 0.9, in: C. Lengauer, D.S. Batory, C. Consel, M. Odersky (Eds.), Domain-Specific Program Generation, International Seminar, Dagstuhl Castle, Germany, March 23–28, 2003, Revised Papers, Lecture Notes in Computer Science, vol. 3016, Springer, 2003, pp. 216–238. C. Braga, Rewriting Logic as a Semantic Framework for Modular Structural Operational Semantics, Ph.D. thesis, Departamento de Informática, Pontificia Universidade Católica de Rio de Janeiro, Brasil, 2001. D. Miller, Representing and reasoning with operational semantics, in: U. Furbach, N. Shankar (Eds.), Automated Reasoning, Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17–20, 2006, Proceedings, Lecture Notes in Computer Science, vol. 4130, Springer, 2006, pp. 4–20. Harper, Honsell, Plotkin (bib41) 1993; 40 Reynolds (bib71) 1993; 6 J.A. Goguen, K. Parsaye-Ghomi, Algebraic denotational semantics using parameterized abstract modules, in: J. Díaz, I. Ramos (Eds.), Formalization of Programming Concepts, International Colloquium, Peniscola, Spain, April 19–25, 1981, Proceedings, Lecture Notes in Computer Science, vol. 107, Springer, 1981, pp. 292–309. F. Chen, G. Roşu, Rewriting Logic Semantics of Java 1.4, 2004. Available from Verdejo, Martí-Oliet (bib91) 2006; 67 G.D. Plotkin, A structural approach to operational semantics, Journal of Logic and Algebraic Programming 60–61 (2004) 17–139, Original version: University of Aarhus Technical Report DAIMI FN-19, 1981. D. Scott, C. Strachey, Toward a mathematical semantics for computer languages, in: Microwave Research Institute Symposia Series, Proceedings of the Symposium on Computers and Automata, vol. 21, Polytechnical Institute of Brooklyn, 1971. F. Chalub, C. Braga, Maude MSOS tool, in: G. Denker, C. Talcott (Eds.), Proceedings of the Sixth International Workshop on Rewriting Logic and its Applications (WRLA 2006), Electronic Notes in Theoretical Computer Science, vol. 176, No. 4, Elsevier, 2007, pp. 133–146. + , . N. Martí-Oliet, J. Meseguer, Rewriting logic as a logical and semantic framework, in: D. Gabbay, F. Guenthner (Eds.), Handbook of Philosophical Logic, second ed., Kluwer Academic Publishers, 2002, pp. 1–87, First published as SRI Technical Report SRI-CSL-93-05, August 1993. J. Meseguer, C. Braga, Modular rewriting semantics of programming languages, in: C. Rattray, S. Maharaj, C. Shankland (Eds.), Algebraic Methodology and Software Technology, 10th International Conference, AMAST 2004, Stirling, Scotland, UK, July 12–16, 2004, Proceedings, Lecture Notes in Computer Science, vol. 3116, Springer, 2004, pp. 364–378. F. Pfenning, C. Elliott, Higher-order abstract syntax, in: PLDI ’88: Proceedings of the ACM SIGPLAN 1988 Conference on Programming Language Design and Implementation, ACM Press, New York, NY, USA, 1988, pp. 199–208. M. Clavel, F. Durán, S. Eker, J. Meseguer, P. Lincoln, N. Martí-Oliet, C. Talcott, All about Maude, A High-Performance Logical Framework, Lecture Notes in Computer Science, vol. 4350, Springer, 2007. M. Clavel, J. Santa-Cruz, ASIP J. Meseguer, Rewriting logic as a semantic framework for concurrency: a progress report, in: U. Montanari, V. Sassone (Eds.), CONCUR ’96, Concurrency Theory, 7th International Conference, Pisa, Italy, August 26–29, 1996, Proceedings, Lecture Notes in Computer Science, vol. 1119, Springer, 1996, pp. 331–372. J. Meseguer, G. Rosu, Rewriting logic semantics: from language specifications to formal analysis tools, in: D.A. Basin, M. Rusinowitch (Eds.), Automated Reasoning—Second International Joint Conference, IJCAR 2004, Cork, Ireland, July 4–8, 2004, Proceedings, Lecture Notes in Computer Science, vol. 3097, Springer, 2004, pp. 1–44. A. Verdejo, N. Martí-Oliet, Implementing CCS in Maude 2, in: F. Gadducci, U. Montanari (Eds.), Proceedings of the Forth International Workshop on Rewriting Logic and its Applications (WRLA 2002), Electronic Notes in Theoretical Computer Science, vol. 71, Elsevier, 2002. A. Garrido, J. Meseguer, R. Johnson, Algebraic Semantics of the C Preprocessor and Correctness of its Refactorings, Technical Report UIUCDCS-R-2006-2688, Department of Computer Science, University of Illinois at Urbana-Champaign, February 2006. P. Borras, D. Clément, T. Despeyroux, J. Incerpi, G. Kahn, B. Lang, V. Pascual, CENTAUR: the system, in: Software Development Environments (SDE), 1988, pp. 14–24. Wand (bib95) 1980; 14 M. Felleisen, D.P. Friedman, Control operators, the SECD-machine, and the lambda-calculus, in: 3rd Working Conference on the Formal Description of Programming Concepts, Ebberup, Denmark, August 1986, pp. 193–219. P.D. Mosses, Pragmatics of modular SOS, in: H. Kirchner, C. Ringeissen (Eds.), Algebraic Methodology and Software Technology, 9th International Conference, AMAST 2002, Saint-Gilles-les-Bains, Reunion Island, France, September 9–13, 2002, Proceedings, Lecture Notes in Computer Science, vol. 2422, Springer, 2002, pp. 21–40. Schmidt (bib77) 1986 F. Chalub, An Implementation of Modular SOS in Maude, Master’s thesis, Universidade Federal Fluminense, May 2005. Available from J. Meseguer, Membership algebra as a logical framework for equational specification, in: F. Parisi-Presicce (Ed.), Recent Trends in Algebraic Development Techniques, 12th International Workshop, WADT’97, Tarquinia, Italy, June 1997, Selected Papers, Lecture Notes in Computer Science, vol. 1376, Springer, 1997, pp. 18–61. Mosses (bib63) 1990; vol. B M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Lévy, Explicit substitutions, in: POPL ’90: Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM Press, New York, NY, USA, 1990, pp. 31–46. Borovanský, Kirchner, Kirchner, Moreau (bib10) 2002; 285 Bruni, Meseguer (bib15) 2006; 360 O. Danvy, L.R. Nielsen. Refocusing in reduction semantics, RS RS-04-26, BRICS, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, November 2004, This report supersedes BRICS report RS-02-04, A preliminary version appears in the informal proceedings of the Second International Workshop on Rule-Based Programming, RULE 2001, Electronic Notes in Theoretical Computer Science, vol. 59.4. Slonneger, Kurtz (bib80) 1995 I. Cervesato, M.-O. Stehr, Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types, in: P. Degano (Ed.), Proceedings of the Fifth International Workshop on Rewriting Logic and its Applications (WRLA 2004), Electronic Notes in Theoretical Computer Science, vol. 117, Elsevier, 2005, pp. 183–207. F. Chen, G. Rosu, R.P. Venkatesan, Rule-based analysis of dimensional safety, in: R. Nieuwenhuis (Ed.), Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9–11, 2003, Proceedings, Lecture Notes in Computer Science, vol. 2706, Springer, 2003, pp. 197–207. G. Roşu, K: a Rewrite-based Framework for Modular Language Design, Semantics, Analysis and Implementation, Technical Report UIUCDCS-R-2005-2672, Department of Computer Science, University of Illinois at Urbana-Champaign, 2005, K was first introduced in 2003, in the technical report UIUCDCS-R-2003-2897: lecture notes of CS322 (programming language design). M. d’Amorim, G. Rosu, An equational specification for the Scheme language, The Journal of Universal Computer Science, 11 (7) (2005) 1327–1348, Selected papers from the 9th Brazilian Symposium on Programming Languages (SBLP’05), Also Technical Report No. UIUCDCS-R-2005-2567, April 2005. Sabry, Felleisen (bib74) 1993; 6 G. Nadathur, D. Miller, An overview of Lambda-PROLOG, in: K.A.B. Robert, A. Kowalski (Eds.), Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, August 15–19, 1988, Proceedings, MIT Press, 1988, pp. 810–827. E. Moggi, An Abstract View of Programming Languages, Technical Report ECS-LFCS-90-113, Edinburgh University, Department of Computer Science, June 1989. M.-O. Stehr, C.L. Talcott, Plan in Maude: specifying an active network programming language, in: F. Gadducci, U. Montanari (Eds.), Proceedings of the Forth International Workshop on Rewriting Logic and its Applications (WRLA 2002), Electronic Notes in Theoretical Computer Science, vol. 71, Elsevier, 2002, pp. 240–260 10.1016/j.ic.2008.03.026_bib3 10.1016/j.ic.2008.03.026_bib26 10.1016/j.ic.2008.03.026_bib4 10.1016/j.ic.2008.03.026_bib25 10.1016/j.ic.2008.03.026_bib1 10.1016/j.ic.2008.03.026_bib28 10.1016/j.ic.2008.03.026_bib2 10.1016/j.ic.2008.03.026_bib27 10.1016/j.ic.2008.03.026_bib21 10.1016/j.ic.2008.03.026_bib5 10.1016/j.ic.2008.03.026_bib24 10.1016/j.ic.2008.03.026_bib23 10.1016/j.ic.2008.03.026_bib20 Harper (10.1016/j.ic.2008.03.026_bib41) 1993; 40 van den Brand (10.1016/j.ic.2008.03.026_bib87) 2002; 24 10.1016/j.ic.2008.03.026_bib19 Kaufmann (10.1016/j.ic.2008.03.026_bib46) 2000 Sabry (10.1016/j.ic.2008.03.026_bib74) 1993; 6 Friedman (10.1016/j.ic.2008.03.026_bib35) 2001 Milner (10.1016/j.ic.2008.03.026_bib60) 1997 10.1016/j.ic.2008.03.026_bib17 10.1016/j.ic.2008.03.026_bib16 10.1016/j.ic.2008.03.026_bib11 Schmidt (10.1016/j.ic.2008.03.026_bib77) 1986 10.1016/j.ic.2008.03.026_bib13 10.1016/j.ic.2008.03.026_bib12 Borovanský (10.1016/j.ic.2008.03.026_bib10) 2002; 285 10.1016/j.ic.2008.03.026_bib94 10.1016/j.ic.2008.03.026_bib97 10.1016/j.ic.2008.03.026_bib90 10.1016/j.ic.2008.03.026_bib93 Benaissa (10.1016/j.ic.2008.03.026_bib7) 1996; 6 Banâtre (10.1016/j.ic.2008.03.026_bib6) 1990; 15 Martí-Oliet (10.1016/j.ic.2008.03.026_bib49) 2002; 285 10.1016/j.ic.2008.03.026_bib9 Wand (10.1016/j.ic.2008.03.026_bib95) 1980; 14 10.1016/j.ic.2008.03.026_bib48 10.1016/j.ic.2008.03.026_bib47 10.1016/j.ic.2008.03.026_bib44 Gurevich (10.1016/j.ic.2008.03.026_bib40) 1994 10.1016/j.ic.2008.03.026_bib43 10.1016/j.ic.2008.03.026_bib45 10.1016/j.ic.2008.03.026_bib42 Verdejo (10.1016/j.ic.2008.03.026_bib91) 2006; 67 van Deursen (10.1016/j.ic.2008.03.026_bib88) 1996 10.1016/j.ic.2008.03.026_bib36 10.1016/j.ic.2008.03.026_bib39 10.1016/j.ic.2008.03.026_bib38 10.1016/j.ic.2008.03.026_bib33 10.1016/j.ic.2008.03.026_bib32 10.1016/j.ic.2008.03.026_bib34 Bruni (10.1016/j.ic.2008.03.026_bib15) 2006; 360 Mosses (10.1016/j.ic.2008.03.026_bib63) 1990; vol. B 10.1016/j.ic.2008.03.026_bib31 10.1016/j.ic.2008.03.026_bib30 Milner (10.1016/j.ic.2008.03.026_bib59) 1992; 2 Pierce (10.1016/j.ic.2008.03.026_bib69) 2002 Viry (10.1016/j.ic.2008.03.026_bib92) 2002; 285 10.1016/j.ic.2008.03.026_bib29 10.1016/j.ic.2008.03.026_bib66 10.1016/j.ic.2008.03.026_bib68 10.1016/j.ic.2008.03.026_bib67 10.1016/j.ic.2008.03.026_bib62 10.1016/j.ic.2008.03.026_bib61 10.1016/j.ic.2008.03.026_bib64 Clavel (10.1016/j.ic.2008.03.026_bib22) 2002; 285 Reynolds (10.1016/j.ic.2008.03.026_bib71) 1993; 6 10.1016/j.ic.2008.03.026_bib58 Wright (10.1016/j.ic.2008.03.026_bib96) 1994; 115 10.1016/j.ic.2008.03.026_bib55 10.1016/j.ic.2008.03.026_bib54 10.1016/j.ic.2008.03.026_bib56 10.1016/j.ic.2008.03.026_bib51 10.1016/j.ic.2008.03.026_bib53 10.1016/j.ic.2008.03.026_bib52 Berry (10.1016/j.ic.2008.03.026_bib8) 1992; 96 Mosses (10.1016/j.ic.2008.03.026_bib65) 2004; 60–61 Meseguer (10.1016/j.ic.2008.03.026_bib50) 1992; 96 Stärk (10.1016/j.ic.2008.03.026_bib81) 2001 Slonneger (10.1016/j.ic.2008.03.026_bib80) 1995 10.1016/j.ic.2008.03.026_bib89 10.1016/j.ic.2008.03.026_bib84 10.1016/j.ic.2008.03.026_bib83 10.1016/j.ic.2008.03.026_bib86 10.1016/j.ic.2008.03.026_bib85 Goguen (10.1016/j.ic.2008.03.026_bib37) 1996 10.1016/j.ic.2008.03.026_bib82 10.1016/j.ic.2008.03.026_bib76 10.1016/j.ic.2008.03.026_bib79 10.1016/j.ic.2008.03.026_bib78 10.1016/j.ic.2008.03.026_bib73 10.1016/j.ic.2008.03.026_bib72 10.1016/j.ic.2008.03.026_bib75 10.1016/j.ic.2008.03.026_bib70 Chalub (10.1016/j.ic.2008.03.026_bib18) 2004; 10 Broy (10.1016/j.ic.2008.03.026_bib14) 1987; 9 Meseguer (10.1016/j.ic.2008.03.026_bib57) 2007; 373 |
| References_xml | – reference: J. Meseguer, A rewriting logic sampler, in: D.V. Hung, M. Wirsing (Eds.), Theoretical Aspects of Computing—ICTAC 2005, Second International Colloquium, Hanoi, Vietnam, October 17–21, 2005, Proceedings, Lecture Notes in Computer Science, vol. 3722, Springer, 2005, pp. 1–28. – reference: M.-O. Stehr, C.L. Talcott, Plan in Maude: specifying an active network programming language, in: F. Gadducci, U. Montanari (Eds.), Proceedings of the Forth International Workshop on Rewriting Logic and its Applications (WRLA 2002), Electronic Notes in Theoretical Computer Science, vol. 71, Elsevier, 2002, pp. 240–260. – reference: J. Meseguer, G. Rosu, Rewriting logic semantics: from language specifications to formal analysis tools, in: D.A. Basin, M. Rusinowitch (Eds.), Automated Reasoning—Second International Joint Conference, IJCAR 2004, Cork, Ireland, July 4–8, 2004, Proceedings, Lecture Notes in Computer Science, vol. 3097, Springer, 2004, pp. 1–44. – reference: M. Al-Turki, A Rewriting Logic Approach to the Semantics of Orc, Master’s thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, December 2005. – volume: 40 start-page: 143 year: 1993 end-page: 184 ident: bib41 article-title: A framework for defining logics publication-title: Journal of the ACM – reference: G. Rosu, R.P. Venkatesan, J. Whittle, L. Leustean, Certifying optimality of state estimation programs, in: W.A. Hunt Jr., F. Somenzi (Eds.), Computer Aided Verification, 15th International Conference, CAV 2003, Boulder, CO, USA, July 8–12, 2003, Proceedings, Lecture Notes in Computer Science, vol. 2725, Springer, 2003, pp. 301–314. – reference: D. Clément, J. Despeyroux, L. Hascoet, G. Kahn, Natural semantics on the computer, in: K. Fuchi, M. Nivat (Eds.), Proceedings of the France-Japan AI and CS Symposium, ICOT, Japan, 1986, pp. 49–89, Also, Information Processing Society of Japan, Technical Memorandum PL-86-6 and Rapport de recherche #0416, INRIA. – volume: 373 start-page: 213 year: 2007 end-page: 237 ident: bib57 article-title: The rewriting logic semantics project publication-title: Theoretical Computer Science – reference: J. Meseguer, Rewriting logic as a semantic framework for concurrency: a progress report, in: U. Montanari, V. Sassone (Eds.), CONCUR ’96, Concurrency Theory, 7th International Conference, Pisa, Italy, August 26–29, 1996, Proceedings, Lecture Notes in Computer Science, vol. 1119, Springer, 1996, pp. 331–372. – reference: M. Katelman, J. Meseguer, A rewriting semantics for ABEL with applications to hardware/software co-design and analysis, in: G. Denker, C. Talcott (Eds.), Proceedings of the Sixth International Workshop on Rewriting Logic and its Applications (WRLA 2006), Electronic Notes in Theoretical Computer Science, vol. 176, No. 4, Elsevier, 2007, pp. 47–60. – year: 1986 ident: bib77 article-title: Denotational Semantics—A Methodology for Language Development – reference: M. d’Amorim, G. Rosu, An equational specification for the Scheme language, The Journal of Universal Computer Science, 11 (7) (2005) 1327–1348, Selected papers from the 9th Brazilian Symposium on Programming Languages (SBLP’05), Also Technical Report No. UIUCDCS-R-2005-2567, April 2005. – year: 2002 ident: bib69 article-title: Types and Programming Languages – reference: M. AlTurki, J. Meseguer, Real-time rewriting semantics of orc, in: M. Leuschel, A. Podelski (Eds.), Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 14–16, 2007, ACM Press, Wroclaw, Poland, 2007, pp. 131–142. – reference: M. Hills, T.F. Şerbănuţă, G. Roşu, A rewrite framework for language definitions and for generation of efficient interpreters, in: G. Denker, C. Talcott (Eds.), Proceedings of the Sixth International Workshop on Rewriting Logic and its Applications (WRLA 2006), Electronic Notes in Theoretical Computer Science, vol. 176, No. 4, Elsevier, 2007, pp. 215–231. – reference: S. Eker, N. Martí-Oliet, J. Meseguer, A. Verdejo, Deduction, strategies, and rewriting, in: T. Boy de la Tour, M. Archer, C. Muoz (Eds.), Proceedings of the 6th International Workshop on Strategies in Automated Deduction (STRATEGIES 2006), Electronic Notes in Theoretical Computer Science, vol. 174, No. 11, Elsevier, 2007, pp. 3–25. – reference: J. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, J.-P. Jouannaud, Introducing OBJ, in: J. Goguen (Ed.), Applications of Algebraic Specification using OBJ, Cambridge, 1993. – reference: A. Farzan, J. Meseguer, G. Rosu, Formal JVM code analysis in JavaFAN, in: C. Rattray, S. Maharaj, C. Shankland (Eds.), Algebraic Methodology and Software Technology, 10th International Conference, AMAST 2004, Stirling, Scotland, UK, July 12–16, 2004, Proceedings, Lecture Notes in Computer Science, vol. 3116, Springer, 2004, pp. 132–147. – reference: S. Liang, P. Hudak, M. Jones, Monad transformers and modular interpreters, in: POPL ’95: Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM Press, New York, NY, USA, 1995, pp. 333–343. – reference: J. Meseguer, Software specification and verification in rewriting logic, in: M. Broy, M. Pizka (Eds.), Models, Algebras, and Logic of Engineering Software, NATO Advanced Study Institute, Marktoberdorf, Germany, July 30–August 11, 2002, IOS Press, 2003, pp. 133–193. – reference: P. Thati, K. Sen, N. Martí-Oliet, An executable specification of asynchronous Pi-Calculus semantics and may testing in Maude 2.0, in: F. Gadducci, U. Montanari (Eds.), Proceedings of the Forth International Workshop on Rewriting Logic and its Applications (WRLA 2002), Electronic Notes in Theoretical Computer Science, vol. 71, Elsevier, 2002. – volume: vol. B year: 1990 ident: bib63 article-title: Denotational semantics publication-title: Handbook of Theoretical Computer Science – reference: F. Chalub, An Implementation of Modular SOS in Maude, Master’s thesis, Universidade Federal Fluminense, May 2005. Available from: – year: 2000 ident: bib46 article-title: Computer-Aided Reasoning: ACL2 Case Studies – reference: A. Garrido, J. Meseguer, R. Johnson, Algebraic Semantics of the C Preprocessor and Correctness of its Refactorings, Technical Report UIUCDCS-R-2006-2688, Department of Computer Science, University of Illinois at Urbana-Champaign, February 2006. – volume: 15 start-page: 55 year: 1990 end-page: 77 ident: bib6 article-title: The GAMMA model and its discipline of programming publication-title: Science of Computer Programming – reference: N. Martí-Oliet, J. Meseguer, Rewriting logic as a logical and semantic framework, in: D. Gabbay, F. Guenthner (Eds.), Handbook of Philosophical Logic, second ed., Kluwer Academic Publishers, 2002, pp. 1–87, First published as SRI Technical Report SRI-CSL-93-05, August 1993. – reference: A. Verdejo, N. Martí-Oliet, Implementing CCS in Maude 2, in: F. Gadducci, U. Montanari (Eds.), Proceedings of the Forth International Workshop on Rewriting Logic and its Applications (WRLA 2002), Electronic Notes in Theoretical Computer Science, vol. 71, Elsevier, 2002. – reference: P. Borovanský, H. Cirstea, H. Dubois, C. Kirchner, H. Kirchner, P.-E. Moreau, C. Ringeissen, M. Vittek, ELAN V 3.4 User Manual, LORIA, Nancy (France), fourth ed., January 2000. – reference: G. Nadathur, D. Miller, An overview of Lambda-PROLOG, in: K.A.B. Robert, A. Kowalski (Eds.), Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, August 15–19, 1988, Proceedings, MIT Press, 1988, pp. 810–827. – volume: 360 start-page: 386 year: 2006 end-page: 414 ident: bib15 article-title: Semantic foundations for generalized rewrite theories publication-title: Theoretical Computer Science – reference: R. Diaconescu, K. Futatsugi, CafeOBJ Report, The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification, AMAST Series in Computing, vol. 6, World Scientific, 1998. – reference: . – reference: C. Braga, Rewriting Logic as a Semantic Framework for Modular Structural Operational Semantics, Ph.D. thesis, Departamento de Informática, Pontificia Universidade Católica de Rio de Janeiro, Brasil, 2001. – reference: G. Roşu, K: a Rewrite-based Framework for Modular Language Design, Semantics, Analysis and Implementation, Technical Report UIUCDCS-R-2005-2672, Department of Computer Science, University of Illinois at Urbana-Champaign, 2005, K was first introduced in 2003, in the technical report UIUCDCS-R-2003-2897: lecture notes of CS322 (programming language design). – reference: , – reference: A. Verdejo, Maude como marco semántico ejecutable, Ph.D. thesis, Facultad de Informática, Universidad Complutense, Madrid, Spain, 2003. – volume: 10 start-page: 789 year: 2004 end-page: 807 ident: bib18 article-title: A modular rewriting semantics for CML publication-title: The Journal of Universal Computer Science – reference: D. Miller, Representing and reasoning with operational semantics, in: U. Furbach, N. Shankar (Eds.), Automated Reasoning, Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17–20, 2006, Proceedings, Lecture Notes in Computer Science, vol. 4130, Springer, 2006, pp. 4–20. – reference: D. Scott, C. Strachey, Toward a mathematical semantics for computer languages, in: Microwave Research Institute Symposia Series, Proceedings of the Symposium on Computers and Automata, vol. 21, Polytechnical Institute of Brooklyn, 1971. – volume: 115 start-page: 38 year: 1994 end-page: 94 ident: bib96 article-title: A syntactic approach to type soundness publication-title: Information and Computation – reference: M.-O. Stehr, I. Cervesato, S. Reich, An execution environment for the MSR cryptoprotocol specification language, 2004. Available from: – volume: 2 start-page: 119 year: 1992 end-page: 141 ident: bib59 article-title: Functions as processes publication-title: Mathematical Structures in Computer Science – reference: F. Chalub, C. Braga, Maude MSOS tool, in: G. Denker, C. Talcott (Eds.), Proceedings of the Sixth International Workshop on Rewriting Logic and its Applications (WRLA 2006), Electronic Notes in Theoretical Computer Science, vol. 176, No. 4, Elsevier, 2007, pp. 133–146. – reference: M.-O. Stehr, CINNI—a generic calculus of explicit substitutions and its application to lambda-, sigma- and pi- calculi, in: K. Futatsugi (Ed.), Proceedings of the Third International Workshop on Rewriting Logic and its Applications (WRLA 2000), Electronic Notes in Theoretical Computer Science, vol. 36, Elsevier, 2000. – volume: 285 start-page: 155 year: 2002 end-page: 185 ident: bib10 article-title: ELAN from a rewriting logic point of view publication-title: Theoretical Computer Science – reference: ITP: a verification tool based on algebraic semantics, in: PROLE 2005: V Jornadas sobre Programacin y Lenguajes, Thomson, 2005, pp. 149–158. – reference: G.D. Plotkin, A structural approach to operational semantics, Journal of Logic and Algebraic Programming 60–61 (2004) 17–139, Original version: University of Aarhus Technical Report DAIMI FN-19, 1981. – volume: 285 start-page: 487 year: 2002 end-page: 517 ident: bib92 article-title: Equational rules for rewriting logic publication-title: Theoretical Computer Science – volume: 285 start-page: 121 year: 2002 end-page: 154 ident: bib49 article-title: Rewriting logic: roadmap and bibliography publication-title: Theoretical Computer Science – reference: P. Wadler, The essence of functional programming, in: POPL ’92: Proceedings of the 19th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM Press, New York, NY, USA, 1992, pp. 1–14. – reference: I. Cervesato, M.-O. Stehr, Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types, in: P. Degano (Ed.), Proceedings of the Fifth International Workshop on Rewriting Logic and its Applications (WRLA 2004), Electronic Notes in Theoretical Computer Science, vol. 117, Elsevier, 2005, pp. 183–207. – volume: 6 start-page: 699 year: 1996 end-page: 722 ident: bib7 publication-title: The Journal of Functional Programming – year: 1996 ident: bib37 article-title: Algebraic Semantics of Imperative Programs – volume: 285 start-page: 187 year: 2002 end-page: 243 ident: bib22 article-title: Maude: specification and programming in rewriting logic publication-title: Theoretical Computer Science – reference: F. Chen, G. Rosu, R.P. Venkatesan, Rule-based analysis of dimensional safety, in: R. Nieuwenhuis (Ed.), Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9–11, 2003, Proceedings, Lecture Notes in Computer Science, vol. 2706, Springer, 2003, pp. 197–207. – reference: J. Meseguer, Membership algebra as a logical framework for equational specification, in: F. Parisi-Presicce (Ed.), Recent Trends in Algebraic Development Techniques, 12th International Workshop, WADT’97, Tarquinia, Italy, June 1997, Selected Papers, Lecture Notes in Computer Science, vol. 1376, Springer, 1997, pp. 18–61. – reference: A. Farzan, Static and Dynamic Formal Analysis of Concurrent Systems and Languages: A Semantics-based Approach, Ph.D. thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, 2007. – reference: P.D. Mosses, Unified algebras and action semantics, in: B. Monien, R. Cori (Eds.), STACS 89, 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16–18, 1989, Proceedings, Lecture Notes in Computer Science, vol. 349, Springer, 1989, pp. 17–35. – reference: M. Felleisen, D.P. Friedman, Control operators, the SECD-machine, and the lambda-calculus, in: 3rd Working Conference on the Formal Description of Programming Concepts, Ebberup, Denmark, August 1986, pp. 193–219. – reference: G. Kahn, Natural semantics, in: F.-J. Brandenburg, G. Vidal-Naquet, M. Wirsing (Eds.), STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Germany, February 19–21, 1987, Proceedings, Lecture Notes in Computer Science, vol. 247, Springer, 1987, pp. 22–39. – reference: G.A. Agha, J. Meseguer, K. Sen, PMaude: rewrite-based specification language for probabilistic object systems, in: 3rd Workshop on Quantitative Aspects of Programming Languages (QAPL 05), Electronic Notes in Theoretical Computer Science, vol. 153, No. 2, 2006, pp. 213–239. – reference: F. Chen, G. Roşu, Rewriting Logic Semantics of Java 1.4, 2004. Available from: – reference: M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Lévy, Explicit substitutions, in: POPL ’90: Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM Press, New York, NY, USA, 1990, pp. 31–46. – reference: O. Danvy, L.R. Nielsen. Refocusing in reduction semantics, RS RS-04-26, BRICS, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, November 2004, This report supersedes BRICS report RS-02-04, A preliminary version appears in the informal proceedings of the Second International Workshop on Rule-Based Programming, RULE 2001, Electronic Notes in Theoretical Computer Science, vol. 59.4. – volume: 24 start-page: 334 year: 2002 end-page: 368 ident: bib87 article-title: Compiling language definitions: the asf+sdf compiler publication-title: ACM Transactions on Programming Languages and Systems (TOPLAS) – volume: 6 start-page: 233 year: 1993 end-page: 248 ident: bib71 article-title: The discoveries of continuations publication-title: Lisp and Symbolic Computation – volume: 96 start-page: 73 year: 1992 end-page: 155 ident: bib50 article-title: Conditional rewriting logic as a unified model of concurrency publication-title: Theoretical Computer Science – reference: J. Meseguer, C. Braga, Modular rewriting semantics of programming languages, in: C. Rattray, S. Maharaj, C. Shankland (Eds.), Algebraic Methodology and Software Technology, 10th International Conference, AMAST 2004, Stirling, Scotland, UK, July 12–16, 2004, Proceedings, Lecture Notes in Computer Science, vol. 3116, Springer, 2004, pp. 364–378. – volume: 6 start-page: 289 year: 1993 end-page: 360 ident: bib74 article-title: Reasoning about programs in continuation-passing style publication-title: Lisp and Symbolic Computation – reference: C. Braga, J. Meseguer, Modular rewriting semantics in practice, in: Proceedings of the Fifth International Workshop on Rewriting Logic and its Applications (WRLA 2004), Electronic Notes in Theoretical Computer Science, vol. 117, Elsevier, 2005, pp. 393–416. – reference: A. Farzan, F. Chen, J. Meseguer, G. Rosu, Formal analysis of Java programs in JavaFAN, in: R. Alur, D. Peled (Eds.), Computer Aided Verification, 16th International Conference, CAV 2004, Boston, MA, USA, July 13–17, 2004, Proceedings, Lecture Notes in Computer Science, vol. 3114, Springer, 2004, pp. 501–505. – volume: 96 start-page: 217 year: 1992 end-page: 248 ident: bib8 article-title: The chemical abstract machine publication-title: Theoretical Computer Science – reference: E.B. Johnsen, O. Owe, E.W. Axelsen, A run-time environment for concurrent objects with asynchronous method calls, in: N. Martí-Oliet (Ed.), Proceedings of the Fifth International Workshop on Rewriting Logic and its Applications (WRLA 2004), Electronic Notes in Theoretical Computer Science, vol. 117, Elsevier, 2005, pp. 375–392. – reference: F. Pfenning, C. Elliott, Higher-order abstract syntax, in: PLDI ’88: Proceedings of the ACM SIGPLAN 1988 Conference on Programming Language Design and Implementation, ACM Press, New York, NY, USA, 1988, pp. 199–208. – reference: W. Ahrendt, A. Roth, R. Sasse, Automatic validation of transformation rules for java verification against a rewriting semantics, in: G. Sutcliffe, A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, 12th International Conference, LPAR 2005, Montego Bay, Jamaica, December 2–6, 2005, Proceedings, Lecture Notes in Computer Science, vol. 3835, Springer, 2005, pp. 412–426. – reference: A. Farzan, J. Meseguer, Partial order reduction for rewriting semantics of programming languages, in: G. Denker, C. Talcott (Eds.), Proceedings of the Sixth International Workshop on Rewriting Logic and its Applications (WRLA 2006), Electronic Notes in Theoretical Computer Science, vol. 176, No. 4, Elsevier, 2007, pp. 61–78. – year: 1997 ident: bib60 article-title: The Definition of Standard ML (Revised) – year: 1996 ident: bib88 article-title: Language Prototyping: An Algebraic Specification Approach – year: 2001 ident: bib35 article-title: Essentials of Programming Languages – year: 1995 ident: bib80 article-title: Formal Syntax and Semantics of Programming Languages – reference: E. Visser, Program transformation with Stratego/XT: rules, strategies, tools, and systems in Stratego/XT 0.9, in: C. Lengauer, D.S. Batory, C. Consel, M. Odersky (Eds.), Domain-Specific Program Generation, International Seminar, Dagstuhl Castle, Germany, March 23–28, 2003, Revised Papers, Lecture Notes in Computer Science, vol. 3016, Springer, 2003, pp. 216–238. – reference: D. Scott, Outline of a mathematical theory of computation, in: Proceedings, Fourth Annual Princeton Conference on Information Sciences and Systems, Princeton University, 1970, pp. 169–176, Also appeared as Technical Monograph PRG 2, Oxford University, Programming Research Group. – reference: M.-O. Stehr, C.L. Talcott, Practical techniques for language design and prototyping, in: J.L. Fiadeiro, U. Montanari, M. Wirsing (Eds.), Abstracts Collection of the Dagstuhl Seminar 05081 on Foundations of Global Computing, February 20–25, 2005, Schloss Dagstuhl, Wadern, Germany, 2005. – reference: M. Clavel, J. Santa-Cruz, ASIP – reference: + – reference: E. Moggi, An Abstract View of Programming Languages, Technical Report ECS-LFCS-90-113, Edinburgh University, Department of Computer Science, June 1989. – reference: R. Sasse, Taclets vs. Rewriting Logic—Relating Semantics of Java, Master’s thesis, Fakultät für Informatik, Universität Karlsruhe, Germany, May 2005, Technical Report in Computing Science No. 2005-16. – reference: P. Borras, D. Clément, T. Despeyroux, J. Incerpi, G. Kahn, B. Lang, V. Pascual, CENTAUR: the system, in: Software Development Environments (SDE), 1988, pp. 14–24. – reference: J.A. Goguen, K. Parsaye-Ghomi, Algebraic denotational semantics using parameterized abstract modules, in: J. Díaz, I. Ramos (Eds.), Formalization of Programming Concepts, International Colloquium, Peniscola, Spain, April 19–25, 1981, Proceedings, Lecture Notes in Computer Science, vol. 107, Springer, 1981, pp. 292–309. – volume: 9 start-page: 54 year: 1987 end-page: 99 ident: bib14 article-title: On the algebraic definition of programming languages publication-title: ACM Transactions on Programming Languages and Systems (TOPLAS) – volume: 14 start-page: 337 year: 1980 end-page: 357 ident: bib95 article-title: First-order identities as a defining language publication-title: Acta Informatica – volume: 60–61 start-page: 195 year: 2004 end-page: 228 ident: bib65 article-title: Modular structural operational semantics publication-title: Journal of Logic and Algebraic Programming – reference: Y. Xiao, Z.M. Ariola, M. Mauny, From syntactic theories to interpreters: a specification language and its compilation, The Computing Research Repository (CoRR), cs.PL/0009030, September 2000. – reference: R. Sasse, J. Meseguer, Java+ITP: a verification tool based on hoare logic and algebraic semantics, in: G. Denker, C. Talcott (Eds.), Proceedings of the Sixth International Workshop on Rewriting Logic and its Applications (WRLA 2006), Electronic Notes in Theoretical Computer Science, vol. 176, No. 4, Elsevier, 2007, pp. 29–46. – reference: P.C. Ölveczky, J. Meseguer, Real-time Maude 2.1, in: N. Martí-Oliet (Ed.), Proceedings of the Fifth International Workshop on Rewriting Logic and its Applications (WRLA 2004), Electronic Notes in Theoretical Computer Science, vol. 117, Elsevier, 2005, pp. 285–314. – reference: P.D. Mosses, Pragmatics of modular SOS, in: H. Kirchner, C. Ringeissen (Eds.), Algebraic Methodology and Software Technology, 9th International Conference, AMAST 2002, Saint-Gilles-les-Bains, Reunion Island, France, September 9–13, 2002, Proceedings, Lecture Notes in Computer Science, vol. 2422, Springer, 2002, pp. 21–40. – start-page: 9 year: 1994 end-page: 37 ident: bib40 article-title: Evolving algebras 1993: Lipari Guide publication-title: Specification and Validation Methods – year: 2001 ident: bib81 article-title: Java and the Java Virtual Machine: Definition, Verification, Validation – reference: M. Clavel, F. Durán, S. Eker, J. Meseguer, P. Lincoln, N. Martí-Oliet, C. Talcott, All about Maude, A High-Performance Logical Framework, Lecture Notes in Computer Science, vol. 4350, Springer, 2007. – volume: 67 start-page: 226 year: 2006 end-page: 293 ident: bib91 article-title: Executable structural operational semantics in Maude publication-title: Journal of Logic and Algebraic Programming – ident: 10.1016/j.ic.2008.03.026_bib38 – ident: 10.1016/j.ic.2008.03.026_bib45 doi: 10.1016/j.entcs.2007.06.007 – year: 1997 ident: 10.1016/j.ic.2008.03.026_bib60 – year: 1995 ident: 10.1016/j.ic.2008.03.026_bib80 – volume: 9 start-page: 54 issue: 1 year: 1987 ident: 10.1016/j.ic.2008.03.026_bib14 article-title: On the algebraic definition of programming languages publication-title: ACM Transactions on Programming Languages and Systems (TOPLAS) doi: 10.1145/9758.10501 – start-page: 9 year: 1994 ident: 10.1016/j.ic.2008.03.026_bib40 article-title: Evolving algebras 1993: Lipari Guide – year: 2001 ident: 10.1016/j.ic.2008.03.026_bib81 – ident: 10.1016/j.ic.2008.03.026_bib53 – ident: 10.1016/j.ic.2008.03.026_bib19 doi: 10.1016/j.entcs.2007.06.012 – ident: 10.1016/j.ic.2008.03.026_bib21 doi: 10.1007/3-540-44881-0_15 – year: 2000 ident: 10.1016/j.ic.2008.03.026_bib46 – volume: 285 start-page: 121 issue: 2 year: 2002 ident: 10.1016/j.ic.2008.03.026_bib49 article-title: Rewriting logic: roadmap and bibliography publication-title: Theoretical Computer Science doi: 10.1016/S0304-3975(01)00357-7 – ident: 10.1016/j.ic.2008.03.026_bib30 – ident: 10.1016/j.ic.2008.03.026_bib84 doi: 10.1016/S1571-0661(05)82538-1 – ident: 10.1016/j.ic.2008.03.026_bib3 doi: 10.1007/11591191_29 – volume: 285 start-page: 155 issue: 2 year: 2002 ident: 10.1016/j.ic.2008.03.026_bib10 article-title: ELAN from a rewriting logic point of view publication-title: Theoretical Computer Science doi: 10.1016/S0304-3975(01)00358-9 – volume: 96 start-page: 217 issue: 1 year: 1992 ident: 10.1016/j.ic.2008.03.026_bib8 article-title: The chemical abstract machine publication-title: Theoretical Computer Science doi: 10.1016/0304-3975(92)90185-I – volume: 6 start-page: 699 issue: 5 year: 1996 ident: 10.1016/j.ic.2008.03.026_bib7 article-title: λ-ν, a calculus of explicit substitutions which preserves strong normalisation publication-title: The Journal of Functional Programming doi: 10.1017/S0956796800001945 – ident: 10.1016/j.ic.2008.03.026_bib26 – ident: 10.1016/j.ic.2008.03.026_bib54 doi: 10.1007/11560647_1 – ident: 10.1016/j.ic.2008.03.026_bib33 doi: 10.1007/978-3-540-27815-3_14 – volume: 360 start-page: 386 issue: 1–3 year: 2006 ident: 10.1016/j.ic.2008.03.026_bib15 article-title: Semantic foundations for generalized rewrite theories publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2006.04.012 – volume: 40 start-page: 143 issue: 1 year: 1993 ident: 10.1016/j.ic.2008.03.026_bib41 article-title: A framework for defining logics publication-title: Journal of the ACM doi: 10.1145/138027.138060 – ident: 10.1016/j.ic.2008.03.026_bib79 – ident: 10.1016/j.ic.2008.03.026_bib86 doi: 10.1016/S1571-0661(05)82539-3 – volume: 24 start-page: 334 issue: 4 year: 2002 ident: 10.1016/j.ic.2008.03.026_bib87 article-title: Compiling language definitions: the asf+sdf compiler publication-title: ACM Transactions on Programming Languages and Systems (TOPLAS) doi: 10.1145/567097.567099 – ident: 10.1016/j.ic.2008.03.026_bib12 – ident: 10.1016/j.ic.2008.03.026_bib47 doi: 10.1145/199448.199528 – ident: 10.1016/j.ic.2008.03.026_bib67 doi: 10.1016/j.entcs.2004.06.015 – ident: 10.1016/j.ic.2008.03.026_bib82 doi: 10.1016/S1571-0661(05)80125-2 – ident: 10.1016/j.ic.2008.03.026_bib32 doi: 10.1016/j.entcs.2007.06.008 – ident: 10.1016/j.ic.2008.03.026_bib23 – volume: 373 start-page: 213 issue: 3 year: 2007 ident: 10.1016/j.ic.2008.03.026_bib57 article-title: The rewriting logic semantics project publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2006.12.018 – ident: 10.1016/j.ic.2008.03.026_bib78 – ident: 10.1016/j.ic.2008.03.026_bib2 doi: 10.1016/j.entcs.2005.10.040 – ident: 10.1016/j.ic.2008.03.026_bib93 – ident: 10.1016/j.ic.2008.03.026_bib9 doi: 10.1016/S1571-0661(04)00032-5 – volume: 6 start-page: 289 issue: 3–4 year: 1993 ident: 10.1016/j.ic.2008.03.026_bib74 article-title: Reasoning about programs in continuation-passing style publication-title: Lisp and Symbolic Computation doi: 10.1007/BF01019462 – ident: 10.1016/j.ic.2008.03.026_bib36 – ident: 10.1016/j.ic.2008.03.026_bib17 – ident: 10.1016/j.ic.2008.03.026_bib28 doi: 10.1142/3831 – ident: 10.1016/j.ic.2008.03.026_bib58 doi: 10.1007/11814771_3 – volume: 285 start-page: 187 issue: 2 year: 2002 ident: 10.1016/j.ic.2008.03.026_bib22 article-title: Maude: specification and programming in rewriting logic publication-title: Theoretical Computer Science doi: 10.1016/S0304-3975(01)00359-0 – year: 2001 ident: 10.1016/j.ic.2008.03.026_bib35 – ident: 10.1016/j.ic.2008.03.026_bib20 – volume: 67 start-page: 226 issue: 1–2 year: 2006 ident: 10.1016/j.ic.2008.03.026_bib91 article-title: Executable structural operational semantics in Maude publication-title: Journal of Logic and Algebraic Programming doi: 10.1016/j.jlap.2005.09.008 – year: 1996 ident: 10.1016/j.ic.2008.03.026_bib37 – ident: 10.1016/j.ic.2008.03.026_bib90 doi: 10.1016/S1571-0661(05)82540-X – volume: 2 start-page: 119 issue: 2 year: 1992 ident: 10.1016/j.ic.2008.03.026_bib59 article-title: Functions as processes publication-title: Mathematical Structures in Computer Science doi: 10.1017/S0960129500001407 – ident: 10.1016/j.ic.2008.03.026_bib64 doi: 10.1007/3-540-45719-4_3 – ident: 10.1016/j.ic.2008.03.026_bib73 – ident: 10.1016/j.ic.2008.03.026_bib31 doi: 10.1007/978-3-540-27813-9_46 – ident: 10.1016/j.ic.2008.03.026_bib56 doi: 10.1007/978-3-540-25984-8_1 – ident: 10.1016/j.ic.2008.03.026_bib62 doi: 10.1007/BFb0028970 – ident: 10.1016/j.ic.2008.03.026_bib94 doi: 10.1145/143165.143169 – ident: 10.1016/j.ic.2008.03.026_bib51 doi: 10.1007/3-540-61604-7_64 – ident: 10.1016/j.ic.2008.03.026_bib25 – ident: 10.1016/j.ic.2008.03.026_bib42 doi: 10.1016/j.entcs.2007.06.017 – ident: 10.1016/j.ic.2008.03.026_bib11 doi: 10.1145/64137.65005 – ident: 10.1016/j.ic.2008.03.026_bib34 – ident: 10.1016/j.ic.2008.03.026_bib72 – volume: 115 start-page: 38 issue: 1 year: 1994 ident: 10.1016/j.ic.2008.03.026_bib96 article-title: A syntactic approach to type soundness publication-title: Information and Computation doi: 10.1006/inco.1994.1093 – ident: 10.1016/j.ic.2008.03.026_bib89 – volume: vol. B year: 1990 ident: 10.1016/j.ic.2008.03.026_bib63 article-title: Denotational semantics – volume: 96 start-page: 73 issue: 1 year: 1992 ident: 10.1016/j.ic.2008.03.026_bib50 article-title: Conditional rewriting logic as a unified model of concurrency publication-title: Theoretical Computer Science doi: 10.1016/0304-3975(92)90182-F – year: 2002 ident: 10.1016/j.ic.2008.03.026_bib69 – ident: 10.1016/j.ic.2008.03.026_bib29 doi: 10.1016/j.entcs.2006.03.017 – ident: 10.1016/j.ic.2008.03.026_bib85 doi: 10.21236/ADA484494 – ident: 10.1016/j.ic.2008.03.026_bib76 doi: 10.1016/j.entcs.2007.06.006 – ident: 10.1016/j.ic.2008.03.026_bib43 doi: 10.1016/j.entcs.2004.06.012 – ident: 10.1016/j.ic.2008.03.026_bib75 – ident: 10.1016/j.ic.2008.03.026_bib44 doi: 10.1007/BFb0039592 – ident: 10.1016/j.ic.2008.03.026_bib16 doi: 10.1016/j.entcs.2004.06.023 – year: 1996 ident: 10.1016/j.ic.2008.03.026_bib88 – ident: 10.1016/j.ic.2008.03.026_bib1 doi: 10.1145/96709.96712 – ident: 10.1016/j.ic.2008.03.026_bib13 doi: 10.1016/j.entcs.2004.06.019 – volume: 14 start-page: 337 year: 1980 ident: 10.1016/j.ic.2008.03.026_bib95 article-title: First-order identities as a defining language publication-title: Acta Informatica doi: 10.1007/BF00286491 – ident: 10.1016/j.ic.2008.03.026_bib61 – volume: 6 start-page: 233 issue: 3–4 year: 1993 ident: 10.1016/j.ic.2008.03.026_bib71 article-title: The discoveries of continuations publication-title: Lisp and Symbolic Computation doi: 10.1007/BF01019459 – ident: 10.1016/j.ic.2008.03.026_bib48 doi: 10.1007/978-94-017-0464-9_1 – ident: 10.1016/j.ic.2008.03.026_bib5 doi: 10.1145/1273920.1273938 – ident: 10.1016/j.ic.2008.03.026_bib39 doi: 10.1007/3-540-10699-5_106 – ident: 10.1016/j.ic.2008.03.026_bib97 – ident: 10.1016/j.ic.2008.03.026_bib68 doi: 10.1145/53990.54010 – year: 1986 ident: 10.1016/j.ic.2008.03.026_bib77 – ident: 10.1016/j.ic.2008.03.026_bib55 doi: 10.1007/978-3-540-27815-3_29 – ident: 10.1016/j.ic.2008.03.026_bib66 – ident: 10.1016/j.ic.2008.03.026_bib83 – volume: 15 start-page: 55 issue: 1 year: 1990 ident: 10.1016/j.ic.2008.03.026_bib6 article-title: The GAMMA model and its discipline of programming publication-title: Science of Computer Programming doi: 10.1016/0167-6423(90)90044-E – volume: 60–61 start-page: 195 year: 2004 ident: 10.1016/j.ic.2008.03.026_bib65 article-title: Modular structural operational semantics publication-title: Journal of Logic and Algebraic Programming doi: 10.1016/j.jlap.2004.03.008 – ident: 10.1016/j.ic.2008.03.026_bib24 – ident: 10.1016/j.ic.2008.03.026_bib52 – volume: 285 start-page: 487 issue: 2 year: 2002 ident: 10.1016/j.ic.2008.03.026_bib92 article-title: Equational rules for rewriting logic publication-title: Theoretical Computer Science doi: 10.1016/S0304-3975(01)00366-8 – ident: 10.1016/j.ic.2008.03.026_bib4 – volume: 10 start-page: 789 issue: 7 year: 2004 ident: 10.1016/j.ic.2008.03.026_bib18 article-title: A modular rewriting semantics for CML publication-title: The Journal of Universal Computer Science – ident: 10.1016/j.ic.2008.03.026_bib27 doi: 10.7146/brics.v11i26.21851 – ident: 10.1016/j.ic.2008.03.026_bib70 doi: 10.1016/j.jlap.2004.05.001 |
| SSID | ssj0011546 |
| Score | 2.1202111 |
| Snippet | This paper shows how rewriting logic semantics (RLS) can be used as a computational logic framework for operational semantic definitions of programming... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 305 |
| SubjectTerms | Operational semantics Rewriting logic Rewriting logic semantics |
| Title | A rewriting logic approach to operational semantics |
| URI | https://dx.doi.org/10.1016/j.ic.2008.03.026 |
| Volume | 207 |
| WOSCitedRecordID | wos000264109400011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1090-2651 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0011546 issn: 0890-5401 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV07b9swECZcp0Mz9JG2SPoCh2YoAqU0qQc5CoGNNkPQIQW8CaJEGjZSyZCtxD8_J5GU5eaBZugi2IQp2bzPx4_kd3cIfYU5KQizKPf4SPmer0Pf4z6TniaB0sAwJNOm2ER0ccGnU_FrMNi4WJjrq6go-GYjlv_V1NAGxm5CZ59g7u6m0ACvwehwBbPD9Z8MH59U6qZJVVTMTlrH1uUNb3hmuVSV2_9bqT8wrk7uvnCa9i6e0cW8Levd8_rjs-BYjMEeLRNlRd00xMy8awFQpY3fmLTqvu2RTttvUpvQmPms7Olu1UrNaoOe83JlTu93NiSE0zBv_ZYgjd5i1Hey1NS2tWiiPZfJSNCbfZlJ3nTHsZs9hsXpPLP6V3ZK6D05tP-a2zrFoROzLZJ5ZktvsgTu8Azt0SgQfIj24p_j6Xl3AjWyQV7ux9gjbqMN3P0W91OaHk25fI1e2vUFjg0u3qCBKg7QK1e7A1tXfoD2e4ko3yIW4w40uAUNdqDB6xL3QIM70LxDvyfjy7Mfni2n4WVU-GsvE5TqMEiBQSqg3VqnLJQkzBXPfJITP4WVr6Z8lMoAaF7AZBjyJp-fpmmopIzYezQsykIdIgx_YkIUVVRI5qd5KjQsM6ggXEnGeJ4eoe9uRJLM5ppvSp5cJQ_Z4Qh963osTZ6VRz7L3CAnlica_pcAWh7s9eEJT_iIXmyR_QkN11WtPqPn2fV6vqq-WKjcAspOgO8 |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+rewriting+logic+approach+to+operational+semantics&rft.jtitle=Information+and+computation&rft.au=%C5%9Eerb%C4%83nu%C5%A3%C4%83%2C+Traian+Florin&rft.au=Ro%C5%9Fu%2C+Grigore&rft.au=Meseguer%2C+Jos%C3%A9&rft.date=2009-02-01&rft.issn=0890-5401&rft.volume=207&rft.issue=2&rft.spage=305&rft.epage=340&rft_id=info:doi/10.1016%2Fj.ic.2008.03.026&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ic_2008_03_026 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0890-5401&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0890-5401&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0890-5401&client=summon |