ELAN

swMATH2179MaRDI QIDQ14723FDOQ14723

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Title not available (Why is that?)
• Reachability in Conditional Term Rewriting Systems
• Verifying an infinite systolic algorithm using third-order equational methods
• The use of a strategy language for solving search problems
• Title not available (Why is that?)
• Two case studies of semantics execution in Maude: CCS and LOTOS
• Reflection in conditional rewriting logic
• Title not available (Why is that?)
• Recent Trends in Algebraic Development Techniques
• A rewriting logic approach to operational semantics
• Proving weak properties of rewriting
• Title not available (Why is that?)
• Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
• Title not available (Why is that?)
• Typed generic traversal with term rewriting strategies
• A \(\rho\)-calculus of explicit constraint application
• An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reachability Analysis of Term Rewriting Systems with Timbuk
• Correctness of dataflow and systolic algorithms using algebras of streams
• The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
• An update calculus for expressing type-safe program updates
• Title not available (Why is that?)
• Specification of real-time and hybrid systems in rewriting logic
• Strategies for combining decision procedures
• Computationally Equivalent Elimination of Conditions
• Title not available (Why is that?)
• ASF+SDF parsing tools applied to ELAN
• Handling relations over finite domains in the rule-based system ELAN
• Rewriting logic as a framework for generic verification tools
• Termination and normalisation under strategy proofs in ELAN
• Term rewriting with type-safe traversal functions
• Combining higher-order and first-order computation using \(\rho\)-calculus: Towards a semantics of ELAN
• An integrated framework for the diagnosis and correction of rule-based programs
• Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
• Rewriting Strategies and Strategic Rewrite Programs
• Sharing in the Graph Rewriting Calculus
• Strategy based semantics for mobility with time and access permissions
• Higher-order matching for program transformation
• External rewriting for skeptical proof assistants
• Automated Reasoning
• A survey of strategies in rule-based program transformation systems
• Complete Categorical Deduction for Satisfaction as Injectivity
• ELAN from a rewriting logic point of view
• Tiburon: A Weighted Tree Automata Toolkit
• The metafront system: safe and extensible parsing and transformation
• Title not available (Why is that?)
• The rewriting calculus. II
• Title not available (Why is that?)
• Dependency pairs for proving termination properties of conditional term rewriting systems
• Search and strategies in OPL
• Title not available (Why is that?)
• Induction for termination with local strategies
• Outermost ground termination
• Maude versus Haskell: An experimental comparison in security protocol analysis
• Reachability analysis over term rewriting systems
• Rewriting, Inference, and Proof
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maude: specification and programming in rewriting logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
• Title not available (Why is that?)
• Context-sensitive rewriting strategies
• Rewriting logic: Roadmap and bibliography
• GC\(^{2}\): a generational conservative garbage collector for the ATERM library
• Automated Deduction – CADE-19
• Title not available (Why is that?)
• Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associative-commutative theories
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Manipulating algebraic specifications with term-based and graph-based representations
• Title not available (Why is that?)
• A survey of rewriting strategies in program transformation systems
• Title not available (Why is that?)
• Labelled graph strategic rewriting for social networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Programming and symbolic computation in Maude
• Title not available (Why is that?)
• Labelled Graph Rewriting Meets Social Networks
• Title not available (Why is that?)
• Strategic port graph rewriting: an interactive modelling framework
• A formal approach to object-oriented software engineering
• Certifying term rewriting proofs in ELAN
• Applying ELAN strategies in simulating processors over simple architectures
• Generic type-preserving traversal strategies
• The control layer in open mechanized reasoning systems: Annotations and tactics

This page was built for software: ELAN