Completion of a set of rules modulo a set of equations
SIAM Journal on Computing
Complexity of matching problems
Journal of Symbolic Computation
Compilation of pattern matching with associative-commutative functions
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Handbook of theoretical computer science (vol. B)
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
A meta-environment for generating programming environments
ACM Transactions on Software Engineering and Methodology (TOSEM)
Journal of Automated Reasoning
Tree automata help one to solve equational formulae in AC-theories
Journal of Symbolic Computation
Information and Computation
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Term rewriting and all that
Rule-based constraint programming
Fundamenta Informaticae - Special issue on foundations of constraint programming
Building constraint satisfaction problem solvers using rewrite rules and strategies
Fundamenta Informaticae - Special issue on foundations of constraint programming
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
A Compiler for Rewrite Programs in Associative-Commutative Theories
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Associative-Commutative Discrimination Nets
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Implementation of Higher-Order Unification Based on Calculus of Explicit Substitution
SOFSEM '95 Proceedings of the 22nd Seminar on Current Trends in Theory and Practice of Informatics
Saturation of First-Order (Constrained) Clauses with the Saturate System
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Prototyping Completion with Constraints Using Computational Systems
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
On Proving Termination by Innermost Termination
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Prototyping Combination of Unification Algorithms with the ELAN Rule-Based Programming Language
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course
Merging Monads and Folds for Functional Programming
Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text
COLETTE, Prototyping CSP Solvers Using a Rule-Based Language
AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
Journal of Automated Reasoning
Journal of Functional Programming
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Simplification and termination of strategies in rule-based languages
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Proving termination of membership equational programs
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
SBCCI '04 Proceedings of the 17th symposium on Integrated circuits and system design
Operational termination of conditional term rewriting systems
Information Processing Letters
ACM Transactions on Design Automation of Electronic Systems (TODAES)
A rewriting logic framework for operational semantics of membrane systems
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Strategies and simulations in a semantic framework
Journal of Algorithms
Algebraic Stuttering Simulations
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving operational termination of membership equational programs
Higher-Order and Symbolic Computation
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Theoretical Computer Science
Computational Logical Frameworks and Generic Program Analysis Technologies
Verified Software: Theories, Tools, Experiments
MTT: The Maude Termination Tool (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
The Chemical Reaction Model Recent Developments and Prospects
Software-Intensive Systems and New Computing Paradigms
A rewriting logic approach to operational semantics
Information and Computation
Action Control by Term Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
A Modular Equational Generalization Algorithm
Logic-Based Program Synthesis and Transformation
Strategy-Based Proof Calculus for Membrane Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A Rewriting Semantics for Maude Strategies
Electronic Notes in Theoretical Computer Science (ENTCS)
Invariant-driven specifications in Maude
Science of Computer Programming
Automated deduction for verification
ACM Computing Surveys (CSUR)
Web Services and Interoperability for the Maude Termination Tool
Electronic Notes in Theoretical Computer Science (ENTCS)
Methods for Proving Termination of Rewriting-based Programming Languages by Transformation
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving Modal Properties of Rewrite Theories Using Maude's Metalevel
Electronic Notes in Theoretical Computer Science (ENTCS)
Modular Rewriting Semantics in Practice
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Strategy Language for Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
A fold/unfold transformation framework for rewrite theories extended to CCT
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Operational termination of conditional term rewriting systems
Information Processing Letters
A survey of strategies in rule-based program transformation systems
Journal of Symbolic Computation
Associative-commutative rewriting on large terms
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Dynamic event-based access control as term rewriting
Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
An integrated framework for the diagnosis and correction of rule-based programs
Theoretical Computer Science
Incremental checking of well-founded recursive specifications modulo axioms
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Term rewriting for access control
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Rule-based programming and proving: the ELAN experience outcomes
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Natural rewriting for general term rewriting systems
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Theoroidal maps as algebraic simulations
WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques
Natural narrowing for general term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
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
A timed mobility semantics based on rewriting strategies
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
Taming distributed system complexity through formal patterns
Science of Computer Programming
| Hi-index | 0.00 |
ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or to describe and execute deterministic as well as non-deterministic rule-based processes. With the general goal to make precise a rewriting logic-based semantics of ELAN, this paper has three contributions: a presentation of the concepts of rules and strategies available in ELAN, an expression of rewrite rules with matching conditions in conditional rewriting logic, and finally an enrichment mechanism of a rewrite theory into a strategy theory in conditional rewriting logic.