Andre Scedrov

Orcid: 0000-0002-4536-0419

Affiliations:
  • University of Pennsylvania


According to our database1, Andre Scedrov authored at least 138 papers between 1983 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Technical Report: Time-Bounded Resilience.
CoRR, 2024

Time-Bounded Resilience.
Proceedings of the Rewriting Logic and Its Applications - 15th International Workshop, 2024

2023
Explorations in Subexponential Non-associative Non-commutative Linear Logic.
Proceedings of the Proceedings Modalities in substructural logics: Applications at the interfaces of logic, 2023

Explorations in Subexponential non-associative non-commutative Linear Logic (extended version).
CoRR, 2023

2022
On the Security and Complexity of Periodic Systems.
SN Comput. Sci., 2022

Language models for some extensions of the Lambek calculus.
Inf. Comput., 2022

On the Formalization and Computational Complexity of Resilience Problems for Cyber-Physical Systems.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2022, 2022

Non-associative, Non-commutative Multi-modal Linear Logic.
Proceedings of the Automated Reasoning - 11th International Joint Conference, 2022

2021
Correction to: The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities.
J. Log. Lang. Inf., 2021

The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities.
J. Log. Lang. Inf., 2021

Resource and timing aspects of security protocols.
J. Comput. Secur., 2021

On the Complexity of Verification of Time-Sensitive Distributed Systems: Technical Report.
CoRR, 2021

On Security Analysis of Periodic Systems: Expressiveness and Complexity.
Proceedings of the 7th International Conference on Information Systems Security and Privacy, 2021

On the Complexity of Verification of Time-Sensitive Distributed Systems.
Proceedings of the Protocols, Strands, and Logic, 2021

2020
Reconciling Lambek's restriction, cut-elimination and substitution in the presence of exponential modalities.
J. Log. Comput., 2020

Soft Subexponentials and Multiplexing.
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

2019
Subexponentials in non-commutative linear logic.
Math. Struct. Comput. Sci., 2019

Automated Analysis of Cryptographic Assumptions in Generic Group Models.
J. Cryptol., 2019

L-Models and R-Models for Lambek Calculus Enriched with Additives and the Multiplicative Unit.
Proceedings of the Logic, Language, Information, and Computation, 2019

The Complexity of Multiplicative-Additive Lambek Calculus: 25 Years Later.
Proceedings of the Logic, Language, Information, and Computation, 2019

Undecidability of a Newly Proposed Calculus for CatLog3.
Proceedings of the Formal Grammar - 24th International Conference, 2019

Resource-Bounded Intruders in Denial of Service Attacks.
Proceedings of the 32nd IEEE Computer Security Foundations Symposium, 2019

A Multiset Rewriting Model for Specifying and Verifying Timing Aspects of Security Protocols.
Proceedings of the Foundations of Security, Protocols, and Equational Reasoning, 2019

2018
Compliance in Real Time Multiset Rewriting Models.
CoRR, 2018

Bracket Induction for Lambek Calculus with Bracket Modalities.
Proceedings of the Formal Grammar 2018 - 23rd International Conference, 2018

Statistical Model Checking of Distance Fraud Attacks on the Hancke-Kuhn Family of Protocols.
Proceedings of the 2018 Workshop on Cyber-Physical Systems Security and PrivaCy, 2018

A Logical Framework with Commutative and Non-commutative Subexponentials.
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017
A rewriting framework and logic for activities subject to regulations.
Math. Struct. Comput. Sci., 2017

Time, computational complexity, and probability in the analysis of distance-bounding protocols.
J. Comput. Secur., 2017

A Polynomial-Time Algorithm for the Lambek Calculus with Brackets of Bounded Order.
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

Undecidability of the Lambek Calculus with Subexponential and Bracket Modalities.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016
Strongly-optimal structure preserving signatures from Type II pairings: synthesis and lower bounds.
IET Inf. Secur., 2016

Undecidability of the Lambek calculus with subexponentials and bracket modalities.
CoRR, 2016

On Lambek's Restriction in the Presence of Exponential Modalities.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2016

Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2016

Undecidability of the Lambek Calculus with a Relevant Modality.
Proceedings of the Formal Grammar - 20th and 21st International Conferences, 2016

2015
Discrete vs. Dense Times in the Analysis of Cyber-Physical Security Protocols.
Proceedings of the Principles of Security and Trust - 4th International Conference, 2015

2014
Editors' foreword.
J. Comput. Syst. Sci., 2014

Bounded memory Dolev-Yao adversaries in collaborative systems.
Inf. Comput., 2014

Bounded memory protocols.
Comput. Lang. Syst. Struct., 2014

When Not All Bits Are Equal: Worth-Based Information Flow.
Proceedings of the Principles of Security and Trust - Third International Conference, 2014

A reduction-based approach towards scaling up formal analysis of internet configurations.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

2013
Automated synthesis of reactive controllers for software-defined networks.
Proceedings of the 2013 21st IEEE International Conference on Network Protocols, 2013

Bounded Memory Protocols and Progressing Collaborative Systems.
Proceedings of the Computer Security - ESORICS 2013, 2013

2012
FSR: formal analysis and implementation toolkit for safe interdomain routing.
IEEE/ACM Trans. Netw., 2012

Maintaining distributed logic programs incrementally.
Comput. Lang. Syst. Struct., 2012

Reduction-Based Formal Analysis of BGP Instances.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

Reduction-based analysis of BGP systems with BGPVerif.
Proceedings of the ACM SIGCOMM 2012 Conference, 2012

A Rewriting Framework for Activities Subject to Regulations.
Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

Brief announcement: a calculus of policy-based routing systems.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Towards an automated assistant for clinical investigations.
Proceedings of the ACM International Health Informatics Symposium, 2012

Declarative privacy policy: finite models and attribute-based encryption.
Proceedings of the ACM International Health Informatics Symposium, 2012

2011
Collaborative Planning with Confidentiality.
J. Autom. Reason., 2011

Analyzing BGP Instances in Maude.
Proceedings of the Formal Techniques for Distributed Systems, 2011

2010
An Operational Semantics for Network Datalog.
Proceedings of the 3rd International Workshop on Logics, Agents, and Mobility, 2010

2009
Soundness and completeness of formal encryption: The cases of key cycles and partial information leakage.
J. Comput. Secur., 2009

Relating state-based and process-based concurrency through linear logic (full-version).
Inf. Comput., 2009

Policy Compliance in Collaborative Systems.
Proceedings of the 22nd IEEE Computer Security Foundations Symposium, 2009

2008
Key-dependent message security under active attacks - BRSIM/UC-soundness of Dolev-Yao-style encryption with key cycles.
J. Comput. Secur., 2008

Computationally sound mechanized proofs for basic and public-key Kerberos.
Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, 2008

Analysis of EAP-GPSK Authentication Protocol.
Proceedings of the Applied Cryptography and Network Security, 6th International Conference, 2008

2007
The work of Dean Rosenzweig: a tribute to a scientist and an innovator.
Proceedings of the 6th joint meeting of the European Software Engineering Conference and the ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2007

Collaborative Planning With Privacy.
Proceedings of the 20th IEEE Computer Security Foundations Symposium, 2007

2006
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols.
Theor. Comput. Sci., 2006

Formal analysis of Kerberos 5.
Theor. Comput. Sci., 2006

Formal Analysis of Multiparty Contract Signing.
J. Autom. Reason., 2006

Breaking and Fixing Public-Key Kerberos.
IACR Cryptol. ePrint Arch., 2006

Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos.
IACR Cryptol. ePrint Arch., 2006

Relating State-Based and Process-Based Concurrency through Linear Logic.
Proceedings of the 13th Workshop on Logic, Language, Information and Computation, 2006

2005
Contract signing, optimism, and advantage.
J. Log. Algebraic Methods Program., 2005

Games and the Impossibility of Realizable Ideal Functionality.
IACR Cryptol. ePrint Arch., 2005

Key-dependent Message Security under Active Attacks - BRSIM/UC-Soundness of Symbolic Encryption with Key Cycles.
IACR Cryptol. ePrint Arch., 2005

Preface.
Proceedings of the International Workshop on Security and Concurrency, SecCo@CONCUR 2005, 2005

Specifying Kerberos 5 cross-realm authentication.
Proceedings of the POPL 2005 Workshop on Issues in the Theory of Security, 2005

Soundness of Formal Encryption in the Presence of Key-Cycles.
Proceedings of the Computer Security, 2005

Computational and Information-Theoretic Soundness and Completeness of Formal Encryption.
Proceedings of the 18th IEEE Computer Security Foundations Workshop, 2005

2004
Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

Formal Analysis of Multi-Party Contract Signing.
Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004

2003
Phase semantics for light linear logic.
Theor. Comput. Sci., 2003

Preface.
Theor. Comput. Sci., 2003

Verifying Confidentiality and Authentication in Kerberos 5.
Proceedings of the Software Security, 2003

Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus.
Proceedings of the CONCUR 2003, 2003

2002
A Comparison between Strand Spaces and Multiset Rewriting for Security Protocol Analysis.
Proceedings of the Software Security -- Theories and Systems, 2002

A Formal Analysis of Some Properties of Kerberos 5 Using MSR.
Proceedings of the 15th IEEE Computer Security Foundations Workshop (CSFW-15 2002), 2002

2001
A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols (Preliminary Report).
Proceedings of the Seventeenth Conference on the Mathematical Foundations of Programming Semantics, 2001

Probabilistic Polynominal-Time Process Calculus and Security Protocol Analysis.
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

Relating Cryptography and Cryptographic Protocols.
Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14 2001), 2001

Inductive methods and contract-signing protocols.
Proceedings of the CCS 2001, 2001

2000
A language-based security analysis.
ACM SIGSOFT Softw. Eng. Notes, 2000

Relating Strands and Multiset Rewriting for Security Protocol Analysis.
Proceedings of the 13th IEEE Computer Security Foundations Workshop, 2000

1999
Optimization Complexity of Linear Logic Proof Games.
Theor. Comput. Sci., 1999

Preface.
Proceedings of the Fifteenth Conference on Mathematical Foundations of Progamming Semantics, 1999

Probabilistic Polynomial-Time Equivalence and Security Analysis.
Proceedings of the FM'99 - Formal Methods, 1999

A Meta-Notation for Protocol Analysis.
Proceedings of the 12th IEEE Computer Security Foundations Workshop, 1999

1998
Specifying Real-Time Finite-State Systems in Linear Logic.
Proceedings of the Second Workshop on Concurrent Constraint Programming for Time Critical Applications and Multi-Agent Systems, 1998

A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

A Probabilistic Poly-Time Framework for Protocol Analysis.
Proceedings of the CCS '98, 1998

1996
The Undecidability of Second Order Multiplicative Linear Logic.
Inf. Comput., 1996

The Complexity of Local Proof Search in Linear Logic.
Proceedings of the Linear Logic Tokyo Meeting 1996, Keio University, Mita Campus, Tokyo, Japan, March 29, 1996

Linear logic proof games and optimization.
Bull. Symb. Log., 1996

1995
Moez Alimohamed, 1967-1994.
Theor. Comput. Sci., 1995

Decision Problems for Second-Order Linear Logic
Proceedings of the Proceedings, 1995

1994
Preface
Inf. Comput., May, 1994

First-Order Linear Logic without Modalities is NEXPTIME-Hard.
Theor. Comput. Sci., 1994

An Extension of System F with Subtyping
Inf. Comput., 1994

Preface - Invited papers presented at the 1992 IEEE Symposium on Logic in Computer Science.
Ann. Pure Appl. Log., 1994

1993
A Brief Guide to Linear Logic.
Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

Linearizing Intuitionistic Implication.
Ann. Pure Appl. Log., 1993

1992
Bounded Linear Logic: A Modular Approach to Polynomial-Time Computability.
Theor. Comput. Sci., 1992

Decision Problems for Propositional Linear Logic.
Ann. Pure Appl. Log., 1992

Complete Topoi Representing Models of Set Theory.
Ann. Pure Appl. Log., 1992

Notes on Sconing and Relators.
Proceedings of the Computer Science Logic, 6th Workshop, 1992

1991
Inheritance as Implicit Coercion
Inf. Comput., July, 1991

Uniform Proofs as a Foundation for Logic Programming.
Ann. Pure Appl. Log., 1991

1990
Functorial Polymorphism.
Theor. Comput. Sci., 1990

A brief guide to linear logic.
Bull. EATCS, 1990

Computing with Coercions.
Proceedings of the 1990 ACM Conference on LISP and Functional Programming, 1990

Categories, allegories.
North-Holland mathematical library 39, North-Holland, ISBN: 978-0-444-70368-2, 1990

1989
Polynomially Grade Logic I: A Graded Version of System T
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

Inheritance and Explicit Coercion (Preliminary Report)
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

1988
Semantic Parametricity in Polymorphic Lambda Calculus
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

Lambda-Prolog: An Extended Logic Programming Language.
Proceedings of the 9th International Conference on Automated Deduction, 1988

1987
Lindenbaum algebras of intuitionistic theories and free categories.
Ann. Pure Appl. Log., 1987

A Categorical Approach to Realizability and Polymorphic Types.
Proceedings of the Mathematical Foundations of Programming Language Semantics, 1987

Hereditary Harrop Formulas and Uniform Proof Systems
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

Some Semantic Aspects of Polymorphic Lambda Calculus
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

1986
Some Properties of Epistemic Set Theory with Collection.
J. Symb. Log., 1986

Small Decidable Sheaves.
J. Symb. Log., 1986

Diagonalization of continuous matrices as a representation of intuitionistic reals.
Ann. Pure Appl. Log., 1986

On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis.
Ann. Pure Appl. Log., 1986

Embedding sheaf models for set theory into boolean-valued permutation models with an interior operator.
Ann. Pure Appl. Log., 1986

Intuitionistically provable recursive well-orderings.
Ann. Pure Appl. Log., 1986

1985
Some aspects of categorial semantics: sheves and glueing.
Proceedings of the Logic Colloquium '85, Orsay, France, 1985

1984
Church's Thesis, Continuity, and Set Theory.
J. Symb. Log., 1984

On some non-classical extensions of second-order intuitionistic propositional calculus.
Ann. Pure Appl. Log., 1984

Large sets in intuitionistic set theory.
Ann. Pure Appl. Log., 1984

1983
Set existence property for intuitionistic theories with dependent choice.
Ann. Pure Appl. Log., 1983

On a weakening of Markov's Principle.
Arch. Math. Log., 1983


  Loading...