World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
47
Citations
8286
World Ranking
6531
National Ranking
2885

Overview

Andre Scedrov is affiliated with the University of Pennsylvania in the United States and works primarily in the field of Computer Science. Their research contributions span a range of topics, including logic, programming, type systems, and formal verification methods.

They have published extensively on subjects such as:

  • Logic, programming, and type systems
  • Logic, Reasoning, and Knowledge
  • Formal Methods in Verification
  • Semigroups and automata theory
  • Advanced Algebra and Logic
  • Security and Verification in Computing
  • Distributed systems and fault tolerance

Frequent co-authors collaborating with Andre Scedrov include:

  • Max Kanovich
  • Stepan Kuznetsov
  • Tajana Ban Kirigin
  • Carolyn Talcott
  • Vivek Nigam

Their work has appeared repeatedly in key publication venues such as:

  • arXiv (Cornell University)
  • Journal of Logic Language and Information
  • Journal of Computer Security
  • Journal of Logic and Computation
  • Information and Computation

Among their recent papers are:

  • Resource and timing aspects of security protocols, 2021, Journal of Computer Security
  • On the Complexity of Verification of Time-Sensitive Distributed Systems: Technical Report, 2021, arXiv (Cornell University)
  • Reconciling Lambek's restriction, cut-elimination and substitution in the presence of exponential modalities, 2020, Journal of Logic and Computation
  • Explorations in Subexponential non-associative non-commutative Linear Logic (extended version), 2023, arXiv (Cornell University)
  • Language models for some extensions of the Lambek calculus, 2021, Information and Computation

Andre Scedrov has also contributed to academic books, including one published by Springer Science+Business Media titled Logic, Language, Information, and Computation in 2023.

Best Publications

  • Uniform proofs as a foundation for logic programming

    D. Miller;G. Nadathur;F. Pfenning;A. Scedrov

  • Decision problems for propositional linear logic

    Patrick Lincoln;Patrick Lincoln;John C. Mitchell;Andre Scedrov;Natarajan Shankar

  • A meta-notation for protocol analysis

    I. Cervesato;N.A. Durgin;P.D. Lincoln;J.C. Mitchell

  • Bounded linear logic: a modular approach to polynomial-time computability

    Jean-Yves Girard;Andre Scedrov;Philip J. Scott

  • Inheritance as implicit coercion

    Val Breazu-Tannen;Thierry Coquand;Carl A. Gunter;Andre Scedrov

  • Inheritance and explicit coercion

    V. Breazu-Tannen;T. Coquand;C.A. Gunter;A. Scedrov

  • A probabilistic poly-time framework for protocol analysis

    P. Lincoln;J. Mitchell;M. Mitchell;A. Scedrov

  • Functorial polymorphism

    E. S. Bainbridge;P. J. Freyd;A. Scedrov;P. J. Scott

  • Multiset rewriting and the complexity of bounded security protocols

    Nancy Durgin;Patrick Lincoln;John Mitchell;Andre Scedrov

  • An Extension of System F with Subtyping

    Luca Cardelli;Simone Martini;John C. Mitchell;Andre Scedrov

  • Software Security — Theories and Systems

    Mitsuhiro Okada;Benjamin C. Pierce;Andre Scedrov;Hideyuki Tokuda

  • A Probabilistic Polynomial-Time Process Calculus for the Analysis of Cryptographic Protocols

    John C. Mitchell;Ajith Ramanathan;Andre Scedrov;Vanessa Teague

  • A brief guide to linear logic.

    Andre Scedrov

  • A linguistic characterization of bounded oracle computation and probabilistic polynomial time

    J. Mitchell;M. Mitchell;A. Scedrov

  • Relating strands and multiset rewriting for security protocol analysis

    I. Cervesato;N. Durgin;J. Mitchell;P. Lincoln

  • Breaking and Fixing Public-Key Kerberos.

    Iliano Cervesato;Aaron D. Jaggard;Andre Scedrov;Joe-Kai Tsay

  • Cryptographically sound security proofs for basic and public-key Kerberos

    Michael Backes;Iliano Cervesato;Aaron D. Jaggard;Andre Scedrov

  • A Categorical Approach to Realizability and Polymorphic Types

    Aurelio Carboni;Peter J. Freyd;Andre Scedrov

  • Inductive methods and contract-signing protocols

    R. Chadha;M. Kanovich;A. Scedrov

  • Formal Analysis of Multiparty Contract Signing

    Rohit Chadha;Steve Kremer;Andre Scedrov

  • Decision problems for propositional linear logic

    P. Lincoln;J. Michell;A. Scedrov;N. Shankar

Frequent Co-Authors

John C. Mitchell
John C. Mitchell Stanford University
Carolyn L. Talcott
Carolyn L. Talcott SRI International
Boon Thau Loo
Boon Thau Loo University of Pennsylvania
Patrick Lincoln
Patrick Lincoln SRI International
Carl A. Gunter
Carl A. Gunter University of Illinois at Urbana-Champaign
Gilles Barthe
Gilles Barthe Max Planck Institute for Security and Privacy
Natarajan Shankar
Natarajan Shankar SRI International
Dale Miller
Dale Miller French Institute for Research in Computer Science and Automation - INRIA
Dario Fiore
Dario Fiore Madrid Institute for Advanced Studies
Anupam Datta
Anupam Datta Carnegie Mellon University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing Computer Science in the USA opens a range of educational options and career pathways, especially for those who choose flexible online programs. Many students are concerned about cost, but several affordable online colleges offer high-quality degrees without breaking the bank.

Admission requirements can be a barrier for some, yet there are reputable universities for low gpa that welcome diverse applicants. For those looking to fast-track their education, a 1 year computer science degree online can provide the skills and credentials needed in a shorter time frame.

A background in Computer Science doesn’t limit you to traditional tech roles. Graduates can explore fields like software development, cybersecurity, and even areas that intersect with other sciences. For instance, you might wonder, what can i do with an environmental science degree? The answer includes technology-focused roles supporting sustainability and data analysis in environmental sectors.

Best Scientists Citing Andre Scedrov

Trending Scientists

Recently Published Articles