Andre Scedrov - RankMe

168 papers A* 15A 12B 17C 8Misc 1Journal 74Unranked 36

Year	Rank	Type	Title / Venue / Authors
2026	C	`conf`	Complexity of Equational Theories for Relational and Language Action Lattices. RAMICS Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2026	J	`jnl`	Verification of time-bounded multiset rewriting properties. J. Log. Algebraic Methods Program. Tajana Ban Kirigin, Jesse Comer, Max I. Kanovich, Andre Scedrov, Carolyn L. Talcott
2025	J	`jnl`	WoLLIC 2023 - 29th Workshop on Logic, Language, Information and Computation. Math. Struct. Comput. Sci. Helle Hvid Hansen, Andre Scedrov, Ruy J. G. B. de Queiroz
2024	J	`jnl`	Technical Report: Time-Bounded Resilience. CoRR Tajana Ban Kirigin, Jesse Comer, Max I. Kanovich, Andre Scedrov, Carolyn L. Talcott
2024	—	`conf`	Time-Bounded Resilience. WRLA Tajana Ban Kirigin, Jesse Comer, Max I. Kanovich, Andre Scedrov, Carolyn L. Talcott
2023	—	`conf`	Explorations in Subexponential Non-associative Non-commutative Linear Logic. AMSLO@ESSLLI Eben Blaisdell, Max I. Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov
2023	J	`jnl`	Explorations in Subexponential non-associative non-commutative Linear Logic (extended version). CoRR Eben Blaisdell, Max I. Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov
2023	C	`ed.`	Logic, Language, Information, and Computation - 29th International Workshop, WoLLIC 2023, Halifax, NS, Canada, July 11-14, 2023, Proceedings WoLLIC Helle Hvid Hansen, Andre Scedrov, Ruy J. G. B. de Queiroz
2022	J	`jnl`	Language models for some extensions of the Lambek calculus. Inf. Comput. Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2022	A	`conf`	Non-associative, Non-commutative Multi-modal Linear Logic. IJCAR Eben Blaisdell, Max I. Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov
2022	C	`conf`	On the Formalization and Computational Complexity of Resilience Problems for Cyber-Physical Systems. ICTAC Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2022	J	`jnl`	On the Security and Complexity of Periodic Systems. SN Comput. Sci. Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2021	J	`jnl`	Correction to: The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities. J. Log. Lang. Inf. Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2021	C	`conf`	On Security Analysis of Periodic Systems: Expressiveness and Complexity. ICISSP Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2021	—	`conf`	On the Complexity of Verification of Time-Sensitive Distributed Systems. Protocols, Strands, and Logic Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2021	J	`jnl`	On the Complexity of Verification of Time-Sensitive Distributed Systems: Technical Report. CoRR Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2021	J	`jnl`	Resource and timing aspects of security protocols. J. Comput. Secur. Abraão Aires Urquiza, Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2021	J	`jnl`	The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities. J. Log. Lang. Inf. Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2020	J	`jnl`	Language Models for Some Extensions of the Lambek Calculus. CoRR Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2020	J	`jnl`	Reconciling Lambek's restriction, cut-elimination and substitution in the presence of exponential modalities. J. Log. Comput. Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2020	—	`conf`	Soft Subexponentials and Multiplexing. IJCAR (1) Max I. Kanovich, Stepan L. Kuznetsov, Vivek Nigam, Andre Scedrov
2020	J	`jnl`	The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities. CoRR Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2019	—	`conf`	A Multiset Rewriting Model for Specifying and Verifying Timing Aspects of Security Protocols. Foundations of Security, Protocols, and Equational Reasoning Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2019	J	`jnl`	Automated Analysis of Cryptographic Assumptions in Generic Group Models. J. Cryptol. Gilles Barthe, Edvard Fagerholm, Dario Fiore, John C. Mitchell, Andre Scedrov, Benedikt Schmidt
2019	C	`conf`	L-Models and R-Models for Lambek Calculus Enriched with Additives and the Multiplicative Unit. WoLLIC Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2019	A	`conf`	Resource-Bounded Intruders in Denial of Service Attacks. CSF Abraão Aires Urquiza, Musab A. Alturki, Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2019	J	`jnl`	Subexponentials in non-commutative linear logic. Math. Struct. Comput. Sci. Max I. Kanovich, Stepan L. Kuznetsov, Vivek Nigam, Andre Scedrov
2019	C	`conf`	The Complexity of Multiplicative-Additive Lambek Calculus: 25 Years Later. WoLLIC Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2019	B	`conf`	Undecidability of a Newly Proposed Calculus for CatLog3. FG Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2018	A	`conf`	A Logical Framework with Commutative and Non-commutative Subexponentials. IJCAR Max I. Kanovich, Stepan L. Kuznetsov, Vivek Nigam, Andre Scedrov
2018	B	`conf`	Bracket Induction for Lambek Calculus with Bracket Modalities. FG Glyn Morrill, Stepan L. Kuznetsov, Max I. Kanovich, Andre Scedrov
2018	J	`jnl`	Compliance in Real Time Multiset Rewriting Models. CoRR Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2018	—	`conf`	Statistical Model Checking of Distance Fraud Attacks on the Hancke-Kuhn Family of Protocols. CPS-SPC@CCS Musab A. Alturki, Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2017	B	`conf`	A Polynomial-Time Algorithm for the Lambek Calculus with Brackets of Bounded Order. FSCD Max I. Kanovich, Stepan L. Kuznetsov, Glyn Morrill, Andre Scedrov
2017	J	`jnl`	A polynomial time algorithm for the Lambek calculus with brackets of bounded order. CoRR Max I. Kanovich, Stepan L. Kuznetsov, Glyn Morrill, Andre Scedrov
2017	J	`jnl`	A rewriting framework and logic for activities subject to regulations. Math. Struct. Comput. Sci. Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott, Ranko Perovic
2017	J	`jnl`	Time, Computational Complexity, and Probability in the Analysis of Distance-Bounding Protocols. CoRR Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2017	J	`jnl`	Time, computational complexity, and probability in the analysis of distance-bounding protocols. J. Comput. Secur. Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2017	B	`conf`	Undecidability of the Lambek Calculus with Subexponential and Bracket Modalities. FCT Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2016	Misc	`conf`	On Lambek's Restriction in the Presence of Exponential Modalities. LFCS Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2016	J	`jnl`	Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities. CoRR Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2016	J	`jnl`	Strongly-optimal structure preserving signatures from Type II pairings: synthesis and lower bounds. IET Inf. Secur. Gilles Barthe, Edvard Fagerholm, Dario Fiore, Andre Scedrov, Benedikt Schmidt, Mehdi Tibouchi
2016	—	`conf`	Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems. FORMATS Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2016	J	`jnl`	Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems. CoRR Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2016	B	`conf`	Undecidability of the Lambek Calculus with a Relevant Modality. FG Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2016	J	`jnl`	Undecidability of the Lambek calculus with a relevant modality. CoRR Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2016	J	`jnl`	Undecidability of the Lambek calculus with subexponentials and bracket modalities. CoRR Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2015	—	`conf`	Discrete vs. Dense Times in the Analysis of Cyber-Physical Security Protocols. POST Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2015	—	`conf`	Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds. Public Key Cryptography Gilles Barthe, Edvard Fagerholm, Dario Fiore, Andre Scedrov, Benedikt Schmidt, Mehdi Tibouchi
2015	J	`jnl`	Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds. IACR Cryptol. ePrint Arch. Gilles Barthe, Edvard Fagerholm, Dario Fiore, Andre Scedrov, Benedikt Schmidt, Mehdi Tibouchi
2014	A*	`conf`	A reduction-based approach towards scaling up formal analysis of internet configurations. INFOCOM Anduo Wang, Alexander J. T. Gurney, Xianglong Han, Jinyan Cao, Boon Thau Loo, Carolyn L. Talcott, Andre Scedrov
2014	—	`conf`	Automated Analysis of Cryptographic Assumptions in Generic Group Models. CRYPTO (1) Gilles Barthe, Edvard Fagerholm, Dario Fiore, John C. Mitchell, Andre Scedrov, Benedikt Schmidt
2014	J	`jnl`	Automated Analysis of Cryptographic Assumptions in Generic Group Models. IACR Cryptol. ePrint Arch. Gilles Barthe, Edvard Fagerholm, Dario Fiore, John C. Mitchell, Andre Scedrov, Benedikt Schmidt
2014	J	`jnl`	Bounded memory Dolev-Yao adversaries in collaborative systems. Inf. Comput. Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov
2014	J	`jnl`	Bounded memory protocols. Comput. Lang. Syst. Struct. Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov
2014	J	`jnl`	Editors' foreword. J. Comput. Syst. Sci. Lev D. Beklemishev, Ruy J. G. B. de Queiroz, Andre Scedrov
2014	—	`conf`	When Not All Bits Are Equal: Worth-Based Information Flow. POST Mário S. Alvim, Andre Scedrov, Fred B. Schneider
2013	B	`conf`	Automated synthesis of reactive controllers for software-defined networks. ICNP Anduo Wang, Salar Moarref, Boon Thau Loo, Ufuk Topcu, Andre Scedrov
2013	A	`conf`	Bounded Memory Protocols and Progressing Collaborative Systems. ESORICS Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov
2012	—	`conf`	A Rewriting Framework for Activities Subject to Regulations. RTA Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott, Ranko Perovic
2012	A*	`conf`	Brief announcement: a calculus of policy-based routing systems. PODC Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gurney, Boon Thau Loo, Andre Scedrov
2012	—	`conf`	Declarative privacy policy: finite models and attribute-based encryption. IHI Peifung E. Lam, John C. Mitchell, Andre Scedrov, Sharada Sundaram, Frank Wang
2012	J	`jnl`	FSR: formal analysis and implementation toolkit for safe interdomain routing. IEEE/ACM Trans. Netw. Anduo Wang, Limin Jia, Wenchao Zhou, Yiqing Ren, Boon Thau Loo, Jennifer Rexford, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2012	J	`jnl`	Maintaining distributed logic programs incrementally. Comput. Lang. Syst. Struct. Vivek Nigam, Limin Jia, Boon Thau Loo, Andre Scedrov
2012	A	`conf`	Reduction-Based Formal Analysis of BGP Instances. TACAS Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gurney, Boon Thau Loo, Andre Scedrov
2012	A*	`conf`	Reduction-based analysis of BGP systems with BGPVerif. SIGCOMM Anduo Wang, Alexander J. T. Gurney, Xianglong Han, Jinyan Cao, Carolyn L. Talcott, Boon Thau Loo, Andre Scedrov
2012	—	`conf`	Towards an automated assistant for clinical investigations. IHI Vivek Nigam, Tajana Ban Kirigin, Andre Scedrov, Carolyn L. Talcott, Max I. Kanovich, Ranko Perovic
2011	—	`conf`	Analyzing BGP Instances in Maude. FMOODS/FORTE Anduo Wang, Carolyn L. Talcott, Limin Jia, Boon Thau Loo, Andre Scedrov
2011	J	`jnl`	Collaborative Planning with Confidentiality. J. Autom. Reason. Max I. Kanovich, Paul D. Rowe, Andre Scedrov
2011	J	`jnl`	Cryptographically sound security proofs for basic and public-key Kerberos. Int. J. Inf. Sec. Michael Backes, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay
2011	C	`conf`	Maintaining distributed logic programs incrementally. PPDP Vivek Nigam, Limin Jia, Boon Thau Loo, Andre Scedrov
2010	—	`conf`	An Operational Semantics for Network Datalog. LAM@LICS Vivek Nigam, Limin Jia, Anduo Wang, Boon Thau Loo, Andre Scedrov
2010	—	`conf`	Bounded Memory Dolev-Yao Adversaries in Collaborative Systems. Formal Aspects in Security and Trust Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov
2009	A	`conf`	Policy Compliance in Collaborative Systems. CSF Max I. Kanovich, Paul D. Rowe, Andre Scedrov
2009	J	`jnl`	Relating state-based and process-based concurrency through linear logic (full-version). Inf. Comput. Iliano Cervesato, Andre Scedrov
2009	J	`jnl`	Soundness and completeness of formal encryption: The cases of key cycles and partial information leakage. J. Comput. Secur. Pedro Adão, Gergei Bana, Jonathan Herzog, Andre Scedrov
2008	B	`conf`	Analysis of EAP-GPSK Authentication Protocol. ACNS John C. Mitchell, Arnab Roy, Paul D. Rowe, Andre Scedrov
2008	J	`jnl`	Breaking and fixing public-key Kerberos. Inf. Comput. Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad
2008	A	`conf`	Computationally sound mechanized proofs for basic and public-key Kerberos. AsiaCCS Bruno Blanchet, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay
2008	J	`jnl`	Key-dependent message security under active attacks - BRSIM/UC-soundness of Dolev-Yao-style encryption with key cycles. J. Comput. Secur. Michael Backes, Birgit Pfitzmann, Andre Scedrov
2007	A	`conf`	Collaborative Planning With Privacy. CSF Max I. Kanovich, Paul D. Rowe, Andre Scedrov
2007	A	`conf`	Key-dependent Message Security under Active Attacks - BRSIM/UC-Soundness of Symbolic Encryption with Key Cycles. CSF Michael Backes, Birgit Pfitzmann, Andre Scedrov
2007	—	`ed.`	Proceedings of the International Workshop on Security and Concurrency, SecCo@CONCUR 2005, San Francisco, CA, USA, August 22, 2005 SecCo@CONCUR Michael Backes, Andre Scedrov
2007	—	`conf`	The work of Dean Rosenzweig: a tribute to a scientist and an innovator. ESEC/SIGSOFT FSE Andre Scedrov
2006	J	`jnl`	A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols. Theor. Comput. Sci. John C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague
2006	—	`conf`	Breaking and Fixing Public-Key Kerberos. ASIAN Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad
2006	J	`jnl`	Breaking and Fixing Public-Key Kerberos. IACR Cryptol. ePrint Arch. Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad
2006	A	`conf`	Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos. ESORICS Michael Backes, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay
2006	J	`jnl`	Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos. IACR Cryptol. ePrint Arch. Michael Backes, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay
2006	J	`jnl`	Formal Analysis of Multiparty Contract Signing. J. Autom. Reason. Rohit Chadha, Steve Kremer, Andre Scedrov
2006	J	`jnl`	Formal analysis of Kerberos 5. Theor. Comput. Sci. Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Christopher Walstad
2006	B	`conf`	Games and the Impossibility of Realizable Ideal Functionality. TCC Anupam Datta, Ante Derek, John C. Mitchell, Ajith Ramanathan, Andre Scedrov
2006	C	`conf`	Relating State-Based and Process-Based Concurrency through Linear Logic. WoLLIC Iliano Cervesato, Andre Scedrov
2005	—	`conf`	Computational and Information-Theoretic Soundness and Completeness of Formal Encryption. CSFW Pedro Adão, Gergei Bana, Andre Scedrov
2005	J	`jnl`	Contract signing, optimism, and advantage. J. Log. Algebraic Methods Program. Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov
2005	J	`jnl`	Games and the Impossibility of Realizable Ideal Functionality. IACR Cryptol. ePrint Arch. Anupam Datta, Ante Derek, John C. Mitchell, Ajith Ramanathan, Andre Scedrov
2005	J	`jnl`	Key-dependent Message Security under Active Attacks - BRSIM/UC-Soundness of Symbolic Encryption with Key Cycles. IACR Cryptol. ePrint Arch. Michael Backes, Birgit Pfitzmann, Andre Scedrov
2005	—	`conf`	Preface. SecCO@CONCUR Michael Backes, Andre Scedrov
2005	A	`conf`	Soundness of Formal Encryption in the Presence of Key-Cycles. ESORICS Pedro Adão, Gergei Bana, Jonathan Herzog, Andre Scedrov
2005	—	`conf`	Specifying Kerberos 5 cross-realm authentication. WITS Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Christopher Walstad
2004	—	`conf`	Formal Analysis of Multi-Party Contract Signing. CSFW Rohit Chadha, Steve Kremer, Andre Scedrov
2004	B	`conf`	Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols. FoSSaCS Ajith Ramanathan, John C. Mitchell, Andre Scedrov, Vanessa Teague
2003	B	`conf`	Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus. CONCUR Paulo Mateus, John C. Mitchell, Andre Scedrov
2003	B	`conf`	Contract Signing, Optimism, and Advantage. CONCUR Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov
2003	J	`jnl`	Phase semantics for light linear logic. Theor. Comput. Sci. Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov
2003	J	`jnl`	Preface. Theor. Comput. Sci. Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov
2003	—	`ed.`	Software Security -- Theories and Systems, Mext-NSF-JSPS International Symposium, ISSS 2002, Tokyo, Japan, November 8-10, 2002, Revised Papers ISSS Mitsuhiro Okada, Benjamin C. Pierce, Andre Scedrov, Hideyuki Tokuda, Akinori Yonezawa
2003	—	`conf`	Verifying Confidentiality and Authentication in Kerberos 5. ISSS Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov
2002	—	`conf`	A Comparison between Strand Spaces and Multiset Rewriting for Security Protocol Analysis. ISSS Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln, John C. Mitchell, Andre Scedrov
2002	—	`conf`	A Formal Analysis of Some Properties of Kerberos 5 Using MSR. CSFW Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov
2001	B	`conf`	A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols (Preliminary Report). MFPS John C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague
2001	A*	`conf`	Inductive methods and contract-signing protocols. CCS Rohit Chadha, Max I. Kanovich, Andre Scedrov
2001	A*	`conf`	Probabilistic Polynominal-Time Process Calculus and Security Protocol Analysis. LICS John C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague
2001	—	`conf`	Relating Cryptography and Cryptographic Protocols. CSFW Andre Scedrov, Ran Canetti, Joshua D. Guttman, David A. Wagner, Michael Waidner
2000	J	`jnl`	A language-based security analysis. ACM SIGSOFT Softw. Eng. Notes Andre Scedrov
2000	—	`conf`	Relating Strands and Multiset Rewriting for Security Protocol Analysis. CSFW Iliano Cervesato, Nancy A. Durgin, John C. Mitchell, Patrick Lincoln, Andre Scedrov
1999	—	`conf`	A Meta-Notation for Protocol Analysis. CSFW Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln, John C. Mitchell, Andre Scedrov
1999	B	`ed.`	Fifteenth Conference on Mathematical Foundations of Progamming Semantics, MFPS 1999, Tulane University, New Orleans, LA, USA, April 28 - May 1, 1999 MFPS Stephen D. Brookes, Achim Jung, Michael W. Mislove, Andre Scedrov
1999	J	`jnl`	Optimization Complexity of Linear Logic Proof Games. Theor. Comput. Sci. Patrick Lincoln, John C. Mitchell, Andre Scedrov
1999	B	`conf`	Preface. MFPS Stephen D. Brookes, Achim Jung, Michael W. Mislove, Andre Scedrov
1999	—	`conf`	Probabilistic Polynomial-Time Equivalence and Security Analysis. World Congress on Formal Methods Patrick Lincoln, John C. Mitchell, Mark Mitchell, Andre Scedrov
1998	A*	`conf`	A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time. FOCS John C. Mitchell, Mark Mitchell, Andre Scedrov
1998	A*	`conf`	A Probabilistic Poly-Time Framework for Protocol Analysis. CCS Patrick Lincoln, John C. Mitchell, Mark Mitchell, Andre Scedrov
1998	—	`conf`	Specifying Real-Time Finite-State Systems in Linear Logic. COTIC Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov
1997	B	`conf`	Phase semantics for light linear logic. MFPS Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov
1996	—	`ed.`	Linear Logic Tokyo Meeting 1996, Keio University, Mita Campus, Tokyo, Japan, March 29 - April 2, 1996 Linear Logic Tokyo Meeting Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov
1996	J	`jnl`	Linear logic proof games and optimization. Bull. Symb. Log. Patrick Lincoln, John C. Mitchell, Andre Scedrov
1996	—	`conf`	Preface. Linear Logic Tokyo Meeting Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov
1996	—	`conf`	The Complexity of Local Proof Search in Linear Logic. Linear Logic Tokyo Meeting Patrick Lincoln, John C. Mitchell, Andre Scedrov
1996	J	`jnl`	The Undecidability of Second Order Multiplicative Linear Logic. Inf. Comput. Yves Lafont, Andre Scedrov
1995	A*	`conf`	Decision Problems for Second-Order Linear Logic LICS Patrick Lincoln, Andre Scedrov, Natarajan Shankar
1995	J	`jnl`	Moez Alimohamed, 1967-1994. Theor. Comput. Sci. Andre Scedrov, Dennis DeTurk, Wolfgang Ziller
1994	J	`jnl`	An Extension of System F with Subtyping Inf. Comput. Luca Cardelli, Simone Martini, John C. Mitchell, Andre Scedrov
1994	J	`jnl`	First-Order Linear Logic without Modalities is NEXPTIME-Hard. Theor. Comput. Sci. Patrick Lincoln, Andre Scedrov
1994	J	`jnl`	Preface Inf. Comput. Andre Scedrov
1994	J	`jnl`	Preface - Invited papers presented at the 1992 IEEE Symposium on Logic in Computer Science. Ann. Pure Appl. Log. Andre Scedrov
1993	—	`ch.`	A Brief Guide to Linear Logic. Current Trends in Theoretical Computer Science Andre Scedrov
1993	J	`jnl`	Linearizing Intuitionistic Implication. Ann. Pure Appl. Log. Patrick Lincoln, Andre Scedrov, Natarajan Shankar
1992	J	`jnl`	Bounded Linear Logic: A Modular Approach to Polynomial-Time Computability. Theor. Comput. Sci. Jean-Yves Girard, Andre Scedrov, Philip J. Scott
1992	J	`jnl`	Complete Topoi Representing Models of Set Theory. Ann. Pure Appl. Log. Andreas Blass, Andre Scedrov
1992	J	`jnl`	Decision Problems for Propositional Linear Logic. Ann. Pure Appl. Log. Patrick Lincoln, John C. Mitchell, Andre Scedrov, Natarajan Shankar
1992	B	`conf`	Notes on Sconing and Relators. CSL John C. Mitchell, Andre Scedrov
1991	—	`conf`	An Extension of System F with Subtyping. TACS Luca Cardelli, Simone Martini, John C. Mitchell, Andre Scedrov
1991	J	`jnl`	Inheritance as Implicit Coercion Inf. Comput. Val Tannen, Thierry Coquand, Carl A. Gunter, Andre Scedrov
1991	A*	`conf`	Linearizing Intuitionistic Implication LICS Patrick Lincoln, Andre Scedrov, Natarajan Shankar
1991	J	`jnl`	Uniform Proofs as a Foundation for Logic Programming. Ann. Pure Appl. Log. Dale Miller, Gopalan Nadathur, Frank Pfenning, Andre Scedrov
1990	J	`jnl`	A brief guide to linear logic. Bull. EATCS Andre Scedrov
1990	—	`book`	Categories, allegories. Peter J. Freyd, Andre Scedrov
1990	—	`conf`	Computing with Coercions. LISP and Functional Programming Val Tannen, Carl A. Gunter, Andre Scedrov
1990	A*	`conf`	Decision Problems for Propositional Linear Logic FOCS Patrick Lincoln, John C. Mitchell, Andre Scedrov, Natarajan Shankar
1990	J	`jnl`	Functorial Polymorphism. Theor. Comput. Sci. Edwin Stewart Bainbridge, Peter J. Freyd, Andre Scedrov, Philip J. Scott
1989	A*	`conf`	Inheritance and Explicit Coercion (Preliminary Report) LICS Val Tannen, Thierry Coquand, Carl A. Gunter, Andre Scedrov
1989	A*	`conf`	Polynomially Grade Logic I: A Graded Version of System T LICS Anil Nerode, Jeffrey B. Remmel, Andre Scedrov
1988	A	`conf`	Lambda-Prolog: An Extended Logic Programming Language. CADE Amy P. Felty, Elsa L. Gunter, John Hannan, Dale Miller, Gopalan Nadathur, Andre Scedrov
1988	A*	`conf`	Semantic Parametricity in Polymorphic Lambda Calculus LICS Peter J. Freyd, Jean-Yves Girard, Andre Scedrov, Philip J. Scott
1987	B	`conf`	A Categorical Approach to Realizability and Polymorphic Types. MFPS Aurelio Carboni, Peter J. Freyd, Andre Scedrov
1987	A*	`conf`	Hereditary Harrop Formulas and Uniform Proof Systems LICS Dale Miller, Gopalan Nadathur, Andre Scedrov
1987	J	`jnl`	Lindenbaum algebras of intuitionistic theories and free categories. Ann. Pure Appl. Log. Peter J. Freyd, Harvey Friedman, Andre Scedrov
1987	A*	`conf`	Some Semantic Aspects of Polymorphic Lambda Calculus LICS Peter J. Freyd, Andre Scedrov
1986	J	`jnl`	Diagonalization of continuous matrices as a representation of intuitionistic reals. Ann. Pure Appl. Log. Andre Scedrov
1986	J	`jnl`	Embedding sheaf models for set theory into boolean-valued permutation models with an interior operator. Ann. Pure Appl. Log. Andre Scedrov
1986	J	`jnl`	Intuitionistically provable recursive well-orderings. Ann. Pure Appl. Log. Harvey M. Friedman, Andre Scedrov
1986	J	`jnl`	On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis. Ann. Pure Appl. Log. Andre Scedrov
1986	J	`jnl`	Small Decidable Sheaves. J. Symb. Log. Andreas Blass, Andre Scedrov
1986	J	`jnl`	Some Properties of Epistemic Set Theory with Collection. J. Symb. Log. Andre Scedrov
1985	—	`conf`	Some aspects of categorial semantics: sheves and glueing. Logic Colloquium Andre Scedrov
1984	J	`jnl`	Church's Thesis, Continuity, and Set Theory. J. Symb. Log. Michael Beeson, Andre Scedrov
1983	J	`jnl`	On a weakening of Markov's Principle. Arch. Math. Log. Andre Scedrov, Richard Vesley