The following pages link to UNITY (Q25375):
Displaying 50 items.
- A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation. (Q1607102) (← links)
- The shortest path in parallel (Q1607105) (← links)
- Tournaments for mutual exclusion: verification and concurrent complexity (Q1682286) (← links)
- Simulation relations for fault-tolerance (Q1688554) (← links)
- Abstract state machines: a unifying view of models of computation and of system design frameworks (Q1772776) (← links)
- Specification and analysis of a composition of protocols (Q1801467) (← links)
- The sliding-window protocol revisited (Q1805397) (← links)
- A simple proof of a simple consensus algorithm (Q1825626) (← links)
- Factorizing fault tolerance. (Q1853629) (← links)
- Invariants, composition, and substitution (Q1894676) (← links)
- Bounded delay for a free address (Q1901690) (← links)
- DUALITY: A simple formalism for the analysis of UNITY (Q1903074) (← links)
- Applying abstraction and formal specification in numerical software design (Q1903758) (← links)
- Specification and refinement of networks of asynchronously communicating agents using the assumption/commitment paradigm (Q1914039) (← links)
- Superposition refinement of reactive systems (Q1918935) (← links)
- A framework for automated distributed implementation of component-based models (Q1938379) (← links)
- Using refinement calculus techniques to prove linearizability (Q1941870) (← links)
- Security invariants in discrete transition systems (Q1941889) (← links)
- Concurrent maintenance of rings (Q1954197) (← links)
- Formalism and method (Q1978639) (← links)
- UNITY and Büchi automata (Q2026375) (← links)
- Preserving stabilization while \textit{practically} bounding state space using incorruptible partially synchronized clocks (Q2204779) (← links)
- Specification and verification of concurrent programs through refinements (Q2351261) (← links)
- Composite registers (Q2365566) (← links)
- Distributed maximum maintenance on hierarchically divided graphs (Q2366165) (← links)
- A verification framework for agent programming with declarative goals (Q2372188) (← links)
- Computing with multiple discrete flows (Q2430306) (← links)
- Distributed consensus, revisited (Q2458442) (← links)
- Streamlining progress-based derivations of concurrent programs (Q2481207) (← links)
- Refinement verification of the lazy caching algorithm (Q2509154) (← links)
- A new explanation of the glitch phenomenon (Q2641279) (← links)
- Rewriting-based verification of authentication protocols (Q2851055) (← links)
- Generic Proof Scores for Generate & Check Method in CafeOBJ (Q2945712) (← links)
- rCOS: Defining Meanings of Component-Based Software Architectures (Q2948228) (← links)
- Knowledge-Based Synthesis of Distributed Systems Using Event Structures (Q3003333) (← links)
- Temporal Logic and Fair Discrete Systems (Q3176360) (← links)
- Combining Model Checking and Deduction (Q3176378) (← links)
- Constructive Polychronous Systems (Q3455857) (← links)
- A Normalized Form for FIFO Protocols Traces, Application to the Replay of Mode-based Protocols (Q3460215) (← links)
- Compositional Verification for Component-Based Systems and Application (Q3540064) (← links)
- Formal Reasoning About Causality Analysis (Q3543654) (← links)
- Web Cube (Q3613060) (← links)
- (Q4222853) (← links)
- Decidability of a partial order based temporal logic (Q4630294) (← links)
- Reasoning about programs by exploiting the environment (Q4632437) (← links)
- (Q4679533) (← links)
- Algebra Transformation Systems as a Unifying Framework (Q4923537) (← links)
- A case study in transformational design of concurrent systems (Q5044728) (← links)
- Constraining interference in an object-based design method (Q5044731) (← links)
- Application of the composition principle to unity-like specifications (Q5044739) (← links)
