Conditional rewriting logic as a unified model of concurrency
From MaRDI portal
(Redirected from Publication:1190488)
Recommendations
Cites work
- scientific article; zbMATH DE number 4013996 (Why is no real title available?)
- scientific article; zbMATH DE number 4016167 (Why is no real title available?)
- scientific article; zbMATH DE number 4130339 (Why is no real title available?)
- scientific article; zbMATH DE number 4180819 (Why is no real title available?)
- scientific article; zbMATH DE number 4191145 (Why is no real title available?)
- scientific article; zbMATH DE number 4164155 (Why is no real title available?)
- scientific article; zbMATH DE number 3904807 (Why is no real title available?)
- scientific article; zbMATH DE number 3911679 (Why is no real title available?)
- scientific article; zbMATH DE number 3949706 (Why is no real title available?)
- scientific article; zbMATH DE number 3988695 (Why is no real title available?)
- scientific article; zbMATH DE number 4033040 (Why is no real title available?)
- scientific article; zbMATH DE number 4037157 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 4043232 (Why is no real title available?)
- scientific article; zbMATH DE number 4045127 (Why is no real title available?)
- scientific article; zbMATH DE number 4048997 (Why is no real title available?)
- scientific article; zbMATH DE number 4060701 (Why is no real title available?)
- scientific article; zbMATH DE number 4085643 (Why is no real title available?)
- scientific article; zbMATH DE number 4090765 (Why is no real title available?)
- scientific article; zbMATH DE number 4099289 (Why is no real title available?)
- scientific article; zbMATH DE number 4103051 (Why is no real title available?)
- scientific article; zbMATH DE number 3684925 (Why is no real title available?)
- scientific article; zbMATH DE number 3703962 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 3735770 (Why is no real title available?)
- scientific article; zbMATH DE number 3774867 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 177812 (Why is no real title available?)
- scientific article; zbMATH DE number 3522194 (Why is no real title available?)
- scientific article; zbMATH DE number 3574082 (Why is no real title available?)
- scientific article; zbMATH DE number 3597848 (Why is no real title available?)
- scientific article; zbMATH DE number 3633737 (Why is no real title available?)
- scientific article; zbMATH DE number 4124993 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- scientific article; zbMATH DE number 4119615 (Why is no real title available?)
- scientific article; zbMATH DE number 3280068 (Why is no real title available?)
- scientific article; zbMATH DE number 3316072 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- A mathematical approach to nondeterminism in data types
- Actor grammars
- Adjointness in Foundations
- Algebraic semantics
- An abstract formulation for rewrite systems
- Aspects of topoi
- Compiling concurrent rewriting onto the Rewrite Rule Machine
- Completion of a Set of Rules Modulo a Set of Equations
- Computing in systems described by equations
- Concurrent transition systems
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Fair termination is decidable for ground systems
- From Petri nets to linear logic
- General recursive functions of natural numbers
- Graph expressions and graph rewritings
- Implementing term rewriting by graph reduction: Termination of combined systems
- Infinite trees in normal form and recursive equations having a unique solution
- Initial Algebra Semantics and Continuous Algebras
- On ``On graph rewritings
- On graph rewritings
- Operational and Semantic Equivalence Between Recursive Programs
- Petri nets are monoids
- Subequalizers
- Termination for direct sums of left-linear complete term rewriting systems
- The categorical abstract machine
- The gamma model and its discipline of programming
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The linear abstract machine
- Varieties of chain-complete algebras
- Varieties of ordered algebras
Cited in
(only showing first 100 items - show all)- REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS
- On Ground Convergence and Completeness of Conditional Equational Program Hierarchies
- scientific article; zbMATH DE number 1231654 (Why is no real title available?)
- Concurrent garbage collection for concurrent rewriting
- Backwards type analysis of asynchronous method calls
- Invariant-driven specifications in Maude
- More problems in rewriting
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
- Compositional reasoning about active objects with shared futures
- Strategy based semantics for mobility with time and access permissions
- A probabilistic approximate logic for neuro-symbolic learning and reasoning
- Structured theories and institutions
- Replicated data types that unify eventual consistency and observable atomic consistency
- scientific article; zbMATH DE number 1231543 (Why is no real title available?)
- Parallel dynamic semantics of sequential programs with speculative and incremental computation
- A Non-Deterministic Multiset Query Language
- A rewriting based model for probabilistic distributed object systems.
- Toward the concurrent implementation of computational systems
- A new generic scheme for functional logic programming with constraints
- Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types
- Priority rewriting: Semantics, confluence, and conditionals
- A Modular Equational Generalization Algorithm
- CINNI -- a generic calculus of explicit substitutions and its application to \(\lambda\)-, \(\sigma\)- and \(\pi\)-calculi
- Deciding observational congruence of finite-state CCS expressions by rewriting
- Reflection in conditional rewriting logic
- An abstract machine for concurrent modular systems: CHARM
- Comparing Meseguer's rewriting logic with the logic CRWL
- Debugging Maude programs via runtime assertion checking and trace slicing
- Equational formulas and pattern operations in initial order-sorted algebras
- Foundations of the rule-based system \(\rho\,\text{Log}\)
- Verifying a distributed list system: A case history
- Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
- Strict coherence of conditional rewriting modulo axioms
- Algebraic specification of agent computation
- Specification and analysis of the AER/NCA active network protocol suite in real-time Maude
- Categorical rewriting of term-like structures
- Tile formats for located and mobile systems.
- Knuth-Bendix completion for non-symmetric transitive relations
- Modeling and analyzing mobile ad hoc networks in Real-Time Maude
- Combining runtime checking and slicing to improve Maude error diagnosis
- From rewriting logic, to programming language semantics, to program verification
- Formalization and correctness of the PALS architectural pattern for distributed real-time systems
- A semantics preserving actor translation
- Rewriting semantics of production rule sets
- Dynamic connectors for concurrency
- Compositional specification in rewriting logic
- Solving Sudoku puzzles with rewriting rules
- scientific article; zbMATH DE number 1231542 (Why is no real title available?)
- A formal framework for interactive agents
- Termination of just/fair computations in term rewriting
- A causal semantics for CCS via rewriting logic
- Executable rewriting logic semantics of Orc and formal analysis of Orc programs
- Applications and extensions of context-sensitive rewriting
- Specification of abstract dynamic-data types: A temporal logic approach
- Theorem proving in a mathematical information environment
- Structural induction in institutions
- scientific article; zbMATH DE number 4043232 (Why is no real title available?)
- Creol: A type-safe object-oriented model for distributed concurrent systems
- Composing proof terms
- Logical foundations of CafeOBJ
- Two case studies of semantics execution in Maude: CCS and LOTOS
- Executable structural operational semantics in Maude
- Maude: specification and programming in rewriting logic
- Deduction, strategies, and rewriting
- A rewriting logic framework for soft constraints
- The rewriting logic semantics project: a progress report
- Variant narrowing and equational unification
- The rewriting logic semantics project: a progress report
- Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
- Equational abstractions for reducing the state space of rewrite theories
- Normal forms and normal theories in conditional rewriting
- ACUOS: a system for modular ACU generalization with subtyping and inheritance
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- Abstract Beth definability in institutions
- State space reduction in the Maude-NRL protocol analyzer
- An algebraic semantics for MOF
- Comparing three coordination models: Reo, ARC, and PBRD
- Effectively Checking the Finite Variant Property
- Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude
- Declarative Debugging of Rewriting Logic Specifications
- Integrating Maude into Hets
- A Rewriting Logic Approach to Type Inference
- A rewriting-based model checker for the linear temporal logic of rewriting
- An Object-Oriented Component Model for Heterogeneous Nets
- A foundation for higher-order concurrent constraint programming
- Bigraphs and their algebra
- Plan in Maude specifying an active network programming language
- SOS formats and meta-theory: 20 years after
- Declarative debugging of rewriting logic specifications
- A rewriting logic approach to operational semantics
- Rewriting strategies and strategic rewrite programs
- Equational abstractions
- Rewriting modulo SMT and open system analysis
- Order-sorted generalization
- Formal modeling and validation of a power-efficient grouping protocol for WSNs
- Quasi-Boolean encodings and conditionals in algebraic specification
- A rewriting framework and logic for activities subject to regulations
- Algebraic simulations
- Partial order reduction for rewriting semantics of programming languages
- Equational rules for rewriting logic
This page was built for publication: Conditional rewriting logic as a unified model of concurrency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190488)
