All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
From MaRDI portal
(Redirected from Publication:997833)
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70) Distributed systems (68M14)
Recommendations
Cited in
(only showing first 100 items - show all)- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
- Order-Sorted Parameterization and Induction
- On Ground Convergence and Completeness of Conditional Equational Program Hierarchies
- Constructor-based institutions
- An evaluation of interaction paradigms for active objects
- Invariant-driven specifications in Maude
- Complexity of conditional term rewriting
- A rewriting semantics for Maude strategies
- Automated deduction and knowledge management in geometry
- scientific article; zbMATH DE number 1515853 (Why is no real title available?)
- Compositional reasoning about active objects with shared futures
- A probabilistic approximate logic for neuro-symbolic learning and reasoning
- Backward trace slicing for rewriting logic theories
- Replicated data types that unify eventual consistency and observable atomic consistency
- P systems with control nuclei: the concept
- An executable semantics of clock constraint specification language and its applications
- Using context-sensitive rewriting for proving innermost termination of rewriting
- Order-Sorted Rewriting and Congruence Closure
- Derivational complexity and context-sensitive Rewriting
- Declarative Debugging of Membership Equational Logic Specifications
- A process calculus BigrTiMo of mobile systems and its formal semantics
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy
- Checking Sufficient Completeness by Inductive Theorem Proving
- Symbolic execution based on language transformation
- A Modular Equational Generalization Algorithm
- Sentence-normalized conditional narrowing modulo in rewriting logic and Maude
- Interpreting abstract interpretations in membership equational logic
- A formalisation of deep metamodelling
- Debugging Maude programs via runtime assertion checking and trace slicing
- Equational formulas and pattern operations in initial order-sorted algebras
- Formalizing and analyzing security ceremonies with heterogeneous devices in ANP and PDL
- Strict coherence of conditional rewriting modulo axioms
- Closure via functional dependence simplification
- Equational formulas and pattern operations in initial order-sorted algebras
- A formal approach to the engineering of domain-specific distributed systems
- Termination of narrowing revisited
- On the accuracy of formal verification of selective defenses for TDoS attacks
- A modular order-sorted equational generalization algorithm
- On the Specification and Verification of Model Transformations
- Modeling and analyzing mobile ad hoc networks in Real-Time Maude
- Combining runtime checking and slicing to improve Maude error diagnosis
- From rewriting logic, to programming language semantics, to program verification
- Formalization and correctness of the PALS architectural pattern for distributed real-time systems
- Bounded ACh unification
- A complete declarative debugger for Maude
- Compositional specification in rewriting logic
- Symbolic reasoning methods in rewriting logic and Maude
- Data-driven modeling of Alzheimer disease pathogenesis
- What Is a Multi-modeling Language?
- Executable rewriting logic semantics of Orc and formal analysis of Orc programs
- Applications and extensions of context-sensitive rewriting
- Strategy-based proof calculus for membrane systems
- Runtime complexity analysis of logically constrained rewriting
- Formal analysis of leader election in MANETs using Real-Time Maude
- Variant-Based Satisfiability in Initial Algebras
- Structural induction in institutions
- Termination Modulo Combinations of Equational Theories
- Use of logical models for proving operational termination in general logics
- scientific article; zbMATH DE number 2043522 (Why is no real title available?)
- Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs
- Context-sensitive dependency pairs
- How to prove decidability of equational theories with second-order computation analyser SOL
- Automatic generation of logical models with AGES
- Multiset rewriting for the verification of depth-bounded processes with name binding
- Program equivalence by circular reasoning
- The rewriting logic semantics project: a progress report
- The rewriting logic semantics project: a progress report
- Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
- Normal forms and normal theories in conditional rewriting
- Termination criteria for tree automata completion
- ACUOS: a system for modular ACU generalization with subtyping and inheritance
- An algebraic semantics for MOF
- Matching logic: an alternative to Hoare/Floyd logic
- A generic framework for symbolic execution: a coinductive approach
- Comparing three coordination models: Reo, ARC, and PBRD
- Simulation and verification of synchronous set relations in rewriting logic
- A functional framework for agent-based models of exchange
- HasCasl: integrated higher-order specification and program development
- Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude
- Software Model Checking for Mobile Security – Collusion Detection in $$\mathbb {K}$$K
- A compact fixpoint semantics for term rewriting systems
- Declarative Debugging of Rewriting Logic Specifications
- Integrating Maude into Hets
- The \textsf{tccp} interpreter
- Using the Maude term rewriting language for agent development with formal foundations
- A rewriting-based model checker for the linear temporal logic of rewriting
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
- Operational termination of conditional rewriting with built-in numbers and semantic data structures
- Language definitions as rewrite theories
- Declarative debugging of rewriting logic specifications
- Methods for proving termination of rewriting-based programming languages by transformation
- A rewriting logic approach to operational semantics
- Rewriting strategies and strategic rewrite programs
- Operational termination of membership equational programs: the order-sorted way
- Equational abstractions
- Amalgamation of domain specific languages with behaviour
- Dependency pairs for proving termination properties of conditional term rewriting systems
- Rewriting modulo SMT and open system analysis
- Order-sorted generalization
- Circular coinduction: a proof theoretical foundation
This page was built for publication: All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997833)
