Maude

swMATH6233MaRDI QIDQ18367FDOQ18367

Author name not available (Why is that?)

Described by source

• Maude: specification and programming in rewriting logic
• Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description)
• Towards Maude 2. 0
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.

Cited In (only showing first 100 items - show all)

• Mechanical Approach to Linking Operational Semantics and Algebraic Semantics for Verilog Using Maude
• Title not available (Why is that?)
• Twenty years of rewriting logic
• CiMPG+F: a proof generator and fixer-upper for CafeOBJ specifications
• Explaining safety failures in NetKAT
• Modelling and analysing neural networks using a hybrid process algebra
• \({\mathsf{ACUOS}}^\mathbf{2}\): a high-performance system for modular ACU generalization with subtyping and inheritance
• Automatic generation of logical models with AGES
• A scalable module system
• Proving operational termination of membership equational programs
• Contracts as games on event structures
• Functional and Logic Programming
• A rewriting logic approach to operational semantics
• A rewriting semantics for a software architecture description language
• Computer Aided Verification
• Mumbo: a rule-based implementation of a run-time program generation language
• A rewriting logic framework for soft constraints
• Programming in Biomolecular Computation
• Algebraic Methodology and Software Technology
• Title not available (Why is that?)
• Semantic foundations for generalized rewrite theories
• SOS formats and meta-theory: 20 years after
• ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance
• Progression and verification of situation calculus agents with bounded beliefs
• Automatic synthesis of logical models for order-sorted first-order theories
• Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
• An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0
• The Maude LTL model checker
• A formal approach to object-oriented software engineering
• Rewriting Modulo SMT and Open System Analysis
• CIRC: A Circular Coinductive Prover
• Foundations of algebraic specification and formal software development.
• Proving Termination Properties with mu-term
• Validating Timed Models of Deployment Components with Parametric Concurrency
• Mapping Modular SOS to Rewriting Logic
• Formal Methods for Components and Objects
• Specification of real-time and hybrid systems in rewriting logic
• Computationally Equivalent Elimination of Conditions
• On Hierarchical Graphs: Reconciling Bigraphs, Gs-monoidal Theories and Gs-graphs
• MTT: The Maude Termination Tool (System Description)
• ASM-based formal design of an adaptivity component for a cloud system
• Coinduction for preordered algebra
• A generic framework for \(n\)-protocol compatibility checking
• Assertion-based analysis via slicing withABETS(system description)
• K-Maude: A Rewriting Based Tool for Semantics of Programming Languages
• Title not available (Why is that?)
• Algebraic simulations
• Combining behavioural types with security analysis
• How to prove decidability of equational theories with second-order computation analyser SOL
• The tccp Interpreter
• Abstract Contract Synthesis and Verification in the Symbolic 𝕂 Framework
• A Dependency Pair Framework for A ∨ C-Termination
• On the Behavioral Semantics of Real-Time Domain Specific Visual Languages
• Cadmium: An Implementation of ACD Term Rewriting
• State space reduction in the Maude-NRL protocol analyzer
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures
• Operational Termination of Membership Equational Programs: the Order-Sorted Way
• Specification and Verification of Multi-Agent Systems
• Amalgamation of domain specific languages with behaviour
• Dependency pairs for proving termination properties of conditional term rewriting systems
• Dynamic rebinding for concurrent object groups: theory and practice
• Rewriting modulo SMT and open system analysis
• Verifiable abstractions for contract-oriented systems
• Sufficient completeness verification for conditional and constrained TRS
• Incremental model checking of delta-oriented software product lines
• HasCasl: integrated higher-order specification and program development
• Modelling and Verifying Contract-Oriented Systems in Maude
• Comparing three coordination models: Reo, ARC, and PBRD
• Proceedings of the 7th international workshop on rewriting logic and its applications (WRLA 2008), Budapest, Hungary, March 29--30, 2008
• An overview of the K semantic framework
• Characterizing and proving operational termination of deterministic conditional term rewriting systems
• Normal forms and normal theories in conditional rewriting
• Termination criteria for tree automata completion
• Creol: A type-safe object-oriented model for distributed concurrent systems
• Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• Context-sensitive dependency pairs
• Operational termination of conditional term rewriting systems
• Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
• Conditional rewriting logic as a unified model of concurrency
• Behavioral abstraction is hiding information
• An overview of the runtime verification tool Java PathExplorer
• A formal proof generator from semi-formal proof documents
• Equational rules for rewriting logic
• The role of logical interpretations in program development
• Circular Coinduction: A Proof Theoretical Foundation
• Using the Maude Term Rewriting Language for Agent Development with Formal Foundations
• Title not available (Why is that?)
• A Modular Equational Generalization Algorithm
• Strict coherence of conditional rewriting modulo axioms
• Title not available (Why is that?)
• Mitigating covert channels based on analysis of the potential for communication
• Reachability in Conditional Term Rewriting Systems
• Proving Termination in the Context-Sensitive Dependency Pair Framework
• Transformation and Debugging of Functional Logic Programs
• A Transformational Approach to Prove Outermost Termination Automatically
• Structural induction in institutions

This page was built for software: Maude