Prototyping SOS Meta-theory in Maude

Authors:
Mohammad Reza Mousavi;Michel A. Reniers
Affiliations:
Department of Computer Science, Eindhoven University of Technology (TU/e), P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands;Department of Computer Science, Eindhoven University of Technology (TU/e), P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 16
Cited 7

Miranda: a non-strict functional language with polymorphic types

Proc. of a conference on Functional programming languages and computer architecture
Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
Structured operational semantics and bisimulation as a congruence

Information and Computation
Transition system specifications with negative premises

Theoretical Computer Science
Turning SOS rules into equations

Information and Computation
Bisimulation can't be traced

Journal of the ACM (JACM)
The meaning of negative premises in transition system specifications

Journal of the ACM (JACM)
A conservative look at operational semantics with variable binding

Information and Computation
LETOS — a lightweight execution tool for operational semantics

Software—Practice & Experience
A causal semantics for CCS via rewriting logic

Theoretical Computer Science
Implementing CCS in Maude

FORTE/PSTV 2000 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
Building Tools for LOTOS Symbolic Semantics in Maude

FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
SOS for higher order processes

CONCUR 2005 - Concurrency Theory
Two case studies of semantics execution in Maude: CCS and LOTOS

Formal Methods in System Design
Exploiting Labels in Structural Operational Semantics

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Mapping modular SOS to rewriting logic

LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation

SOS formats and meta-theory: 20 years after

Theoretical Computer Science
Modular Structural Operational Semantics with Strategies

Electronic Notes in Theoretical Computer Science (ENTCS)
Maude MSOS Tool

Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Semantics and Analysis of Component Connectors in Reo

Electronic Notes in Theoretical Computer Science (ENTCS)
Transforming SOS specifications to linear processes

FMICS'11 Proceedings of the 16th international conference on Formal methods for industrial critical systems
PREG axiomatizer: a ground bisimilarity checker for GSOS with predicates

CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Nominal SOS

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a prototype implementation of SOS meta-theory in the Maude term rewriting language. The prototype defines the basic concepts of SOS meta-theory (e.g., transition formulae, deduction rules and transition system specifications) in Maude. Besides the basic definitions, we implement methods for checking the premises of some SOS meta-theorems (e.g., GSOS congruence meta-theorem) in this framework. Furthermore, we define a generic strategy for animating programs and models for semantic specifications in our meta-language. The general goal of this line of research is to develop a general-purpose tool that assists language designers by checking useful properties about the language under definition and by providing a rapid prototyping environment for scrutinizing the actual behavior of programs according to the defined semantics.