Travelled to:1 × Croatia
1 × Denmark
1 × Estonia
1 × Italy
1 × Japan
1 × Spain
1 × The Netherlands
1 × United Kingdom
2 × France
5 × USA
Collaborated with:J.C.Mitchell P.Lincoln P.J.Freyd V.Nigam N.Shankar V.Tannen C.A.Gunter ∅ A.Ramanathan V.Teague D.Miller G.Nadathur B.T.Loo M.I.Kanovich C.L.Talcott A.Nerode J.B.Remmel L.Jia M.Mitchell T.Coquand J.Girard P.J.Scott S.Kuznetsov A.Wang A.J.T.Gurney T.B.Kirigin R.Perovic A.P.Felty E.L.Gunter J.Hannan
Talks about:logic (5) analysi (4) probabilist (3) calculus (3) secur (3) polymorph (2) framework (2) protocol (2) polynomi (2) coercion (2)
Person: Andre Scedrov
DBLP: Scedrov:Andre
Contributed to:
2012
2012
2011
2007
2004
2001
19991995
19921991
19901989
198819881987
2018Wrote 18 papers:
- RTA-2012-KanovichKNSTP #framework #process
- A Rewriting Framework for Activities Subject to Regulations (MIK, TBK, VN, AS, CLT, RP), pp. 305–322.
- TACAS-2012-WangTGLS #analysis #formal method
- Reduction-Based Formal Analysis of BGP Instances (AW, CLT, AJTG, BTL, AS), pp. 283–298.
- PPDP-2011-NigamJLS #distributed #incremental #logic programming #maintenance #source code
- Maintaining distributed logic programs incrementally (VN, LJ, BTL, AS), pp. 125–136.
- ESEC-FSE-2007-Scedrov
- The work of Dean Rosenzweig: a tribute to a scientist and an innovator (AS), pp. 371–374.
- FoSSaCS-2004-RamanathanMST #analysis #bisimulation #equivalence #network #probability #protocol #security
- Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols (AR, JCM, AS, VT), pp. 468–483.
- LICS-2001-MitchellRST #analysis #calculus #probability #process #protocol #security
- Probabilistic Polynominal-Time Process Calculus and Security Protocol Analysis (JCM, AR, AS, VT), pp. 3–5.
- FM-v1-1999-LincolnMMS #analysis #equivalence #polynomial #probability #security
- Probabilistic Polynomial-Time Equivalence and Security Analysis (PL, JCM, MM, AS), pp. 776–793.
- LICS-1995-LincolnSS #higher-order #linear #logic #problem
- Decision Problems for Second-Order Linear Logic (PL, AS, NS), pp. 476–485.
- CSL-1992-MitchellS
- Notes on Sconing and Relators (JCM, AS), pp. 352–378.
- LICS-1991-LincolnSS
- Linearizing Intuitionistic Implication (PL, AS, NS), pp. 51–62.
- LFP-1990-TannenGS
- Computing with Coercions (VT, CAG, AS), pp. 44–60.
- LICS-1989-Breazu-TannenCGS #inheritance
- Inheritance and Explicit Coercion (VT, TC, CAG, AS), pp. 112–129.
- LICS-1989-NerodeRS #logic
- Polynomially Grade Logic I: A Graded Version of System T (AN, JBR, AS), pp. 375–385.
- CADE-1988-FeltyGHMNS #logic programming #named #programming language #prolog #λ-calculus
- Lambda-Prolog: An Extended Logic Programming Language (APF, ELG, JH, DM, GN, AS), pp. 754–755.
- LICS-1988-FreydGSS #parametricity #polymorphism #semantics #λ-calculus
- Semantic Parametricity in Polymorphic λ Calculus (PJF, JYG, AS, PJS), pp. 274–279.
- LICS-1987-FreydS #aspect-oriented #polymorphism #semantics #λ-calculus
- Some Semantic Aspects of Polymorphic λ Calculus (PJF, AS), pp. 315–319.
- LICS-1987-MillerNS #proving
- Hereditary Harrop Formulas and Uniform Proof Systems (DM, GN, AS), pp. 98–105.
- IJCAR-2018-KanovichKNS #commutative #framework #logic
- A Logical Framework with Commutative and Non-commutative Subexponentials (MIK, SK, VN, AS), pp. 228–245.