The following pages link to ELAN (Q14723):
Displaying 50 items.
- Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
- Proving weak properties of rewriting (Q554217) (← links)
- Reachability analysis over term rewriting systems (Q556686) (← links)
- An integrated framework for the diagnosis and correction of rule-based programs (Q604477) (← links)
- Two case studies of semantics execution in Maude: CCS and LOTOS (Q816216) (← links)
- A \(\rho\)-calculus of explicit constraint application (Q880989) (← links)
- Strategy based semantics for mobility with time and access permissions (Q890480) (← links)
- The metafront system: safe and extensible parsing and transformation (Q995468) (← links)
- An update calculus for expressing type-safe program updates (Q997231) (← links)
- A rewriting logic approach to operational semantics (Q1012130) (← links)
- Typed generic traversal with term rewriting strategies (Q1394988) (← links)
- The use of a strategy language for solving search problems (Q1601858) (← links)
- ELAN from a rewriting logic point of view (Q1608914) (← links)
- Maude: specification and programming in rewriting logic (Q1608917) (← links)
- Reflection in conditional rewriting logic (Q1608918) (← links)
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic (Q1608920) (← links)
- Specification of real-time and hybrid systems in rewriting logic (Q1608921) (← links)
- Rewriting logic: Roadmap and bibliography (Q1615001) (← links)
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← links)
- Context-sensitive rewriting strategies (Q1854569) (← links)
- External rewriting for skeptical proof assistants (Q1868511) (← links)
- GC\(^{2}\): a generational conservative garbage collector for the ATERM library (Q1885928) (← links)
- Manipulating algebraic specifications with term-based and graph-based representations (Q1885933) (← links)
- Programming and symbolic computation in Maude (Q2291818) (← links)
- Strategies for combining decision procedures (Q2368951) (← links)
- Labelled graph strategic rewriting for social networks (Q2413024) (← links)
- A survey of strategies in rule-based program transformation systems (Q2456575) (← links)
- Verifying an infinite systolic algorithm using third-order equational methods (Q2500698) (← links)
- Termination and normalisation under strategy proofs in ELAN (Q2703693) (← links)
- Rewriting logic as a framework for generic verification tools (Q2703694) (← links)
- ASF+SDF parsing tools applied to ELAN (Q2703695) (← links)
- Handling relations over finite domains in the rule-based system ELAN (Q2703698) (← links)
- Maude versus Haskell: An experimental comparison in security protocol analysis (Q2703702) (← links)
- The rewriting calculus. II (Q2720294) (← links)
- (Q2722018) (← links)
- (Q2723425) (← links)
- A formal approach to object-oriented software engineering (Q2723569) (← links)
- (Q2723887) (← links)
- (Q2723907) (← links)
- Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associative-commutative theories (Q2740996) (← links)
- (Q2762632) (← links)
- (Q2778872) (← links)
- Combining higher-order and first-order computation using \(\rho\)-calculus: Towards a semantics of ELAN (Q2782483) (← links)
- Labelled Graph Rewriting Meets Social Networks (Q2827834) (← links)
- Generic type-preserving traversal strategies (Q2841223) (← links)
- A survey of rewriting strategies in program transformation systems (Q2841225) (← links)
- Induction for termination with local strategies (Q2841240) (← links)
- Certifying term rewriting proofs in ELAN (Q2841249) (← links)
- Applying ELAN strategies in simulating processors over simple architectures (Q2843608) (← links)
- Term rewriting with type-safe traversal functions (Q2843609) (← links)
