Pages that link to "Item:Q997833"
From MaRDI portal
The following pages link to All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM. (Q997833):
Displaying 50 items.
- On the accuracy of formal verification of selective defenses for TDoS attacks (Q1683703) (← links)
- An evaluation of interaction paradigms for active objects (Q1734521) (← links)
- Symbolic execution based on language transformation (Q1749128) (← links)
- Data-driven modeling of Alzheimer disease pathogenesis (Q1786817) (← links)
- Symbolic reasoning methods in rewriting logic and Maude (Q1799269) (← 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)
- Rewriting semantics of production rule sets (Q1931912) (← links)
- Verifying hierarchical Ptolemy II discrete-event models using real-time maude (Q1951606) (← links)
- Formalizing and analyzing security ceremonies with heterogeneous devices in ANP and PDL (Q1979966) (← links)
- Automated deduction and knowledge management in geometry (Q1995808) (← links)
- A process calculus BigrTiMo of mobile systems and its formal semantics (Q2026376) (← links)
- Variadic equational matching in associative and commutative theories (Q2029000) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- Derivational complexity and context-sensitive Rewriting (Q2069872) (← links)
- A semantic model for interacting cyber-physical systems (Q2079682) (← 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)
- Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description) (Q2104541) (← links)
- Symbolic computation in Maude: some tapas (Q2119100) (← links)
- Runtime complexity analysis of logically constrained rewriting (Q2119101) (← links)
- Equational logic and categorical semantics for multi-languages (Q2133469) (← links)
- Hardware Trojan detection via rewriting logic (Q2141287) (← links)
- On the complexity of verification of time-sensitive distributed systems (Q2154017) (← links)
- Joshua Guttman: pioneering strand spaces (Q2154021) (← links)
- Introducing \(H\), an institution-based formal specification and verification language (Q2183716) (← links)
- Parameterized strategies specification in Maude (Q2185882) (← links)
- Stability of termination and sufficient-completeness under pushouts via amalgamation (Q2215962) (← links)
- The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques (Q2228436) (← links)
- \( \mathbb{K}\) and KIV: towards deductive verification for arbitrary programming languages (Q2237340) (← 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 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 formal approach to the engineering of domain-specific distributed systems (Q2291825) (← links)
- Ground confluence of order-sorted conditional specifications modulo axioms (Q2291829) (← links)
- Using well-founded relations for proving operational termination (Q2303238) (← links)
- Automatic generation of logical models with AGES (Q2305421) (← links)
- Read atomic transactions with prevention of lost updates: ROLA and its formal analysis (Q2335948) (← links)
- Executable rewriting logic semantics of Orc and formal analysis of Orc programs (Q2348797) (← links)
- Executing and verifying higher-order functional-imperative programs in Maude (Q2409629) (← 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)
- A symbolic transformation language and its application to a multiscale method (Q2447638) (← links)
- Equational formulas and pattern operations in initial order-sorted algebras (Q2628298) (← links)
- A probabilistic approximate logic for neuro-symbolic learning and reasoning (Q2667187) (← links)
