The following pages link to A. W. Roscoe (Q333321):
Displaying 50 items.
- Rigorous development of component-based systems using component metadata and patterns (Q333322) (← links)
- SAT-solving in CSP trace refinement (Q436423) (← links)
- Computing maximal weak and other bisimulations (Q510897) (← links)
- The pursuit of deadlock freedom (Q580970) (← links)
- Fixed points without completeness (Q674192) (← links)
- Non-interference through determinism (Q826053) (← links)
- Revivals, stuckness and the hierarchy of CSP models (Q1007236) (← links)
- A timed model for communicating sequential processes (Q1109561) (← links)
- Concepts of digital topology (Q1205564) (← links)
- Acyclic monotone normality (Q1207241) (← links)
- The timed failures -- Stability model for CSP (Q1274446) (← links)
- Reducing complex CSP models to traces via priority (Q1744391) (← links)
- Responsiveness of interoperating components (Q1764435) (← links)
- Star covering properties (Q1814165) (← links)
- Checking noninterference in timed CSP (Q1941887) (← links)
- Translating between models of concurrency (Q2182666) (← links)
- Understanding concurrent systems (Q2269718) (← links)
- Tighter reachability criteria for deadlock-freedom analysis (Q2281624) (← links)
- Key agreement via protocols (Q2303369) (← links)
- Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving (Q2418047) (← links)
- Authenticating ad hoc networks by comparison of short digests (Q2482445) (← links)
- The expressiveness of CSP with priority (Q2520703) (← links)
- On the expressive power of CSP refinement (Q2576581) (← links)
- Deadlock analysis in networks of communicating processes (Q2638755) (← links)
- The laws of Occam programming (Q2640348) (← links)
- Responsiveness and stable revivals (Q2642988) (← links)
- Slow Abstraction via Priority (Q2842644) (← links)
- A Static Analysis Framework for Livelock Freedom in CSP (Q2848369) (← links)
- (Q2852371) (← links)
- (Q2863863) (← links)
- A theory of binary digital pictures (Q3026388) (← links)
- Continuous analogs of axiomatized digital surfaces (Q3028380) (← links)
- Static Livelock Analysis in CSP (Q3090843) (← links)
- Insight, Inspiration and Collaboration (Q3163395) (← links)
- CSP is Expressive Enough for π (Q3163412) (← links)
- Process Algebra and Model Checking (Q3176390) (← links)
- The Automatic Detection of Token Structures and Invariants Using SAT Checking (Q3303932) (← links)
- Criteria for Metrisability (Q3327332) (← links)
- (Q3601861) (← links)
- Nets with Tokens Which Carry Data (Q3612940) (← links)
- Local Search in Model Checking (Q3648688) (← links)
- A Lattice of Conditions on Topological Spaces (Q3675179) (← links)
- (Q3680258) (← links)
- (Q3680259) (← links)
- Characterizations of Simply-Connected Finite Polyhedra in 3-Space (Q3696164) (← links)
- (Q3700823) (← links)
- (Q3725534) (← links)
- (Q3726974) (← links)
- A Theory of Communicating Sequential Processes (Q3765233) (← links)
- Laws of programming (Q3766810) (← links)
