Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications
Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications
ELAN from a rewriting logic point of view
Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
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
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)
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
Certifying Domain-Specific Policies
Proceedings of the 16th IEEE international conference on Automated software engineering
Proving termination of membership equational programs
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
The maude LTL model checker and its implementation
SPIN'03 Proceedings of the 10th international conference on Model checking software
A sufficient completeness reasoning tool for partial specifications
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
The technologies developed to solve the verifying compiler grand challenge should be generic, that is, not tied to a particular language but widely applicable to many languages. Such technologies should also be semantics-based, that is, based on a rigorous formal semantics of the languages.For this, a computational logical frameworkwith efficient executability and a spectrum of meta-toolscan serve as a basis on which to: (1) define the formal semantics of any programming language; and (2) develop generic program analysis techniquesand toolsthat can be instantiated to generate powerful analysis tools for each language of interest.Not all logical frameworks can serve such purposes well. We first list some specific requirements that we think are important to properly address the grand challenge. Then we present our experience with rewriting logic as supported by the Maude system and its formal tool environment. Finally, we discuss some future directions of research.