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.
- Maude (Q18367) (← links)
- Amalgamation of domain specific languages with behaviour (Q347380) (← links)
- Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
- Rewriting modulo SMT and open system analysis (Q347384) (← links)
- The rewriting logic semantics project: a progress report (Q393080) (← links)
- A functional framework for agent-based models of exchange (Q426933) (← links)
- A generic framework for \(n\)-protocol compatibility checking (Q433347) (← links)
- Formal modeling and validation of a power-efficient grouping protocol for WSNs (Q444471) (← links)
- Efficient general AGH-unification (Q462489) (← links)
- Completeness of context-sensitive rewriting (Q477588) (← links)
- Integrating deployment architectures and resource consumption in timed object-oriented models (Q478391) (← links)
- Exploring conditional rewriting logic computations (Q485831) (← links)
- Program equivalence by circular reasoning (Q493521) (← links)
- A generic framework for symbolic execution: a coinductive approach (Q507361) (← links)
- A language-based approach to modelling and analysis of Twitter interactions (Q511939) (← links)
- A Maude environment for CafeOBJ (Q520244) (← links)
- An integrated framework for the diagnosis and correction of rule-based programs (Q604477) (← links)
- Comparing three coordination models: Reo, ARC, and PBRD (Q608351) (← links)
- Coinduction for preordered algebra (Q627121) (← links)
- A formal library of set relations and its application to synchronous languages (Q654904) (← links)
- Strict coherence of conditional rewriting modulo axioms (Q683741) (← links)
- Multiset rewriting for the verification of depth-bounded processes with name binding (Q714507) (← links)
- Formalization and correctness of the PALS architectural pattern for distributed real-time systems (Q714796) (← links)
- Structural induction in institutions (Q719243) (← links)
- Termination criteria for tree automata completion (Q730470) (← links)
- Modeling and analyzing mobile ad hoc networks in Real-Time Maude (Q730472) (← links)
- Normal forms and normal theories in conditional rewriting (Q730473) (← links)
- Language definitions as rewrite theories (Q730476) (← links)
- A formalisation of deep metamodelling (Q736852) (← links)
- Debugging Maude programs via runtime assertion checking and trace slicing (Q739630) (← links)
- Replicated data types that unify eventual consistency and observable atomic consistency (Q780057) (← links)
- Invariant-driven specifications in Maude (Q838161) (← links)
- Algebraic simulations (Q844884) (← links)
- Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic (Q875516) (← links)
- Compositional reasoning about active objects with shared futures (Q890481) (← links)
- A timed semantics of Orc (Q935476) (← links)
- Equational abstractions (Q944377) (← links)
- An algebraic semantics for MOF (Q973052) (← links)
- P systems with control nuclei: the concept (Q987966) (← links)
- An overview of the K semantic framework (Q987974) (← links)
- A compact fixpoint semantics for term rewriting systems (Q987981) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude (Q1004068) (← links)
- HasCasl: integrated higher-order specification and program development (Q1006648) (← links)
- A rewriting logic approach to operational semantics (Q1012130) (← links)
- Termination of narrowing revisited (Q1035697) (← links)
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy (Q1044842) (← links)
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← 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)
