Andre Scedrov
Orcid: 0000-0002-4536-0419Affiliations:
- University of Pennsylvania
According to our database1,
Andre Scedrov
authored at least 137 papers
between 1983 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on scopus.com
-
on orcid.org
-
on d-nb.info
-
on andrej.com
On csauthors.net:
Bibliography
2024
2023
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 Formalization and Computational Complexity of Resilience Problems for Cyber-Physical Systems.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2022, 2022
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
On the Complexity of Verification of Time-Sensitive Distributed Systems: Technical Report.
CoRR, 2021
Proceedings of the 7th International Conference on Information Systems Security and Privacy, 2021
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
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020
2019
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
Proceedings of the Logic, Language, Information, and Computation, 2019
Proceedings of the Formal Grammar - 24th International Conference, 2019
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
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
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018
2017
Math. Struct. Comput. Sci., 2017
Time, computational complexity, and probability in the analysis of distance-bounding protocols.
J. Comput. Secur., 2017
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017
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
CoRR, 2016
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2016
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2016
Proceedings of the Formal Grammar - 20th and 21st International Conferences, 2016
2015
Proceedings of the Principles of Security and Trust - 4th International Conference, 2015
2014
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
Proceedings of the 2013 21st IEEE International Conference on Network Protocols, 2013
Proceedings of the Computer Security - ESORICS 2013, 2013
2012
IEEE/ACM Trans. Netw., 2012
Comput. Lang. Syst. Struct., 2012
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012
Proceedings of the ACM SIGCOMM 2012 Conference, 2012
Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012
Proceedings of the ACM International Health Informatics Symposium, 2012
Proceedings of the ACM International Health Informatics Symposium, 2012
2011
Int. J. Inf. Sec., 2011
Proceedings of the Formal Techniques for Distributed Systems, 2011
2010
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
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
Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, 2008
Proceedings of the Applied Cryptography and Network Security, 6th International Conference, 2008
2007
Proceedings of the 6th joint meeting of the European Software Engineering Conference and the ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2007
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
Proceedings of the 13th Workshop on Logic, Language, Information and Computation, 2006
2005
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
Proceedings of the International Workshop on Security and Concurrency, SecCo@CONCUR 2005, 2005
Proceedings of the POPL 2005 Workshop on Issues in the Theory of Security, 2005
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
Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004
2003
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
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
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001
Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14 2001), 2001
2000
Proceedings of the 13th IEEE Computer Security Foundations Workshop, 2000
1999
Proceedings of the Fifteenth Conference on Mathematical Foundations of Progamming Semantics, 1999
Proceedings of the FM'99 - Formal Methods, 1999
Proceedings of the 12th IEEE Computer Security Foundations Workshop, 1999
1998
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
Proceedings of the CCS '98, 1998
1997
Proceedings of the Thirteenth Annual Conference on Mathematical Foundations of Progamming Semantics, 1997
1996
Proceedings of the Linear Logic Tokyo Meeting 1996, Keio University, Mita Campus, Tokyo, Japan, March 29, 1996
Proceedings of the Linear Logic Tokyo Meeting 1996, Keio University, Mita Campus, Tokyo, Japan, March 29, 1996
1995
Moez Alimohamed, 1967-1994.
Theor. Comput. Sci., 1995
1994
Preface
Inf. Comput., May, 1994
Theor. Comput. Sci., 1994
Preface - Invited papers presented at the 1992 IEEE Symposium on Logic in Computer Science.
Ann. Pure Appl. Log., 1994
1993
Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993
1992
Theor. Comput. Sci., 1992
Proceedings of the Computer Science Logic, 6th Workshop, 1992
1991
1990
A brief guide to linear logic.
Bull. EATCS, 1990
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
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989
1988
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988
Proceedings of the 9th International Conference on Automated Deduction, 1988
1987
Ann. Pure Appl. Log., 1987
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
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
1985
Some aspects of categorial semantics: sheves and glueing.
Proceedings of the Logic Colloquium '85, Orsay, France, 1985
1984
On some non-classical extensions of second-order intuitionistic propositional calculus.
Ann. Pure Appl. Log., 1984
1983
Ann. Pure Appl. Log., 1983