The following pages link to CONCUR 2004 - Concurrency Theory (Q5311497):
Displaying 21 items.
- On grainless footprint semantics for shared-memory programs (Q283741) (← links)
- Concurrent Kleene algebra with tests and branching automata (Q299205) (← links)
- Certifying low-level programs with hardware interrupts and preemptive threads (Q835764) (← links)
- Spatial-behavioral types for concurrency and resource control in distributed systems (Q935465) (← links)
- Toward compositional verification of interruptible OS kernels and device drivers (Q1663225) (← links)
- A formal C memory model for separation logic (Q1694027) (← links)
- In praise of algebra (Q1941861) (← links)
- Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems (Q2408742) (← links)
- Generic Models of the Laws of Programming (Q2842638) (← links)
- The Laws of Programming Unify Process Calculi (Q2908555) (← links)
- Tackling Real-Life Relaxed Concurrency with FSL++ (Q2988652) (← links)
- Model Checking Concurrent Programs (Q3176376) (← links)
- Spatial-Behavioral Types, Distributed Services, and Resources (Q3608455) (← links)
- Unifying Semantics for Concurrent Programming (Q4922078) (← links)
- Verifying Visibility-Based Weak Consistency (Q5041095) (← links)
- (Q5090915) (← links)
- Separation Logic for Multiple Inheritance (Q5415606) (← links)
- A Revisionist History of Concurrent Separation Logic (Q5739348) (← links)
- Step-Indexed Kripke Model of Separation Logic for Storable Locks (Q5739354) (← links)
- Concise outlines for a complex logic: a proof outline checker for TaDA (Q6145023) (← links)
- Varieties of unary-determined distributive $\ell$-magmas and bunched implication algebras (Q6151561) (← links)