The following pages link to Maude (Q18367):
Displaying 50 items.
- Specification and verification of the tree identify protocol of IEEE 1394 in rewriting logic (Q1402473) (← links)
- Rewriting techniques and applications. 14th international conference, RTA 2003, Valencia, Spain, June 9--11, 2003. Proceedings (Q1418343) (← links)
- Algebraic models of correctness for abstract pipelines. (Q1426058) (← links)
- Dynamic connectors for concurrency (Q1603689) (← links)
- ELAN from a rewriting logic point of view (Q1608914) (← links)
- Reflection in conditional rewriting logic (Q1608918) (← links)
- Logical foundations of CafeOBJ (Q1608919) (← 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)
- A Maude specification of an object-oriented model for telecommunication networks (Q1608922) (← links)
- Actor theories in rewriting logic (Q1608923) (← links)
- Equational rules for rewriting logic (Q1608925) (← links)
- A formal approach to object-oriented software engineering (Q1608926) (← links)
- Rewriting logic: Roadmap and bibliography (Q1615001) (← links)
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← links)
- Upward refinement operators for conceptual blending in the description logic \(\mathcal{EL}^{++}\) (Q1653445) (← links)
- Sentence-normalized conditional narrowing modulo in rewriting logic and Maude (Q1655486) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Inferring safe Maude programs with ÁTAME (Q1662189) (← links)
- A formal proof generator from semi-formal proof documents (Q1675786) (← links)
- Improved support vector machine algorithm for heterogeneous data (Q1678705) (← links)
- On the accuracy of formal verification of selective defenses for TDoS attacks (Q1683703) (← links)
- On combining algebraic specifications with first-order logic via Athena (Q1697091) (← links)
- From hidden to visible: a unified framework for transforming behavioral theories into rewrite theories (Q1704601) (← links)
- Executable component-based semantics (Q1734523) (← links)
- Symbolic execution based on language transformation (Q1749128) (← links)
- Data-driven modeling of Alzheimer disease pathogenesis (Q1786817) (← links)
- Fast machine words in Isabelle/HOL (Q1791180) (← links)
- A coinductive approach to proving reachability properties in logically constrained term rewriting systems (Q1799091) (← links)
- Normal forms for algebras of connections. (Q1853455) (← links)
- Automata-driven automated induction (Q1854445) (← links)
- Functorial models for Petri nets (Q1854467) (← links)
- An overview of the runtime verification tool Java PathExplorer (Q1878923) (← links)
- Structured theories and institutions (Q1884906) (← links)
- The transient combinator, higher-order strategies, and the distributed data problem (Q1887674) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (Q1931906) (← links)
- Declarative debugging of rewriting logic specifications (Q1931907) (← links)
- Folding variant narrowing and optimal variant termination (Q1931909) (← links)
- Rewriting semantics of production rule sets (Q1931912) (← links)
- Verifying hierarchical Ptolemy II discrete-event models using real-time maude (Q1951606) (← links)
- Specification and proof in membership equational logic (Q1978640) (← links)
- Formalizing and analyzing security ceremonies with heterogeneous devices in ANP and PDL (Q1979966) (← links)
- Travelling salesman problem in tissue P systems with costs (Q1983010) (← links)
- Synchronous products of rewrite systems (Q1990506) (← links)
- Automated deduction and knowledge management in geometry (Q1995808) (← links)
- Well-structuredness, safeness and soundness: a formal classification of BPMN collaborations (Q1996863) (← links)
- A process calculus BigrTiMo of mobile systems and its formal semantics (Q2026376) (← links)
- Variadic equational matching in associative and commutative theories (Q2029000) (← links)
- CiMPG+F: a proof generator and fixer-upper for CafeOBJ specifications (Q2037935) (← links)
