The following pages link to Radha Jagadeesan (Q596028):
Displaying 49 items.
- Metrics for labelled Markov processes (Q596029) (← links)
- Timed default concurrent constraint programming (Q679325) (← links)
- Typed parametric polymorphism for aspects (Q856919) (← links)
- New foundations for the geometry of interaction (Q1327394) (← links)
- (Q1380115) (redirect page) (← links)
- Computing with continuous change (Q1380117) (← links)
- Approximating labelled Markov processes (Q1398379) (← links)
- Truly concurrent constraint programming (Q1605181) (← links)
- Game semantics for dependent types (Q1641014) (← links)
- A game semantics for generic polymorphism (Q1772770) (← links)
- Full abstraction for PCF (Q1854394) (← links)
- Sisl: Several interfaces, single logic (Q1856265) (← links)
- Weak bisimulation is sound and complete for pCTL\(^*\) (Q2266992) (← links)
- Eventual consistency for CRDTs (Q2324017) (← links)
- (Q2763694) (← links)
- Game Semantics for Access Control (Q2805155) (← links)
- Brookes Is Relaxed, Almost! (Q2892770) (← links)
- Noninterference for Intuitionist Necessity (Q2936242) (← links)
- (Q3204053) (← links)
- On abstraction and compositionality for weak-memory linearisability (Q3296328) (← links)
- Games for Dependent Types (Q3449463) (← links)
- From Sequential Specifications to Eventual Consistency (Q3449480) (← links)
- Lambda-RBAC: Programming with Role-Based Access Control (Q3518267) (← links)
- Generative Operational Semantics for Relaxed Memory Models (Q3558229) (← links)
- λ-RBAC: Programming with Role-Based Access Control (Q3591428) (← links)
- Open Bisimulation for Aspects (Q3636798) (← links)
- (Q4038691) (← links)
- (Q4256645) (← links)
- (Q4270063) (← links)
- Games and full completeness for multiplicative linear logic (Q4302352) (← links)
- (Q4312468) (← links)
- (Q4414390) (← links)
- (Q4417848) (← links)
- (Q4473027) (← links)
- (Q4484498) (← links)
- (Q4490717) (← links)
- (Q4791848) (← links)
- (Q4804892) (← links)
- A domain equation for refinement of partial systems (Q4818935) (← links)
- Causality and true concurrency: A data-flow analysis of the Pi-Calculus (Q5096391) (← links)
- Between Linearizability and Quiescent Consistency (Q5167840) (← links)
- Approximate reasoning for real-time probabilistic processes (Q5310651) (← links)
- CONCUR 2004 - Concurrency Theory (Q5311475) (← links)
- Quarantining Weakness (Q5326303) (← links)
- TCC, with History (Q5418978) (← links)
- An extensible approach to session polymorphism (Q5741569) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897494) (← links)
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897796) (← links)
- (Towards a) statistical probabilistic lazy lambda calculus (Q6612804) (← links)
