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 rewriting logic semantics project: a progress report
- Proving termination properties with \textsc{mu-term}
- Compositional specification in rewriting logic
- The rewriting logic semantics project: a progress report
- Multiset rewriting for the verification of depth-bounded processes with name binding
- Generalized rewrite theories, coherence completion, and symbolic methods
- Operational termination of conditional rewriting with built-in numbers and semantic data structures
- Twenty years of rewriting logic
- Operational termination of membership equational programs: the order-sorted way
- Abstract contract synthesis and verification in the symbolic \(\mathbb{K}\) framework
- Strict coherence of conditional rewriting modulo axioms
- Simulation and verification of synchronous set relations in rewriting logic
- A rewriting framework and logic for activities subject to regulations
- A Modular Equational Generalization Algorithm
- Symbolic computation in Maude: some tapas
- Stability of termination and sufficient-completeness under pushouts via amalgamation
- Automatic generation of logical models with AGES
- Hierarchical design rewriting with Maude
- Equational formulas and pattern operations in initial order-sorted algebras
- Building a Modal Interface Theory for Concurrency and Data
- An algebraic approach to simulation and verification for cyber-physical systems with shared-variable concurrency
- CRYSTAL framework: cybersecurity assurance for cyber-physical systems
- Building correct-by-construction systems with formal patterns
- Runtime composition of systems of interacting cyber-physical components
- SpeX: a rewriting-based formal specification environment
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- An evaluation of interaction paradigms for active objects
- Combining graph transformation and algebraic specification into model transformation
- Equational formulas and pattern operations in initial order-sorted algebras
- mu-term: Verify Termination Properties Automatically (System Description)
- Ground confluence of order-sorted conditional specifications modulo axioms
- Structural induction in institutions
- An executable semantics of clock constraint specification language and its applications
- A timed semantics of Orc
- Rewriting-based repairing strategies for XML repositories
- Read atomic transactions with prevention of lost updates: ROLA and its formal analysis
- An algebraic semantics for MOF
- A rewriting logic approach to operational semantics
- Alice and Bob meet equational theories
- Algebraic reinforcement learning. Hypothesis induction for relational reinforcement learning using term generalization.
- Metalevel algorithms for variant satisfiability
- A symbolic transformation language and its application to a multiscale method
- An Institution for Imperative RSL Specifications
- Session-based concurrency in Maude: executable semantics and type checking
- Towards Modelling Actor-Based Concurrency in Term Rewriting
- Local confluence of conditional and generalized term rewriting systems
- Formal modeling of multi-viewpoint ontology alignment by mappings composition
- Model checking TLR* guarantee formulas on infinite systems
- Using well-founded relations for proving operational termination
- CafeOBJ Traces
- Rewriting strategies and strategic rewrite programs
- Automatic synthesis of logical models for order-sorted first-order theories
- Executable Semantics and Type Checking for Session-Based Concurrency in Maude
- A functional framework for agent-based models of exchange
- Equational abstractions in rewriting logic and Maude
- P systems with control nuclei: the concept
- \( \mathbb{K}\) and KIV: towards deductive verification for arbitrary programming languages
- Generating symmetric and alternating groups
- Termination of narrowing revisited
- Formalization and correctness of the PALS architectural pattern for distributed real-time systems
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
- Rewriting semantics of production rule sets
- Symbolic execution based on language transformation
- Complexity of conditional term rewriting
- A semantic model for interacting cyber-physical systems
- Declarative Debugging of Rewriting Logic Specifications
- Resource provisioning strategies for BPMN processes: specification and analysis using Maude
- Closure via functional dependence simplification
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy
- Matching logic: an alternative to Hoare/Floyd logic
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
- A Decision Procedure for Bisimilarity of Generalized Regular Expressions
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
- Equational logic and categorical semantics for multi-languages
- Verifying hierarchical Ptolemy II discrete-event models using real-time maude
- A rewriting-based model checker for the linear temporal logic of rewriting
- Runtime complexity analysis of logically constrained rewriting
- Formal modeling and validation of a power-efficient grouping protocol for WSNs
- A Proof Score Approach to Formal Verification of an Imperative Programming Language Compiler
- Probabilistic real-time rewrite theories and their expressive power
- Modeling and analyzing mobile ad hoc networks in Real-Time Maude
- CLP(\(\mathsf{H}\)): constraint logic programming for hedges
- Software Model Checking for Mobile Security – Collusion Detection in $$\mathbb {K}$$K
- MTT: The Maude Termination Tool (System Description)
- Hardware Trojan detection via rewriting logic
- Automated deduction and knowledge management in geometry
- A process calculus BigrTiMo of mobile systems and its formal semantics
- Variadic equational matching in associative and commutative theories
- Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude
- Applications and extensions of context-sensitive rewriting
- Patterns for Maude metalanguage applications
- Verifying Reachability-Logic Properties on Rewriting-Logic Specifications
- Strategies, model checking and branching-time properties in Maude
- A formalisation of deep metamodelling
- Debugging Maude programs via runtime assertion checking and trace slicing
- Graph-Based Design and Analysis of Dynamic Software Architectures
- An integrated framework for the diagnosis and correction of rule-based programs
- Detection and diagnosis of deviations in distributed systems of autonomous agents
- scientific article; zbMATH DE number 2043522 (Why is no real title available?)
- Strategy-based proof calculus for membrane systems
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)
