Andre Scedrov
About
Andre Scedrov is a Professor of Mathematics and a Professor of Computer and Information Science at the University of Pennsylvania, where he has been a pivotal figure in bridging the gap between abstract mathematical logic and practical computer security. His research focuses on Formal Methods and Linear Logic, specifically their application to the verification of Cryptographic Protocols and information assurance. Dr. Scedrov is renowned for his work on the multiset rewriting framework, which provides a formal language for analyzing the complexity and security of bounded and time-sensitive protocols. His interdisciplinary work also extends to the Logical Aspects of Linguistic Structure, where he applies proof-theoretic methods to study the syntax and semantics of natural languages, particularly through the use of Lambek calculus and subexponential modalities. As a foundational contributor to the field, his work ensures that the digital systems we rely on—from secure remote passwords to smart contracts—are built on a rigorous, mathematically verifiable base.
Research Performance Summary
First Recorded Paper
A note on the Friedman slash and Freyd covers
Year: 1982
Citations: 15
Venue: Studies in Logic and the Foundations of Mathematics 110
Latest Recorded Paper
WoLLIC 2023-29th Workshop on Logic, Language, Information and Computation
Year: 2025
Citations: 0
Venue: Mathematical Structures in Computer Science 35, e35
Last 10 Years Publication Activity
This timeline shows the professor's yearly publication activity.