Andre Scedrov

Andre Scedrov is a Professor of Mathematics at the University of Pennsylvania, affiliated with the School of Arts and Sciences. His research focuses on logic, information assurance, formal grammars, and their applications in cybersecurity and computational systems. He explores non-associative linear logic, formal verification of distributed systems, and resilience in cyber-physical environments. Recent work addresses computational complexity, security protocols, and temporal analysis of systems.

Education details are not explicitly provided in the text, but his academic contributions span over three decades, with a strong focus on foundational theoretical computer science and applied security. His research has led to advancements in formal methods for analyzing security protocols, including distance-bounding protocols and BGP systems.

Research Interests:

• Non-Associative/Non-Commutative Logics
• Cyber-Physical System Security
• Formal Verification of Protocols
• Subexponential and Modal Logics
• Computational Complexity in Security

His articles (2024–2020) emphasize resilience engineering, formal logic extensions, and security protocol modeling. Notable trends include interdisciplinary approaches merging logic with cybersecurity and system dynamics. He has contributed to frameworks like FSR for network security and BGPVerif for routing analysis.

Awards are not listed here, but his extensive publication record reflects recognition in theoretical and applied computer science. Advising details are unavailable, though collaborations with researchers in cryptography and formal methods are evident. He is associated with labs focusing on secure distributed systems and formal language theory.