Radha Jagadeesan

According to our database1, Radha Jagadeesan
  • authored at least 92 papers between 1989 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
An extensible approach to session polymorphism.
Mathematical Structures in Computer Science, 2016

2015
Games for Dependent Types.
CoRR, 2015

From Sequential Specifications to Eventual Consistency.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Games for Dependent Types.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Between Linearizability and Quiescent Consistency: Quantitative Quiescent Consistency.
CoRR, 2014

Game Semantics for Access Control.
CoRR, 2014

Between Linearizability and Quiescent Consistency - Quantitative Quiescent Consistency.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Certificates for Verifiable Forensics.
Proceedings of the IEEE 27th Computer Security Foundations Symposium, 2014

TCC, with History.
Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014

2013
TCC, with History.
CoRR, 2013

Full Abstraction for PCF.
CoRR, 2013

A Game Semantics for Generic Polymorphism.
CoRR, 2013

Games and Full Completeness for Multiplicative Linear Logic.
CoRR, 2013

Noninterference for Intuitionist Necessity.
Proceedings of the Logic and Its Applications, 5th Indian Conference, 2013

Quarantining Weakness - Compositional Reasoning under Relaxed Memory Models (Extended Abstract).
Proceedings of the Programming Languages and Systems, 2013

2012
Types for relaxed memory models.
Proceedings of TLDI 2012: The Seventh ACM SIGPLAN Workshop on Types in Languages Design and Implementation, 2012

Brookes Is Relaxed, Almost!
Proceedings of the Foundations of Software Science and Computational Structures, 2012

Succour to the Confused Deputy - Types for Capabilities.
Proceedings of the Programming Languages and Systems - 10th Asian Symposium, 2012

2011
Local Memory via Layout Randomization.
Proceedings of the 24th IEEE Computer Security Foundations Symposium, 2011

2010
Weak bisimulation is sound and complete for pCTL*.
Inf. Comput., 2010

Generative Operational Semantics for Relaxed Memory Models.
Proceedings of the Programming Languages and Systems, 2010

2009
Open Bisimulation for Aspects.
Trans. Aspect-Oriented Software Development, 2009

Game Semantics for Access Control.
Electr. Notes Theor. Comput. Sci., 2009

Towards a Theory of Accountability and Audit.
Proceedings of the Computer Security, 2009

2008
Lambda-RBAC: Programming with Role-Based Access Control.
Logical Methods in Computer Science, 2008

Tapido: Trust and Authorization Via Provenance and Integrity in Distributed Objects (Extended Abstract).
Proceedings of the Programming Languages and Systems, 2008

From Authorization Logics to Types for Authorization.
Proceedings of the Programming Languages and Systems, 6th Asian Symposium, 2008

2007
Lambda-RBAC: Programming with Role-Based Access Control
CoRR, 2007

Specifications of a high-level conflict-free firewall policy language for multi-domain networks.
Proceedings of the 12th ACM Symposium on Access Control Models and Technologies, 2007

A theory of memory models.
Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2007

Formal Foundations for Aspects.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

Do As I SaY! Programmatic Access Control with Explicit Identities.
Proceedings of the 20th IEEE Computer Security Foundations Symposium, 2007

Open bisimulation for aspects.
Proceedings of the 6th International Conference on Aspect-Oriented Software Development, 2007

2006
Typed parametric polymorphism for aspects.
Sci. Comput. Program., 2006

Approximate reasoning for real-time probabilistic processes.
Logical Methods in Computer Science, 2006

lambda-RBAC: Programming with Role-Based Access Control.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Games for Controls.
Proceedings of the 19th IEEE Computer Security Foundations Workshop, 2006

2005
Approximate reasoning for real-time probabilistic processes
CoRR, 2005

A game semantics for generic polymorphism.
Ann. Pure Appl. Logic, 2005

Timed constraint programming: a declarative approach to usage control.
Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2005

Testing Concurrent Systems: An Interpretation of Intuitionistic Logic.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Concurrent Clustered Programming.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004
Metrics for labelled Markov processes.
Theor. Comput. Sci., 2004

A domain equation for refinement of partial systems.
Mathematical Structures in Computer Science, 2004

Approximate Reasoning for Real-Time Probabilistic Processes.
Proceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 2004

Three-Valued Abstractions of Games: Uncertainty, but with Precision.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

µABC: A Minimal Aspect Calculus.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
LICS 2001 special issue.
ACM Trans. Comput. Log., 2003

Approximating labelled Markov processes.
Inf. Comput., 2003

On the Expressiveness of 3-Valued Models.
Proceedings of the Verification, 2003

A Game Semantics for Generic Polymorphism.
Proceedings of the Foundations of Software Science and Computational Structures, 2003

jcc: Integrating Timed Default Concurrent Constraint Programming into Java.
Proceedings of the Progress in Artificial Intelligence, 2003

A Calculus of Untyped Aspect-Oriented Programs.
Proceedings of the ECOOP 2003, 2003

2002
Truly concurrent constraint programming.
Theor. Comput. Sci., 2002

The Metric Analogue of Weak Bisimulation for Probabilistic Processes.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

Weak Bisimulation is Sound and Complete for PCTL*.
Proceedings of the CONCUR 2002, 2002

Automatic Abstraction Using Generalized Model Checking.
Proceedings of the Computer Aided Verification, 14th International Conference, 2002

2001
Modal Transition Systems: A Foundation for Three-Valued Program Analysis.
Proceedings of the Programming Languages and Systems, 2001

Abstraction-Based Model Checking Using Modal Transition Systems.
Proceedings of the CONCUR 2001, 2001

2000
The Triveni project.
ACM SIGSOFT Software Engineering Notes, 2000

Sisl: Several Interfaces, Single Logic.
I. J. Speech Technology, 2000

Full Abstraction for PCF.
Inf. Comput., 2000

Automated systematic testing for constraint-based interactive services.
Proceedings of the ACM SIGSOFT Symposium on Foundations of Software Engineering, 2000

Approximating Labeled Markov Processes.
Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

A Constraint-Based Framework for Prototyping Distributed Virtual Applications.
Proceedings of the Principles and Practice of Constraint Programming, 2000

1999
Stochastic Processes as Concurrent Constraint Programs.
Proceedings of the POPL '99, 1999

Metrics for Labeled Markov Systems.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998
Computing with Continuous Change.
Sci. Comput. Program., 1998

The Semantics of Triveni: A Process-Algebraic API for Threads + Events.
Electr. Notes Theor. Comput. Sci., 1998

Design and Implementation of Triveni: A Process-Algebraic API for Threads + Events.
Proceedings of the 1998 International Conference on Computer Languages, 1998

Objects and Concurrency in Triveni: A Telecommunication Case Study in Java.
Proceedings of the 4th USENIX Conference on Object-Oriented Technologies and Systems (COOTS), 1998

1997
Robust Timed Automata.
Proceedings of the Hybrid and Real-Time Systems, 1997

Probabilistic Concurrent Constraint Programming.
Proceedings of the CONCUR '97: Concurrency Theory, 1997

1996
Timed Default Concurrent Constraint Programming.
J. Symb. Comput., 1996

Truly Concurrent Constraint Programming.
Proceedings of the CONCUR '96, 1996

Models for Concurrent Constraint Programming.
Proceedings of the CONCUR '96, 1996

1995
Default Timed Concurrent Constraint Programming.
Proceedings of the Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995

Hybrid cc, Hybrid Automata and Program Verification.
Proceedings of the Hybrid Systems III: Verification and Control, 1995

Causality and True Concurrency: A Data-flow Analysis of the Pi-Calculus (Extended Abstract).
Proceedings of the Algebraic Methodology and Software Technology, 1995

1994
New Foundations for the Geometry of Interaction
Inf. Comput., May, 1994

Games and Full Completeness for Multiplicative Linear Logic.
J. Symb. Log., 1994

Full Abstraction for PCF.
Proceedings of the Theoretical Aspects of Computer Software, 1994

Foundations of Timed Concurrent Constraint Programming
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

Programming in Hybrid Constraint Languages.
Proceedings of the Hybrid Systems II, 1994

1993
Programming in Timed Concurrent Constraint Languages.
Proceedings of the Constraint Programming, 1993

1992
Abstract Semantics for a Higher-Order Functional Language with Logic Variables.
Proceedings of the Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1992

New Foundations for the Geometry of Interaction
Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

Games and Full Completeness for Multiplicative Linear Logic (Extended Abstract).
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992

1991
A Fully Abstract Semantics for a First-Order Functional Language with Logic Variables.
ACM Trans. Program. Lang. Syst., 1991

1990
A Domain-Theoretic Model for a Higher-Order Process Calculus.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989
L-domains and Lossless Powerdomains.
Proceedings of the Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29, 1989

A Fully Abstract Semantics for a Functional Language with Logic Variables
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989


  Loading...