Denotational semantics: a methodology for language development
Denotational semantics: a methodology for language development
On the algebraic definition of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
The semantics of programming languages: an elementary introduction using structural operational semantics
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Selected papers of the Second Workshop on Concurrency and compositionality
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
LETOS — a lightweight execution tool for operational semantics
Software—Practice & Experience
Algebraic Semantics of Imperative Programs
Algebraic Semantics of Imperative Programs
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Equational rules for rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Unified Algebras and Action Semantics
STACS '89 Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science
Algebraic Denotational Semantics Using Parameterized Abstract Modules
Proceedings of the International Colloquium on Formalization of Programming Concepts
Certifying Domain-Specific Policies
Proceedings of the 16th IEEE international conference on Automated software engineering
Program refactoring in the presence of preprocessor directives
Program refactoring in the presence of preprocessor directives
Electronic Notes in Theoretical Computer Science (ENTCS)
Modular Rewriting Semantics in Practice
Electronic Notes in Theoretical Computer Science (ENTCS)
A Run-Time Environment for Concurrent Objects With Asynchronous Method Calls
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic validation of transformation rules for java verification against a rewriting semantics
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Real-time rewriting semantics of orc
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
A Rewriting Semantics for ABEL with Applications to Hardware/Software Co-Design and Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
Partial Order Reduction for Rewriting Semantics of Programming Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
A rewriting approach to the design and evolution of object-oriented languages
Companion to the 22nd ACM SIGPLAN conference on Object-oriented programming systems and applications companion
A Rewriting Logic Approach to Operational Semantics (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Reduction Semantics and Formal Analysis of Orc Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Graph-Based Design and Analysis of Dynamic Software Architectures
Concurrency, Graphs and Models
A rewriting logic approach to operational semantics
Information and Computation
Rewriting Logic Specification of Membrane Systems with Promoters and Inhibitors
Electronic Notes in Theoretical Computer Science (ENTCS)
Hierarchical Design Rewriting with Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Memory Representations in Rewriting Logic Semantics Definitions
Electronic Notes in Theoretical Computer Science (ENTCS)
Unification and Narrowing in Maude 2.4
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Teaching Formal Methods Based on Rewriting Logic and Maude
TFM '09 Proceedings of the 2nd International Conference on Teaching Formal Methods
Verifying Ptolemy II Discrete-Event Models Using Real-Time Maude
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
A Service-Oriented UML Profile with Formal Support
ICSOC-ServiceWave '09 Proceedings of the 7th International Joint Conference on Service-Oriented Computing
On formal analysis of OO languages using rewriting logic: designing for performance
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
KOOL: an application of rewriting logic to language prototyping and analysis
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Automatic certification of Java source code in rewriting logic
FMICS'07 Proceedings of the 12th international conference on Formal methods for industrial critical systems
A compact fixpoint semantics for term rewriting systems
Theoretical Computer Science
Combining theorem proving and narrowing for rewriting-logic specifications
TAP'10 Proceedings of the 4th international conference on Tests and proofs
K-Maude: a rewriting based tool for semantics of programming languages
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Collecting semantics under predicate abstraction in the K framework
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Abstract certification of global non-interference in rewriting logic
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Matching logic: an alternative to hoare/floyd logic
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
A formal library of set relations and its application to synchronous languages
Theoretical Computer Science
From grammars and automata to algebras and coalgebras
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
The rewriting logic semantics project: a progress report
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
A formal support to business and architectural design for service-oriented systems
Rigorous software engineering for service-oriented systems
An introduction to maude and some of its applications
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Toward a rewriting logic framework for safe and distributed component installation
VECoS'11 Proceedings of the Fifth international conference on Verification and Evaluation of Computer and Communication Systems
Logical approximation for program analysis
Higher-Order and Symbolic Computation
RLSRunner: linking rascal with k for program analysis
SLE'11 Proceedings of the 4th international conference on Software Language Engineering
Verifying hierarchical Ptolemy II discrete-event models using Real-Time Maude
Science of Computer Programming
Using semantics specified in maude to generate test cases
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
S-Narrowing for constructor systems
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Program analysis scenarios in rascal
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
A Rewriting Logic Approach to Static Checking of Units of Measurement in C
Electronic Notes in Theoretical Computer Science (ENTCS)
Using maude rewriting system to modularize and extend SQL
Proceedings of the 28th Annual ACM Symposium on Applied Computing
The rewriting logic semantics project: A progress report
Information and Computation
A RT-Maude-based framework for component installation
International Journal of Critical Computer-Based Systems
| Hi-index | 5.23 |
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding their respective limitations and allowing succinct semantic definitions. The fact that a rewrite logic theory's axioms include both equations and rewrite rules provides a useful ''abstraction dial'' to find the right balance between abstraction and computational observability in semantic definitions. Such semantic definitions are directly executable as interpreters in a rewriting logic language such as Maude, whose generic formal tools can be used to endow those interpreters with powerful program analysis capabilities.