default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRadha Jagadeesan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i11]Radha Jagadeesan:
(Towards a) Statistical Probabilistic Lazy Lambda Calculus. CoRR abs/2403.15570 (2024)- [i10]Samson Abramsky, Radha Jagadeesan:
Game Semantics for Higher-Order Unitary Quantum Computation. CoRR abs/2404.06646 (2024) - 2020
- [j23]Radha Jagadeesan, Alan Jeffrey, James Riely
:
Pomsets with preconditions: a simple model of relaxed memory. Proc. ACM Program. Lang. 4(OOPSLA): 194:1-194:30 (2020)
2010 – 2019
- 2019
- [c67]Brijesh Dongol, Radha Jagadeesan, James Riely:
Modular transactions: bounding mixed races in space and time. PPoPP 2019: 82-93 - [c66]Craig Disselkoen, Radha Jagadeesan, Alan Jeffrey, James Riely:
The Code That Never Ran: Modeling Attacks on Speculative Evaluation. IEEE Symposium on Security and Privacy 2019: 1238-1255 - 2018
- [j22]Matthijs Vákár, Radha Jagadeesan, Samson Abramsky:
Game semantics for dependent types. Inf. Comput. 261: 401-431 (2018) - [j21]Brijesh Dongol, Radha Jagadeesan, James Riely:
Transactions in relaxed memory architectures. Proc. ACM Program. Lang. 2(POPL): 18:1-18:29 (2018) - [c65]Radha Jagadeesan, James Riely:
Eventual Consistency for CRDTs. ESOP 2018: 968-995 - [c64]Brijesh Dongol, Radha Jagadeesan, James Riely, Alasdair Armstrong:
On abstraction and compositionality for weak-memory linearisability. VMCAI 2018: 183-204 - 2016
- [j20]Matthew A. Goto, Radha Jagadeesan, Alan Jeffrey, Corin Pitcher, James Riely:
An extensible approach to session polymorphism. Math. Struct. Comput. Sci. 26(3): 465-509 (2016) - [e1]Josée Desharnais, Radha Jagadeesan:
27th International Conference on Concurrency Theory, CONCUR 2016, August 23-26, 2016, Québec City, Canada. LIPIcs 59, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-017-0 [contents] - 2015
- [c63]Samson Abramsky, Radha Jagadeesan, Matthijs Vákár:
Games for Dependent Types. ICALP (2) 2015: 31-43 - [c62]Radha Jagadeesan, James Riely:
From Sequential Specifications to Eventual Consistency. ICALP (2) 2015: 247-259 - [i9]Samson Abramsky, Radha Jagadeesan, Matthijs Vákár:
Games for Dependent Types. CoRR abs/1508.05023 (2015) - 2014
- [c61]Vijay A. Saraswat, Vineet Gupta, Radha Jagadeesan:
TCC, with History. Horizons of the Mind 2014: 458-475 - [c60]Radha Jagadeesan, C. M. Lubinski, Corin Pitcher, James Riely, Charles Winebrinner:
Certificates for Verifiable Forensics. CSF 2014: 33-47 - [c59]Radha Jagadeesan, James Riely:
Between Linearizability and Quiescent Consistency - Quantitative Quiescent Consistency. ICALP (2) 2014: 220-231 - [i8]Samson Abramsky, Radha Jagadeesan:
Game Semantics for Access Control. CoRR abs/1401.5325 (2014) - [i7]Radha Jagadeesan, James Riely:
Between Linearizability and Quiescent Consistency: Quantitative Quiescent Consistency. CoRR abs/1402.4043 (2014) - 2013
- [c58]Radha Jagadeesan, Gustavo Petri, Corin Pitcher, James Riely:
Quarantining Weakness - Compositional Reasoning under Relaxed Memory Models (Extended Abstract). ESOP 2013: 492-511 - [c57]Radha Jagadeesan, Corin Pitcher, James Riely:
Noninterference for Intuitionist Necessity. ICLA 2013: 185-196 - [i6]Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta:
TCC, with History. CoRR abs/1310.5538 (2013) - [i5]Samson Abramsky, Radha Jagadeesan:
Games and Full Completeness for Multiplicative Linear Logic. CoRR abs/1311.6057 (2013) - [i4]Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria:
Full Abstraction for PCF. CoRR abs/1311.6125 (2013) - [i3]Samson Abramsky, Radha Jagadeesan:
A Game Semantics for Generic Polymorphism. CoRR abs/1312.1120 (2013) - 2012
- [c56]Radha Jagadeesan, Corin Pitcher, James Riely:
Succour to the Confused Deputy - Types for Capabilities. APLAS 2012: 66-81 - [c55]Radha Jagadeesan, Gustavo Petri, James Riely:
Brookes Is Relaxed, Almost! FoSSaCS 2012: 180-194 - [c54]Matthew Goto, Radha Jagadeesan, Corin Pitcher, James Riely:
Types for relaxed memory models. TLDI 2012: 25-38 - 2011
- [c53]Radha Jagadeesan, Corin Pitcher, Julian Rathke, James Riely:
Local Memory via Layout Randomization. CSF 2011: 161-174 - 2010
- [j19]Josée Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden:
Weak bisimulation is sound and complete for pCTL*. Inf. Comput. 208(2): 203-219 (2010) - [c52]Radha Jagadeesan, Corin Pitcher, James Riely:
Generative Operational Semantics for Relaxed Memory Models. ESOP 2010: 307-326
2000 – 2009
- 2009
- [j18]Radha Jagadeesan, Corin Pitcher, James Riely:
Open Bisimulation for Aspects. LNCS Trans. Aspect Oriented Softw. Dev. 5: 72-132 (2009) - [c51]Radha Jagadeesan, Alan Jeffrey, Corin Pitcher, James Riely:
Towards a Theory of Accountability and Audit. ESORICS 2009: 152-167 - [c50]Samson Abramsky, Radha Jagadeesan:
Game Semantics for Access Control. MFPS 2009: 135-156 - 2008
- [j17]Radha Jagadeesan, Alan Jeffrey, Corin Pitcher, James Riely:
Lambda-RBAC: Programming with Role-Based Access Control. Log. Methods Comput. Sci. 4(1) (2008) - [c49]Radha Jagadeesan:
From Authorization Logics to Types for Authorization. APLAS 2008: 255 - [c48]Andrew Cirillo, Radha Jagadeesan, Corin Pitcher, James Riely:
Tapido: Trust and Authorization Via Provenance and Integrity in Distributed Objects (Extended Abstract). ESOP 2008: 208-223 - 2007
- [c47]Radha Jagadeesan, Corin Pitcher, James Riely:
Open bisimulation for aspects. AOSD 2007: 107-120 - [c46]Andrew Cirillo, Radha Jagadeesan, Corin Pitcher, James Riely:
Do As I SaY! Programmatic Access Control with Explicit Identities. CSF 2007: 16-30 - [c45]Radha Jagadeesan:
Formal Foundations for Aspects. FoSSaCS 2007: 1 - [c44]Vijay A. Saraswat, Radha Jagadeesan, Maged M. Michael, Christoph von Praun:
A theory of memory models. PPoPP 2007: 161-172 - [c43]Bin Zhang, Ehab Al-Shaer, Radha Jagadeesan, James Riely, Corin Pitcher:
Specifications of a high-level conflict-free firewall policy language for multi-domain networks. SACMAT 2007: 185-194 - [i2]Radha Jagadeesan, Alan Jeffrey, Corin Pitcher, James Riely:
Lambda-RBAC: Programming with Role-Based Access Control. CoRR abs/0712.1205 (2007) - 2006
- [j16]Vineet Gupta, Radha Jagadeesan, Prakash Panangaden:
Approximate reasoning for real-time probabilistic processes. Log. Methods Comput. Sci. 2(1) (2006) - [j15]Radha Jagadeesan, Alan Jeffrey, James Riely:
Typed parametric polymorphism for aspects. Sci. Comput. Program. 63(3): 267-296 (2006) - [c42]Krishnendu Chatterjee, Radha Jagadeesan, Corin Pitcher:
Games for Controls. CSFW 2006: 70-84 - [c41]Radha Jagadeesan, Alan Jeffrey, Corin Pitcher, James Riely:
lambda-RBAC: Programming with Role-Based Access Control. ICALP (2) 2006: 456-467 - 2005
- [j14]Samson Abramsky, Radha Jagadeesan:
A game semantics for generic polymorphism. Ann. Pure Appl. Log. 133(1-3): 3-37 (2005) - [c40]Vijay A. Saraswat, Radha Jagadeesan:
Concurrent Clustered Programming. CONCUR 2005: 353-367 - [c39]Radha Jagadeesan, Gopalan Nadathur, Vijay A. Saraswat:
Testing Concurrent Systems: An Interpretation of Intuitionistic Logic. FSTTCS 2005: 517-528 - [c38]Radha Jagadeesan, Will Marrero, Corin Pitcher, Vijay A. Saraswat:
Timed constraint programming: a declarative approach to usage control. PPDP 2005: 164-175 - [i1]Vineet Gupta, Radha Jagadeesan, Prakash Panangaden:
Approximate reasoning for real-time probabilistic processes. CoRR abs/cs/0505063 (2005) - 2004
- [j13]Michael Huth, Radha Jagadeesan, David A. Schmidt:
A domain equation for refinement of partial systems. Math. Struct. Comput. Sci. 14(4): 469-505 (2004) - [j12]Josée Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden:
Metrics for labelled Markov processes. Theor. Comput. Sci. 318(3): 323-354 (2004) - [c37]Glenn Bruns, Radha Jagadeesan, Alan Jeffrey, James Riely:
µABC: A Minimal Aspect Calculus. CONCUR 2004: 209-224 - [c36]Luca de Alfaro, Patrice Godefroid, Radha Jagadeesan:
Three-Valued Abstractions of Games: Uncertainty, but with Precision. LICS 2004: 170-179 - [c35]Vineet Gupta, Radha Jagadeesan, Prakash Panangaden:
Approximate Reasoning for Real-Time Probabilistic Processes. QEST 2004: 304-313 - 2003
- [j11]Josée Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden:
Approximating labelled Markov processes. Inf. Comput. 184(1): 160-200 (2003) - [j10]Erich Grädel, Joseph Y. Halpern, Radha Jagadeesan, Adolfo Piperno:
LICS 2001 special issue. ACM Trans. Comput. Log. 4(3): 295 (2003) - [c34]Radha Jagadeesan, Alan Jeffrey, James Riely:
A Calculus of Untyped Aspect-Oriented Programs. ECOOP 2003: 54-73 - [c33]Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta:
jcc: Integrating Timed Default Concurrent Constraint Programming into Java. EPIA 2003: 156-170 - [c32]Samson Abramsky, Radha Jagadeesan:
A Game Semantics for Generic Polymorphism. FoSSaCS 2003: 1-22 - [c31]Patrice Godefroid, Radha Jagadeesan:
On the Expressiveness of 3-Valued Models. VMCAI 2003: 206-222 - 2002
- [j9]Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat:
Truly concurrent constraint programming. Theor. Comput. Sci. 278(1-2): 223-255 (2002) - [c30]Patrice Godefroid, Radha Jagadeesan:
Automatic Abstraction Using Generalized Model Checking. CAV 2002: 137-150 - [c29]Josée Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden:
Weak Bisimulation is Sound and Complete for PCTL*. CONCUR 2002: 355-370 - [c28]Josée Desharnais, Radha Jagadeesan, Vineet Gupta, Prakash Panangaden:
The Metric Analogue of Weak Bisimulation for Probabilistic Processes. LICS 2002: 413-422 - 2001
- [c27]Patrice Godefroid, Michael Huth, Radha Jagadeesan:
Abstraction-Based Model Checking Using Modal Transition Systems. CONCUR 2001: 426-440 - [c26]Michael Huth, Radha Jagadeesan, David A. Schmidt:
Modal Transition Systems: A Foundation for Three-Valued Program Analysis. ESOP 2001: 155-169 - 2000
- [j8]Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria:
Full Abstraction for PCF. Inf. Comput. 163(2): 409-470 (2000) - [j7]Thomas Ball, Christopher Colby, Peter J. Danielsen, Lalita Jategaonkar Jagadeesan, Radha Jagadeesan, Konstantin Läufer, Peter Mataga, Kenneth Rehor:
Sisl: Several Interfaces, Single Logic. Int. J. Speech Technol. 3(2): 93-108 (2000) - [j6]Radha Jagadeesan, Konstantin Läufer, Vineet Gupta:
The Triveni project. ACM SIGSOFT Softw. Eng. Notes 25(1): 59 (2000) - [c25]Vineet Gupta, Lalita Jategaonkar Jagadeesan, Radha Jagadeesan, Xiaowei Jiang, Konstantin Läufer:
A Constraint-Based Framework for Prototyping Distributed Virtual Applications. CP 2000: 202-217 - [c24]Josée Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden:
Approximating Labeled Markov Processes. LICS 2000: 95-106 - [c23]Patrice Godefroid, Lalita Jategaonkar Jagadeesan, Radha Jagadeesan, Konstantin Läufer:
Automated systematic testing for constraint-based interactive services. SIGSOFT FSE 2000: 40-49
1990 – 1999
- 1999
- [c22]Josée Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden:
Metrics for Labeled Markov Systems. CONCUR 1999: 258-273 - [c21]Vineet Gupta, Radha Jagadeesan, Prakash Panangaden:
Stochastic Processes as Concurrent Constraint Programs. POPL 1999: 189-202 - 1998
- [j5]Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat:
Computing with Continuous Change. Sci. Comput. Program. 30(1-2): 3-49 (1998) - [c20]Christopher Colby, Lalita Jategaonkar Jagadeesan, Radha Jagadeesan, Konstantin Läufer, Carlos Puchol:
Objects and Concurrency in Triveni: A Telecommunication Case Study in Java. COOTS 1998: 131-149 - [c19]Christopher Colby, Lalita Jategaonkar Jagadeesan, Radha Jagadeesan, Konstantin Läufer, Carlos Puchol:
Design and Implementation of Triveni: A Process-Algebraic API for Threads + Events. ICCL 1998: 58-67 - 1997
- [c18]Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat:
Probabilistic Concurrent Constraint Programming. CONCUR 1997: 243-257 - [c17]Vineet Gupta, Thomas A. Henzinger, Radha Jagadeesan:
Robust Timed Automata. HART 1997: 331-345 - [c16]Christopher Colby, Lalita Jategaonkar, Radha Jagadeesan, Konstantin Läufer, Carlos Puchol:
The Semantics of Triveni: A Process-Algebraic API for Threads + Events. US-Brazil Joint Workshops on the Formal Foundations of Software Systems 1997: 107-133 - 1996
- [j4]Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta:
Timed Default Concurrent Constraint Programming. J. Symb. Comput. 22(5/6): 475-520 (1996) - [c15]Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat:
Models for Concurrent Constraint Programming. CONCUR 1996: 66-83 - [c14]Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat:
Truly Concurrent Constraint Programming. CONCUR 1996: 373-388 - 1995
- [c13]Lalita Jategaonkar Jagadeesan, Radha Jagadeesan:
Causality and True Concurrency: A Data-flow Analysis of the Pi-Calculus (Extended Abstract). AMAST 1995: 277-291 - [c12]Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat:
Hybrid cc, Hybrid Automata and Program Verification. Hybrid Systems 1995: 52-63 - [c11]Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta:
Default Timed Concurrent Constraint Programming. POPL 1995: 272-285 - 1994
- [j3]Samson Abramsky, Radha Jagadeesan:
New Foundations for the Geometry of Interaction. Inf. Comput. 111(1): 53-119 (1994) - [j2]Samson Abramsky, Radha Jagadeesan:
Games and Full Completeness for Multiplicative Linear Logic. J. Symb. Log. 59(2): 543-574 (1994) - [c10]Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat, Daniel G. Bobrow:
Programming in Hybrid Constraint Languages. Hybrid Systems 1994: 226-251 - [c9]Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta:
Foundations of Timed Concurrent Constraint Programming. LICS 1994: 71-80 - [c8]Samson Abramsky, Pasquale Malacaria, Radha Jagadeesan:
Full Abstraction for PCF. TACS 1994: 1-15 - 1993
- [c7]Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta:
Programming in Timed Concurrent Constraint Languages. NATO ASI CP 1993: 367-413 - 1992
- [c6]Samson Abramsky, Radha Jagadeesan:
Games and Full Completeness for Multiplicative Linear Logic (Extended Abstract). FSTTCS 1992: 291-301 - [c5]Samson Abramsky, Radha Jagadeesan:
New Foundations for the Geometry of Interaction. LICS 1992: 211-222 - [c4]Radha Jagadeesan, Keshav Pingali:
Abstract Semantics for a Higher-Order Functional Language with Logic Variables. POPL 1992: 355-366 - 1991
- [b1]Radha Jagadeesan:
Investigations Into Abstraction And Concurrency. Cornell University, USA, 1991 - [j1]Radha Jagadeesan, Keshav Pingali, Prakash Panangaden:
A Fully Abstract Semantics for a First-Order Functional Language with Logic Variables. ACM Trans. Program. Lang. Syst. 13(4): 577-625 (1991) - 1990
- [c3]Radha Jagadeesan, Prakash Panangaden:
A Domain-Theoretic Model for a Higher-Order Process Calculus. ICALP 1990: 181-194
1980 – 1989
- 1989
- [c2]Radha Jagadeesan, Prakash Panangaden, Keshav Pingali:
A Fully Abstract Semantics for a Functional Language with Logic Variables. LICS 1989: 294-303 - [c1]Radha Jagadeesan:
L-domains and Lossless Powerdomains. Mathematical Foundations of Programming Semantics 1989: 364-372
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
