NP-completeness of the set unification and matching problems
Proc. of the 8th international conference on Automated deduction
SDE 3 Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Action semantics
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Compiling language definitions: the ASF+SDF compiler
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Defining and Executing P Systems with Structured Data in K
Membrane Computing
A rewriting logic approach to operational semantics
Information and Computation
Memory Representations in Rewriting Logic Semantics Definitions
Electronic Notes in Theoretical Computer Science (ENTCS)
Implicit Propagation in Structural Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 8th international workshop on Specification and verification of component-based systems
The rewriting logic semantics project: a progress report
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
RLSRunner: linking rascal with k for program analysis
SLE'11 Proceedings of the 4th international conference on Software Language Engineering
Program analysis scenarios in rascal
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
The rewriting logic semantics project: A progress report
Information and Computation
Hi-index | 0.00 |
A rewrite logic semantic definitional framework for programming languages is introduced, called K, together with partially automated translations of K language definitions into rewriting logic and into C. The framework is exemplified by defining SILF, a simple imperative language with functions. The translation of K definitions into rewriting logic enables the use of the various analysis tools developed for rewrite logic specifications, while the translation into C allows for very efficient interpreters. A suite of tests show the performance of interpreters compiled from K definitions.