His primary areas of investigation include Theoretical computer science, Cryptographic protocol, Lambda calculus, Algebra and Probabilistic logic. Andre Scedrov has included themes like Cryptography, Cryptographic nonce, Protocol analysis, Notation and Existential quantification in his Theoretical computer science study. His Lambda calculus research incorporates themes from Commutative property and Parametric polymorphism.
His work is dedicated to discovering how Commutative property, Intuitionistic logic are connected with Linear logic and other disciplines. His Algebra study combines topics in areas such as Zeroth-order logic and Autoepistemic logic. His Probabilistic logic research focuses on subjects like Process calculus, which are linked to Calculus and Time complexity.
Andre Scedrov mainly investigates Theoretical computer science, Computer security, Discrete mathematics, Cryptographic protocol and Linear logic. His Theoretical computer science study combines topics from a wide range of disciplines, such as Rewriting, Probabilistic logic and Cryptography. His Probabilistic logic research integrates issues from Equivalence and Observational equivalence.
His study looks at the relationship between Cryptography and topics such as Encryption, which overlap with Soundness. His Computer security research focuses on Protocol and how it connects with Adversary. His Linear logic study is concerned with Algebra in general.
His main research concerns Calculus, Decidability, Cryptographic protocol, Theoretical computer science and Categorial grammar. His biological study spans a wide range of topics, including Bracket and Conjunction. Andre Scedrov combines subjects such as Commutative property, Proof theory, Cryptography, Linear logic and Extension with his study of Decidability.
Cryptographic protocol is a subfield of Computer security that Andre Scedrov studies. His Theoretical computer science research is multidisciplinary, relying on both Security analysis and Gas meter prover. His Rewriting study necessitates a more in-depth grasp of Programming language.
Decidability, Rewriting, Linear logic, Calculus and Theoretical computer science are his primary areas of study. The concepts of his Decidability study are interwoven with issues in Structure, Fragment, Homomorphism and Completeness. The Rewriting study combines topics in areas such as Cryptographic protocol, Reachability problem, Access control, Probabilistic logic and Algorithm.
His studies deal with areas such as Commutative property, Programming language, Proof theory and Contraction as well as Linear logic. His research integrates issues of Bracket, Formalism, Extension, Syntax and Natural language in his study of Calculus. The various areas that Andre Scedrov examines in his Theoretical computer science study include Computational complexity theory and Probabilistic analysis of algorithms.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Uniform proofs as a foundation for logic programming
D. Miller;G. Nadathur;F. Pfenning;A. Scedrov.
Annals of Pure and Applied Logic (1991)
A meta-notation for protocol analysis
I. Cervesato;N.A. Durgin;P.D. Lincoln;J.C. Mitchell.
ieee computer security foundations symposium (1999)
Decision problems for propositional linear logic
Patrick Lincoln;Patrick Lincoln;John C. Mitchell;Andre Scedrov;Natarajan Shankar.
Annals of Pure and Applied Logic (1992)
Inheritance as implicit coercion
Val Breazu-Tannen;Thierry Coquand;Carl A. Gunter;Andre Scedrov.
Information & Computation (1991)
Bounded linear logic: a modular approach to polynomial-time computability
Jean-Yves Girard;Andre Scedrov;Philip J. Scott.
Theoretical Computer Science (1992)
Inheritance and explicit coercion
V. Breazu-Tannen;T. Coquand;C.A. Gunter;A. Scedrov.
logic in computer science (1989)
A probabilistic poly-time framework for protocol analysis
P. Lincoln;J. Mitchell;M. Mitchell;A. Scedrov.
computer and communications security (1998)
Functorial polymorphism
E. S. Bainbridge;P. J. Freyd;A. Scedrov;P. J. Scott.
Theoretical Computer Science - Special issue: Fourth workshop on mathematical foundations of programming semantics, Boulder, CO, May 1988 archive (1990)
Multiset rewriting and the complexity of bounded security protocols
Nancy Durgin;Patrick Lincoln;John Mitchell;Andre Scedrov.
Journal of Computer Security (2004)
An Extension of System F with Subtyping
Luca Cardelli;Simone Martini;John C. Mitchell;Andre Scedrov.
international conference on theoretical aspects of computer software (1991)
If you think any of the details on this page are incorrect, let us know.
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:
Stanford University
SRI International
University of Pennsylvania
SRI International
University of Illinois at Urbana-Champaign
Max Planck Institute for Security and Privacy
SRI International
French Institute for Research in Computer Science and Automation - INRIA
IBM (United States)
Carnegie Mellon University
French Institute for Research in Computer Science and Automation - INRIA
Publications: 84
French Institute for Research in Computer Science and Automation - INRIA
Publications: 25
McGill University
University of Central Florida
Université Paris Cité
University of the Littoral Opal Coast
China Pharmaceutical University
Pohang University of Science and Technology
University of Würzburg
National Museum of Natural History
University of Vermont
Harvard University
The University of Texas at Austin
University of Münster
Washington University in St. Louis
University of Clermont Auvergne
University of California, Berkeley
University of Waterloo