Conditional rewriting logic as a unified model of concurrency
From MaRDI portal
Publication:1190488
DOI10.1016/0304-3975(92)90182-FzbMath0758.68043WikidataQ125052689 ScholiaQ125052689MaRDI QIDQ1190488
Publication date: 26 September 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Semantics in the theory of computing (68Q55) Models of other mathematical theories (03C65) Other applications of logic (03B80)
Related Items (only showing first 100 items - show all)
Algorithmic Analysis of Blockchain Efficiency with Communication Delay ⋮ An Institution for Graph Transformation ⋮ True concurrency semantics for a linear logic programming language with broadcast communication ⋮ Executable structural operational semantics in Maude ⋮ Unnamed Item ⋮ Equational formulas and pattern operations in initial order-sorted algebras ⋮ Ultraproducts and possible worlds semantics in institutions ⋮ Probabilistic Real-Time Rewrite Theories and Their Expressive Power ⋮ Towards Erlang Verification by Term Rewriting ⋮ Bi-rewriting, a term rewriting technique for monotonic order relations ⋮ More problems in rewriting ⋮ Concurrent garbage collection for concurrent rewriting ⋮ Relating two categorical models of term rewriting ⋮ Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories ⋮ Tiles for Reo ⋮ A Rewriting Logic Approach to Type Inference ⋮ Declarative Debugging of Rewriting Logic Specifications ⋮ Converting between Combinatory Reduction Systems and Big Step Semantics ⋮ Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties ⋮ Herbrand theorems in arbitrary institutions ⋮ A semantics preserving actor translation ⋮ ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance ⋮ A probabilistic approximate logic for neuro-symbolic learning and reasoning ⋮ Simulating and model checking membrane systems using strategies in Maude ⋮ Metalevel transformation of strategies ⋮ Optimization of rewrite theories by equational partial evaluation ⋮ A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems ⋮ José Meseguer: Scientist and Friend Extraordinaire ⋮ Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis ⋮ Two Decades of Maude ⋮ Rewriting Strategies and Strategic Rewrite Programs ⋮ Verifying Reachability-Logic Properties on Rewriting-Logic Specifications ⋮ Weak Bisimulation as a Congruence in MSOS ⋮ From Rewriting Logic, to Programming Language Semantics, to Program Verification ⋮ On relating rewriting systems and graph grammars to event structures ⋮ A foundation for higher-order concurrent constraint programming ⋮ CPO models for infinite term rewriting ⋮ Conditional Bigraphs ⋮ Assertion-based analysis via slicing withABETS(system description) ⋮ Symbolic Analysis of Maude Theories with Narval ⋮ Compositional Specification in Rewriting Logic ⋮ Declarative Debugging of Membership Equational Logic Specifications ⋮ Models of Computation: A Tribute to Ugo Montanari’s Vision ⋮ Safety enforcement via programmable strategies in Maude ⋮ Verification of the ROS NavFn planner using executable specification languages ⋮ Effectively Checking the Finite Variant Property ⋮ A rewriting framework and logic for activities subject to regulations ⋮ Algebraic structures of directed acyclic graphs: application to concurrent calculus ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting ⋮ Relating State-Based and Process-Based Concurrency through Linear Logic ⋮ Strategy-Based Rewrite Semantics for Membrane Systems Preserves Maximal Concurrency of Evolution Rule Actions ⋮ An Assertional Language for the Verification of Systems Parametric in Several Dimensions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework ⋮ Categorical rewriting of term-like structures ⋮ Unnamed Item ⋮ Rewriting on cyclic structures: Equivalence between the operational and the categorical description ⋮ Semantic foundations for generalized rewrite theories ⋮ An Object-Oriented Component Model for Heterogeneous Nets ⋮ Unnamed Item ⋮ Integrating Maude into Hets ⋮ Validating Timed Models of Deployment Components with Parametric Concurrency ⋮ A Modular Equational Generalization Algorithm ⋮ The Rewriting Logic Semantics Project: A Progress Report ⋮ Axiomatizing permutation equivalence ⋮ A Connector Algebra for P/T Nets Interactions ⋮ TAGED Approximations for Temporal Properties Model-Checking ⋮ Egalitarian State-Transition Systems ⋮ Order-Sorted Generalization ⋮ Foundations of the rule-based system ρLog ⋮ Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms* ⋮ Abstract Beth definability in institutions ⋮ Certifying Term Rewriting Proofs in ELAN ⋮ Knuth-Bendix Completion for Non-Symmetric Transitive Relations ⋮ Comparing Higher-Order Encodings in Logical Frameworks and Tile Logic ⋮ Comparing cospan-spans and tiles via a Hoare-style process calculus ⋮ Comparing Meseguer's Rewriting Logic with the Logic CRWL ⋮ Behavioural specification for hierarchical object composition ⋮ Deduction, Strategies, and Rewriting ⋮ A Formal Framework for Interactive Agents ⋮ Semantic Determinism and Functional Logic Program Properties ⋮ Using Maude and Its Strategies for Defining a Framework for Analyzing Eden Semantics ⋮ Bigraphs and Their Algebra ⋮ Executable rewriting logic semantics of Orc and formal analysis of Orc programs ⋮ A Rewriting Logic Approach to Operational Semantics (Extended Abstract) ⋮ Partial Order Reduction for Rewriting Semantics of Programming Languages ⋮ Solving Sudoku Puzzles with Rewriting Rules ⋮ Abstraction and Model Checking of Core Erlang Programs in Maude ⋮ A Rewriting Logic Framework for Soft Constraints ⋮ Narrowing and Rewriting Logic: from Foundations to Applications
Uses Software
Cites Work
- The gamma model and its discipline of programming
- On graph rewritings
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Petri nets are monoids
- The categorical abstract machine
- On ``On graph rewritings
- The linear abstract machine
- Concurrent transition systems
- Computing in systems described by equations
- Varieties of chain-complete algebras
- Algebraic semantics
- Varieties of ordered algebras
- General recursive functions of natural numbers
- Graph expressions and graph rewritings
- Completion of a Set of Rules Modulo a Set of Equations
- Actor grammars
- Infinite trees in normal form and recursive equations having a unique solution
- Operational and Semantic Equivalence Between Recursive Programs
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Adjointness in Foundations
- Initial Algebra Semantics and Continuous Algebras
- Termination for direct sums of left-linear complete term rewriting systems
- A mathematical approach to nondeterminism in data types
- Fair termination is decidable for ground systems
- An abstract formulation for rewrite systems
- From petri nets to linear logic
- Subequalizers
- Aspects of topoi
- Implementing term rewriting by graph reduction: Termination of combined systems
- Compiling concurrent rewriting onto the Rewrite Rule Machine
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Conditional rewriting logic as a unified model of concurrency
