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)- 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
- Formal modeling and validation of a power-efficient grouping protocol for WSNs
- A Decision Procedure for Bisimilarity of Generalized Regular Expressions
- A rewriting framework and logic for activities subject to regulations
- Algebraic simulations
- An integrated framework for the diagnosis and correction of rule-based programs
- Maude
- Verifying hierarchical Ptolemy II discrete-event models using real-time maude
- SOS rule formats for idempotent terms and idempotent unary operators
- Programming in biomolecular computation
- A generic framework for \(n\)-protocol compatibility checking
- scientific article; zbMATH DE number 1569122 (Why is no real title available?)
- Weak bisimulation as a congruence in MSOS
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Abstract Certification of Global Non-interference in Rewriting Logic
- Abstract contract synthesis and verification in the symbolic \(\mathbb{K}\) framework
- Rewriting semantics of production rule sets
- Rewriting-based repairing strategies for XML repositories
- MTT: The Maude Termination Tool (System Description)
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
- A declarative debugger for Maude functional modules
- Efficient general unification for XOR with homomorphism
- A Maude environment for CafeOBJ
- Automatic synthesis of logical models for order-sorted first-order theories
- Proving termination properties with \textsc{mu-term}
- Verifying Reachability-Logic Properties on Rewriting-Logic Specifications
- Exploring conditional rewriting logic computations
- A formal library of set relations and its application to synchronous languages
- A language-based approach to modelling and analysis of Twitter interactions
- Assertion-based analysis via slicing withABETS(system description)
- An overview of the K semantic framework
- Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description)
- Twenty years of rewriting logic
- Coinduction for preordered algebra
- Completeness of context-sensitive rewriting
- Integrating deployment architectures and resource consumption in timed object-oriented models
- A timed semantics of Orc
- Efficient general AGH-unification
- 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
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)
