Pages that link to "Item:Q1190488"
From MaRDI portal
The following pages link to Conditional rewriting logic as a unified model of concurrency (Q1190488):
Displaying 50 items.
- Rewriting modulo SMT and open system analysis (Q347384) (← links)
- The rewriting logic semantics project: a progress report (Q393080) (← links)
- A generic framework for \(n\)-protocol compatibility checking (Q433347) (← links)
- Formal modeling and validation of a power-efficient grouping protocol for WSNs (Q444471) (← links)
- State space reduction in the Maude-NRL protocol analyzer (Q462493) (← links)
- Integrating deployment architectures and resource consumption in timed object-oriented models (Q478391) (← links)
- Exploring conditional rewriting logic computations (Q485831) (← links)
- Formal methods for web security (Q511944) (← links)
- A Maude environment for CafeOBJ (Q520244) (← links)
- Collaborative planning with confidentiality (Q540688) (← links)
- Comparing three coordination models: Reo, ARC, and PBRD (Q608351) (← links)
- Coinduction for preordered algebra (Q627121) (← links)
- A formal library of set relations and its application to synchronous languages (Q654904) (← links)
- Deciding observational congruence of finite-state CCS expressions by rewriting (Q673974) (← links)
- Strict coherence of conditional rewriting modulo axioms (Q683741) (← links)
- Formalization and correctness of the PALS architectural pattern for distributed real-time systems (Q714796) (← links)
- Structural induction in institutions (Q719243) (← links)
- Modeling and analyzing mobile ad hoc networks in Real-Time Maude (Q730472) (← links)
- Normal forms and normal theories in conditional rewriting (Q730473) (← links)
- Relating state-based and process-based concurrency through linear logic (full-version) (Q731895) (← links)
- Debugging Maude programs via runtime assertion checking and trace slicing (Q739630) (← links)
- Replicated data types that unify eventual consistency and observable atomic consistency (Q780057) (← links)
- Algebraic specification of agent computation (Q814896) (← links)
- Two case studies of semantics execution in Maude: CCS and LOTOS (Q816216) (← links)
- Invariant-driven specifications in Maude (Q838161) (← links)
- Algebraic simulations (Q844884) (← links)
- Quasi-Boolean encodings and conditionals in algebraic specification (Q844886) (← links)
- Creol: A type-safe object-oriented model for distributed concurrent systems (Q854164) (← links)
- A basic algebra of stateless connectors (Q860881) (← links)
- Formal analysis of Kerberos 5 (Q860899) (← links)
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties (Q860906) (← links)
- Specification and analysis of the AER/NCA active network protocol suite in real-time Maude (Q862853) (← links)
- Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic (Q875516) (← links)
- The rewriting logic semantics project (Q877024) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
- A new generic scheme for functional logic programming with constraints (Q880985) (← links)
- Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types (Q880987) (← links)
- Strategy based semantics for mobility with time and access permissions (Q890480) (← links)
- Compositional reasoning about active objects with shared futures (Q890481) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Equational abstractions (Q944377) (← links)
- Backwards type analysis of asynchronous method calls (Q953530) (← links)
- An algebraic semantics for MOF (Q973052) (← links)
- An overview of the K semantic framework (Q987974) (← links)
- Saturated models in institutions (Q992038) (← links)
- Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude (Q1004068) (← links)
- A rewriting logic approach to operational semantics (Q1012130) (← links)
- Theorem proving in a mathematical information environment (Q1288657) (← links)
- An abstract machine for concurrent modular systems: CHARM (Q1314422) (← links)
