Andre Scedrov
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
49
Venues
28
Active years
1987–2022
Best venue rank
A*
Where they publish
- A*LICS9 papers
- ACADE4 papers
- A*CCS4 papers
- BFG3 papers
- AESORICS3 papers
- CWoLLIC2 papers
- BCONCUR2 papers
- A*FOCS2 papers
- CICTAC1 paper
- CICISSP1 paper
- BFCT1 paper
- NationalLFCS1 paper
- BPKC1 paper
- A*CRYPTO1 paper
- A*INFOCOM1 paper
- BICNP1 paper
- A*PODC1 paper
- A*SIGCOMM1 paper
- ATACAS1 paper
- CFORTE1 paper
- CPPDP1 paper
- BACNS1 paper
- BTCC1 paper
- A*POPL1 paper
- BFOSSACS1 paper
- BFM1 paper
- BCSL1 paper
- BMFPS1 paper
Papers
49 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2022 | CADE | Non-associative, Non-commutative Multi-modal Linear Logic. | Eben Blaisdell, Max I. Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov |
| 2022 | ICTAC | On the Formalization and Computational Complexity of Resilience Problems for Cyber-Physical Systems. | Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott |
| 2021 | ICISSP | On Security Analysis of Periodic Systems: Expressiveness and Complexity. | Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott |
| 2020 | CADE | Soft Subexponentials and Multiplexing. | Max I. Kanovich, Stepan L. Kuznetsov, Vivek Nigam, Andre Scedrov |
| 2019 | FG | Undecidability of a Newly Proposed Calculus for CatLog3. | Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov |
| 2019 | WoLLIC | The Complexity of Multiplicative-Additive Lambek Calculus: 25 Years Later. | Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov |
| 2019 | WoLLIC | L-Models and R-Models for Lambek Calculus Enriched with Additives and the Multiplicative Unit. | Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov |
| 2018 | CADE | A Logical Framework with Commutative and Non-commutative Subexponentials. | Max I. Kanovich, Stepan L. Kuznetsov, Vivek Nigam, Andre Scedrov |
| 2018 | CCS | Statistical Model Checking of Distance Fraud Attacks on the Hancke-Kuhn Family of Protocols. | Musab A. AlTurki, Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott |
| 2018 | FG | Bracket Induction for Lambek Calculus with Bracket Modalities. | Glyn Morrill, Stepan L. Kuznetsov, Max I. Kanovich, Andre Scedrov |
| 2017 | FCT | Undecidability of the Lambek Calculus with Subexponential and Bracket Modalities. | Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov |
| 2016 | FG | Undecidability of the Lambek Calculus with a Relevant Modality. | Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov |
| 2016 | LFCS | On Lambek's Restriction in the Presence of Exponential Modalities. | Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov |
| 2015 | PKC | Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds. | Gilles Barthe, Edvard Fagerholm, Dario Fiore, Andre Scedrov, Benedikt Schmidt, Mehdi Tibouchi |
| 2014 | CRYPTO | Automated Analysis of Cryptographic Assumptions in Generic Group Models. | Gilles Barthe, Edvard Fagerholm, Dario Fiore, John C. Mitchell, Andre Scedrov, Benedikt Schmidt |
| 2014 | INFOCOM | A reduction-based approach towards scaling up formal analysis of internet configurations. | Anduo Wang, Alexander J. T. Gurney, Xianglong Han, Jinyan Cao, Boon Thau Loo, Carolyn L. Talcott, Andre Scedrov |
| 2013 | ESORICS | Bounded Memory Protocols and Progressing Collaborative Systems. | Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov |
| 2013 | ICNP | Automated synthesis of reactive controllers for software-defined networks. | Anduo Wang, Salar Moarref, Boon Thau Loo, Ufuk Topcu, Andre Scedrov |
| 2012 | PODC | Brief announcement: a calculus of policy-based routing systems. | Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gurney, Boon Thau Loo, Andre Scedrov |
| 2012 | SIGCOMM | Reduction-based analysis of BGP systems with BGPVerif. | Anduo Wang, Alexander J. T. Gurney, Xianglong Han, Jinyan Cao, Carolyn L. Talcott, Boon Thau Loo, Andre Scedrov |
| 2012 | TACAS | Reduction-Based Formal Analysis of BGP Instances. | Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gurney, Boon Thau Loo, Andre Scedrov |
| 2011 | FORTE | Analyzing BGP Instances in Maude. | Anduo Wang, Carolyn L. Talcott, Limin Jia, Boon Thau Loo, Andre Scedrov |
| 2011 | PPDP | Maintaining distributed logic programs incrementally. | Vivek Nigam, Limin Jia, Boon Thau Loo, Andre Scedrov |
| 2010 | LICS | An Operational Semantics for Network Datalog. | Vivek Nigam, Limin Jia, Anduo Wang, Boon Thau Loo, Andre Scedrov |
| 2008 | ACNS | Analysis of EAP-GPSK Authentication Protocol. | John C. Mitchell, Arnab Roy, Paul D. Rowe, Andre Scedrov |
| 2008 | CCS | Computationally sound mechanized proofs for basic and public-key Kerberos. | Bruno Blanchet, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay |
| 2006 | ESORICS | Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos. | Michael Backes, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay |
| 2006 | TCC | Games and the Impossibility of Realizable Ideal Functionality. | Anupam Datta, Ante Derek, John C. Mitchell, Ajith Ramanathan, Andre Scedrov |
| 2005 | ESORICS | Soundness of Formal Encryption in the Presence of Key-Cycles. | Pedro Ado, Gergei Bana, Jonathan Herzog, Andre Scedrov |
| 2005 | POPL | Specifying Kerberos 5 cross-realm authentication. | Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Christopher Walstad |
| 2004 | FOSSACS | Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols. | Ajith Ramanathan, John C. Mitchell, Andre Scedrov, Vanessa Teague |
| 2003 | CONCUR | Contract Signing, Optimism, and Advantage. | Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov |
| 2003 | CONCUR | Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus. | Paulo Mateus, John C. Mitchell, Andre Scedrov |
| 2001 | CCS | Inductive methods and contract-signing protocols. | Rohit Chadha, Max I. Kanovich, Andre Scedrov |
| 2001 | LICS | Probabilistic Polynominal-Time Process Calculus and Security Protocol Analysis. | John C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague |
| 1999 | FM | Probabilistic Polynomial-Time Equivalence and Security Analysis. | Patrick Lincoln, John C. Mitchell, Mark Mitchell, Andre Scedrov |
| 1998 | CCS | A Probabilistic Poly-Time Framework for Protocol Analysis. | Patrick Lincoln, John C. Mitchell, Mark Mitchell, Andre Scedrov |
| 1998 | FOCS | A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time. | John C. Mitchell, Mark Mitchell, Andre Scedrov |
| 1995 | LICS | Decision Problems for Second-Order Linear Logic | Patrick Lincoln, Andre Scedrov, Natarajan Shankar |
| 1992 | CSL | Notes on Sconing and Relators. | John C. Mitchell, Andre Scedrov |
| 1991 | LICS | Linearizing Intuitionistic Implication | Patrick Lincoln, Andre Scedrov, Natarajan Shankar |
| 1990 | FOCS | Decision Problems for Propositional Linear Logic | Patrick Lincoln, John C. Mitchell, Andre Scedrov, Natarajan Shankar |
| 1989 | LICS | Inheritance and Explicit Coercion (Preliminary Report) | Val Tannen, Thierry Coquand, Carl A. Gunter, Andre Scedrov |
| 1989 | LICS | Polynomially Grade Logic I: A Graded Version of System T | Anil Nerode, Jeffrey B. Remmel, Andre Scedrov |
| 1988 | CADE | Lambda-Prolog: An Extended Logic Programming Language. | Amy P. Felty, Elsa L. Gunter, John Hannan, Dale Miller, Gopalan Nadathur, Andre Scedrov |
| 1988 | LICS | Semantic Parametricity in Polymorphic Lambda Calculus | Peter J. Freyd, Jean-Yves Girard, Andre Scedrov, Philip J. Scott |
| 1987 | LICS | Some Semantic Aspects of Polymorphic Lambda Calculus | Peter J. Freyd, Andre Scedrov |
| 1987 | LICS | Hereditary Harrop Formulas and Uniform Proof Systems | Dale Miller, Gopalan Nadathur, Andre Scedrov |
| 1987 | MFPS | A Categorical Approach to Realizability and Polymorphic Types. | Aurelio Carboni, Peter J. Freyd, Andre Scedrov |