The following pages link to Maude (Q18367):
Displaying 50 items.
- Explaining safety failures in NetKAT (Q2043810) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- Analysing an autonomous tramway positioning system with the \textsc{Uppaal} statistical model checker (Q2065535) (← links)
- Derivational complexity and context-sensitive Rewriting (Q2069872) (← links)
- A semantic model for interacting cyber-physical systems (Q2079682) (← links)
- Reasoning about block-based cloud storage systems via separation logic (Q2087457) (← links)
- A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems (Q2095424) (← links)
- Composition of multilevel domain-specific modelling languages (Q2095431) (← links)
- Symbolic computation in Maude: some tapas (Q2119100) (← links)
- Runtime complexity analysis of logically constrained rewriting (Q2119101) (← links)
- Pattern eliminating transformations (Q2119103) (← links)
- A complete semantics of \(\mathbb{K}\) and its translation to Isabelle (Q2119971) (← links)
- Equational logic and categorical semantics for multi-languages (Q2133469) (← links)
- Order-sorted equational generalization algorithm revisited (Q2134938) (← links)
- Hardware Trojan detection via rewriting logic (Q2141287) (← links)
- Birkhoff completeness for hybrid-dynamic first-order logic (Q2180522) (← links)
- Introducing \(H\), an institution-based formal specification and verification language (Q2183716) (← links)
- Efficient safety enforcement for Maude programs via program specialization in the \textsf{ÁTAME} system (Q2209262) (← links)
- Stability of termination and sufficient-completeness under pushouts via amalgamation (Q2215962) (← links)
- Leveraging the information contained in theory presentations (Q2219380) (← links)
- The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques (Q2228436) (← links)
- Strategies, model checking and branching-time properties in Maude (Q2239275) (← links)
- Resource provisioning strategies for BPMN processes: specification and analysis using Maude (Q2239276) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- Verification of multi-agent systems with timeouts for migration and communication (Q2279119) (← links)
- Proving semantic properties as first-order satisfiability (Q2289018) (← links)
- Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
- Programming and symbolic computation in Maude (Q2291818) (← links)
- A partial evaluation framework for order-sorted equational programs modulo axioms (Q2291823) (← links)
- A formal approach to the engineering of domain-specific distributed systems (Q2291825) (← links)
- Ground confluence of order-sorted conditional specifications modulo axioms (Q2291829) (← links)
- \({\mathsf{ACUOS}}^\mathbf{2}\): a high-performance system for modular ACU generalization with subtyping and inheritance (Q2296704) (← links)
- Using well-founded relations for proving operational termination (Q2303238) (← links)
- Finding intruder knowledge with cap-matching (Q2303360) (← links)
- Symbolic timed trace equivalence (Q2303366) (← links)
- Automatic generation of logical models with AGES (Q2305421) (← links)
- ROLA: a new distributed transaction protocol and its formal analysis (Q2324186) (← links)
- Dynamic structural operational semantics (Q2329443) (← links)
- Read atomic transactions with prevention of lost updates: ROLA and its formal analysis (Q2335948) (← links)
- Bounded memory protocols (Q2339157) (← links)
- Executable rewriting logic semantics of Orc and formal analysis of Orc programs (Q2348797) (← links)
- Strategies for combining decision procedures (Q2368951) (← links)
- Executable structural operational semantics in Maude (Q2369036) (← links)
- On the collective sort problem for distributed tuple spaces (Q2389341) (← links)
- Executing and verifying higher-order functional-imperative programs in Maude (Q2409629) (← links)
- Partial evaluation of order-sorted equational programs modulo axioms (Q2409722) (← links)
- Metalevel algorithms for variant satisfiability (Q2413027) (← links)
- Rewriting-based repairing strategies for XML repositories (Q2436514) (← links)
- SOS rule formats for idempotent terms and idempotent unary operators (Q2436519) (← links)
- A modular order-sorted equational generalization algorithm (Q2437800) (← links)
