scientific article

Publication date: 26 October 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Horn logic partiality membership equational logic order-sorted algebra equational specification formalisms partial membership algebras

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Abstract data types; algebraic specification (68Q65)

Related Items (only showing first 100 items - show all)

Rewriting logic: Roadmap and bibliography ⋮ Executable structural operational semantics in Maude ⋮ Structured theories and institutions ⋮ Order-sorted equational generalization algorithm revisited ⋮ Unnamed Item ⋮ Invariant-driven specifications in Maude ⋮ Equational formulas and pattern operations in initial order-sorted algebras ⋮ Probabilistic Real-Time Rewrite Theories and Their Expressive Power ⋮ Algebraic simulations ⋮ Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories ⋮ What Is a Multi-modeling Language? ⋮ Declarative Debugging of Rewriting Logic Specifications ⋮ Order-Sorted Parameterization and Induction ⋮ Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties ⋮ Herbrand theorems in arbitrary institutions ⋮ A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties ⋮ Sentence-normalized conditional narrowing modulo in rewriting logic and Maude ⋮ Specification and analysis of the AER/NCA active network protocol suite in real-time Maude ⋮ Dependency pairs for proving termination properties of conditional term rewriting systems ⋮ Rewriting modulo SMT and open system analysis ⋮ Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic ⋮ The rewriting logic semantics project ⋮ Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols ⋮ Semantics and pragmatics of real-time maude ⋮ Metalevel algorithms for variant satisfiability ⋮ José Meseguer: Scientist and Friend Extraordinaire ⋮ Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude ⋮ Two Decades of Maude ⋮ Modularity of Ontologies in an Arbitrary Institution ⋮ The Formal System of Dijkstra and Scholten ⋮ Principles of proof scores in CafeOBJ ⋮ The rewriting logic semantics project: a progress report ⋮ Twenty years of rewriting logic ⋮ On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories ⋮ Declarative debugging of rewriting logic specifications ⋮ Graded consequence: an institution theoretic study ⋮ Declarative Debugging of Membership Equational Logic Specifications ⋮ A generic framework for \(n\)-protocol compatibility checking ⋮ Effectively Checking the Finite Variant Property ⋮ Verifying hierarchical Ptolemy II discrete-event models using real-time maude ⋮ A modular order-sorted equational generalization algorithm ⋮ Stability of termination and sufficient-completeness under pushouts via amalgamation ⋮ State space reduction in the Maude-NRL protocol analyzer ⋮ MTT: The Maude Termination Tool (System Description) ⋮ Unnamed Item ⋮ Specification and proof in membership equational logic ⋮ Equational abstractions ⋮ Strict coherence of conditional rewriting modulo axioms ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework ⋮ An algebraic semantics for MOF ⋮ Proving operational termination of membership equational programs ⋮ Formalization and correctness of the PALS architectural pattern for distributed real-time systems ⋮ Semantic foundations for generalized rewrite theories ⋮ Variant-Based Satisfiability in Initial Algebras ⋮ Modeling and analyzing mobile ad hoc networks in Real-Time Maude ⋮ Normal forms and normal theories in conditional rewriting ⋮ Integrating Maude into Hets ⋮ Proving semantic properties as first-order satisfiability ⋮ A Modular Equational Generalization Algorithm ⋮ Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude ⋮ Generalized rewrite theories, coherence completion, and symbolic methods ⋮ Programming and symbolic computation in Maude ⋮ A partial evaluation framework for order-sorted equational programs modulo axioms ⋮ Ground confluence of order-sorted conditional specifications modulo axioms ⋮ A semantic approach to interpolation ⋮ Debugging Maude programs via runtime assertion checking and trace slicing ⋮ Methods for Proving Termination of Rewriting-based Programming Languages by Transformation ⋮ Order-Sorted Rewriting and Congruence Closure ⋮ A rewriting logic approach to operational semantics ⋮ The Rewriting Logic Semantics Project: A Progress Report ⋮ Use of Logical Models for Proving Operational Termination in General Logics ⋮ Metalevel Algorithms for Variant Satisfiability ⋮ Simulation and Verification of Synchronous Set Relations in Rewriting Logic ⋮ Interpreting Abstract Interpretations in Membership Equational Logic ⋮ Comparing Meseguer's Rewriting Logic with the Logic CRWL ⋮ Swinging types=functions+relations+transition systems ⋮ Towards Behavioral Maude ⋮ Operational termination of conditional term rewriting systems ⋮ Read atomic transactions with prevention of lost updates: ROLA and its formal analysis ⋮ Capturing constrained constructor patterns in matching logic ⋮ Normal forms for algebras of connections. ⋮ Relating CASL with other specification languages: the institution level. ⋮ Functorial models for Petri nets ⋮ Recent Advances in Real-Time Maude ⋮ Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description) ⋮ Executable rewriting logic semantics of Orc and formal analysis of Orc programs ⋮ Dynamic connectors for concurrency ⋮ Compositional SOS and beyond: A coalgebraic view of open systems ⋮ Abstraction and Completeness for Real-Time Maude ⋮ Narrowing and Rewriting Logic: from Foundations to Applications ⋮ Maude: specification and programming in rewriting logic ⋮ Reflection in conditional rewriting logic ⋮ Logical foundations of CafeOBJ ⋮ Comparing logics for rewriting: Rewriting logic, action calculi and tile logic ⋮ Specification of real-time and hybrid systems in rewriting logic ⋮ Actor theories in rewriting logic ⋮ A formal approach to object-oriented software engineering ⋮ Symbolic computation in Maude: some tapas

This page was built for publication: