The following pages link to (Q4692502):
Displaying 50 items.
- UNITY (Q25375) (← links)
- Event-based proof of the mutual exclusion property of Peterson's algorithm (Q271900) (← links)
- Mechanizing a process algebra for network protocols (Q287372) (← links)
- Progress properties for empty \textsc{Unity} programs (Q294627) (← links)
- Foundations for using linear temporal logic in Event-B refinement (Q333316) (← links)
- A verifiable low-level concurrent programming model based on colored Petri nets (Q350966) (← links)
- Tiara: a self-stabilizing deterministic skip list and skip graph (Q418743) (← links)
- Verification of distributed systems with local-global predicates (Q432134) (← links)
- Starvation-free mutual exclusion with semaphores (Q469360) (← links)
- Structural transformations for data-enriched real-time systems (Q493518) (← links)
- Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous (Q516036) (← links)
- Queue based mutual exclusion with linearly bounded overtaking (Q532419) (← links)
- Simulation refinement for concurrency verification (Q541209) (← links)
- Modular verification of multithreaded programs (Q557795) (← links)
- Maintaining the Ranch topology (Q666250) (← links)
- Probabilistic communicating processes (Q672230) (← links)
- Stabilizing phase-clocks (Q673003) (← links)
- A simplified design strategy for mapping image processing algorithms on a SIMD torus (Q673769) (← links)
- On the implementation of concurrent calculi in net calculi: two case studies (Q673785) (← links)
- On the logic of UNITY (Q673960) (← links)
- A model for synchronous switching circuits and its theory of correctness (Q685112) (← links)
- Another glance at the Alpern-Schneider characterization of safety and liveness in concurrent executions (Q688439) (← links)
- Unity properties and sequences of states, some observations (Q688444) (← links)
- Correctness and concurrent complexity of the black-white bakery algorithm (Q736464) (← links)
- Eliminating the substitution axiom from UNITY logic (Q751848) (← links)
- The distributed simulation of clustered processes (Q757100) (← links)
- A fixed point approach to parallel discrete event simulation (Q758225) (← links)
- On the refinement of liveness properties of distributed systems (Q763239) (← links)
- A complete mechanization of correctness of a string-preprocessing algorithm (Q816208) (← links)
- Cones and foci: A mechanical framework for protocol verification (Q853730) (← links)
- Formal and incremental construction of distributed algorithms: on the distributed reference counting algorithm (Q860848) (← links)
- A basic algebra of stateless connectors (Q860881) (← links)
- Splitting atoms safely (Q879357) (← links)
- Modeling adaptive behaviors in Context UNITY (Q882451) (← links)
- Integrating stochastic reasoning into Event-B development (Q903513) (← links)
- A predicate transformer for progress (Q909441) (← links)
- Fixed points of increasing functions (Q909682) (← links)
- A distributed synchronization scheme for fair multi-process handshakes (Q910197) (← links)
- Safety and liveness from a methodological point of view (Q916351) (← links)
- Derivation of efficient parallel programs: An example from genetic sequence analysis (Q916411) (← links)
- Blocking versus nonblocking interprocess communication: A note on the effect on concurrency (Q917284) (← links)
- Comments on ``On the proof of a distributed algorithm'': Always-true is not invariant (Q918207) (← links)
- Efficient methods for formally verifying safety properties of hierarchical cache coherence protocols (Q968361) (← links)
- Alternating states for dual nondeterminism in imperative programming (Q974118) (← links)
- A general technique for proving lock-freedom (Q1001810) (← links)
- Refinement and verification in component-based model-driven design (Q1004291) (← links)
- A queue based mutual exclusion algorithm (Q1006897) (← links)
- Boolean circuit programming: A new paradigm to design parallel algorithms (Q1026240) (← links)
- Refining multiset transformers (Q1127515) (← links)
- A framework for viewing atomic events in distributed computations (Q1128710) (← links)