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)

• Operational termination of conditional rewriting with built-in numbers and semantic data structures
• Operational termination of membership equational programs: the order-sorted way
• Abstract contract synthesis and verification in the symbolic \(\mathbb{K}\) framework
• ABS-NET: fully decentralized runtime adaptation for distributed objects
• Twenty years of rewriting logic
• Rewriting logic semantics of a plan execution language
• 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
• 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
• 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
• CIRC: A Circular Coinductive Prover
• Foundations of algebraic specification and formal software development.
• Formal Methods for Components and Objects
• Handbook of constraint programming.
• Specification of real-time and hybrid systems in rewriting logic
• Computationally Equivalent Elimination of Conditions
• MTT: The Maude Termination Tool (System Description)
• ASM-based formal design of an adaptivity component for a cloud system
• Coinduction for preordered algebra
• Programming in biomolecular computation
• Modelling and verifying contract-oriented systems in Maude
• A generic framework for \(n\)-protocol compatibility checking
• Assertion-based analysis via slicing withABETS(system description)
• 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
• Cadmium: An Implementation of ACD Term Rewriting
• State space reduction in the Maude-NRL protocol analyzer
• Mechanical approach to linking operational semantics and algebraic semantics for Verilog using Maude
• Title not available (Why is that?)
• Specification and Verification of Multi-Agent Systems
• Using the Maude term rewriting language for agent development with formal foundations
• Rewriting modulo SMT and open system analysis
• 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
• Circular coinduction: a proof theoretical foundation
• On hierarchical graphs: reconciling bigraphs, gs-monoidal theories and gs-graphs
• 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
• 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
• K-Maude: a rewriting based tool for semantics of programming languages
• Behavioral abstraction is hiding information
• An overview of the runtime verification tool Java PathExplorer
• ACUOS: a system for modular ACU generalization with subtyping and inheritance
• The \textsf{tccp} interpreter
• A formal proof generator from semi-formal proof documents
• Equational rules for rewriting logic
• The role of logical interpretations in program development
• Proving termination properties with \textsc{mu-term}
• Validating timed models of deployment components with parametric concurrency
• Mapping modular SOS to rewriting logic
• A dependency pair framework for \(A \vee C\)-termination
• On the behavioral semantics of real-time domain specific visual languages
• The rewriting logic semantics project: a progress report
• The rewriting logic semantics project: a progress report
• Model of distributed computing system operation with time
• Automatic Validation of Transformation Rules for Java Verification Against a Rewriting Semantics
• Theoretical Aspects of Computing – ICTAC 2005
• An Object-Oriented Component Model for Heterogeneous Nets
• A rewriting framework and logic for activities subject to regulations
• Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
• Two case studies of semantics execution in Maude: CCS and LOTOS
• Semantics and pragmatics of real-time maude

This page was built for software: Maude