ELAN

swMATH2179MaRDI QIDQ14723FDOQ14723

Author name not available (Why is that?)

Official website: http://elan.loria.fr

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

• Reachability analysis of term rewriting systems with Timbuk
• Verifying an infinite systolic algorithm using third-order equational methods
• 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?)
• Proof search and proof check for equational and inductive theorems.
• A rewriting logic approach to operational semantics
• Proving weak properties of rewriting
• Rewriting strategies and strategic rewrite programs
• Sharing in the graph rewriting calculus
• 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?)
• Correctness of dataflow and systolic algorithms using algebras of streams
• An update calculus for expressing type-safe program updates
• Title not available (Why is that?)
• Handbook of constraint programming.
• Specification of real-time and hybrid systems in rewriting logic
• Computationally Equivalent Elimination of Conditions
• Title not available (Why is that?)
• Term rewriting with type-safe traversal functions
• An integrated framework for the diagnosis and correction of rule-based programs
• Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
• Reachability in conditional term rewriting systems
• Strategy based semantics for mobility with time and access permissions
• Higher-order matching for program transformation
• External rewriting for skeptical proof assistants
• HasCasl
• Tiburon
• CLAIRE
• OBJ3
• CafeOBJ
• Maude
• Timbuk
• PORGY
• Automated Reasoning
• FSA
• PMaude
• Kima
• Kernel-LEAF
• Polyp
• TeaBag
• CARIBOO
• JITty
• Tom
• VMTL
• ASF+SDF
• TXL
• visone
• Conditional Confluence
• SmallEiffel
• LOTOSphere
• KIDS
• A survey of strategies in rule-based program transformation systems
• bc
• DiSCiPl
• UNITS
• MOSBIE
• Complete Categorical Deduction for Satisfaction as Injectivity
• GP 2
• 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
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maude: specification and programming in rewriting logic
• 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
• Title not available (Why is that?)
• Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associative-commutative theories
• The use of a strategy language for solving search problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recent Trends in Algebraic Development Techniques
• Rewriting, inference, and proof
• 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
• The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
• Title not available (Why is that?)

This page was built for software: ELAN