BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Spain
2 × Denmark
2 × France
2 × Germany
2 × Portugal
2 × United Kingdom
23 × USA
3 × Canada
3 × Italy
Collaborated with:
∅ P.Lincoln S.N.Freund A.Scedrov E.Moggi R.Harper A.R.Meyer D.Stefan A.Russo D.Mazières A.Barth A.Ramanathan V.Teague N.Li R.Viswanathan M.Hoang K.B.Bruce B.T.Howard P.C.Kanellakis L.Jategaonkar G.D.Plotkin M.Mitchell O.Agesen D.Katiyar D.C.Luckham S.Meldal N.Madhav A.Levy R.Statman A.Datta A.Derek V.Shmatikov M.Turuani P.S.Canning W.R.Cook W.L.Hill W.G.Olthoff E.Bursztein A.Moscicki C.Fabry S.Bethard D.Jurafsky P.Buiras D.B.Giffin D.Terei D.Lie C.A.Thekkath D.Boneh M.Horowitz
Talks about:
type (14) secur (10) analysi (8) protocol (7) polymorph (6) languag (6) subtyp (6) probabilist (5) calculus (5) infer (5)

Person: John C. Mitchell

DBLP DBLP: Mitchell:John_C=

Facilitated 1 volumes:

POPL 2002Ed

Contributed to:

CHI 20142014
ICFP 20122012
OSDI 20122012
SAS 20112011
LICS 20062006
ICALP 20052005
PPDP 20052005
FoSSaCS 20042004
PADL 20032003
RTA 20022002
ESOP 20012001
LICS 20012001
POPL 20012001
ASPLOS 20002000
World Congress on Formal Methods 19991999
OOPSLA 19991999
CAV 19981998
OOPSLA 19981998
OOPSLA 19971997
ICALP 19961996
POPL 19951995
POPL 19941994
CSL 19921992
LICS 19921992
POPL 19921992
POPL 19911991
LFP 19901990
POPL 19901990
FPCA 19891989
POPL 19891989
LFP 19881988
POPL 19881988
LICS 19871987
POPL 19871987
LFP 19861986
POPL 19861986
POPL 19851985
POPL 19841984
PODS 19831983
POPL 19821982
Haskell 20112011

Wrote 43 papers:

CHI-2014-BurszteinMFBMJ
Easy does it: more usable CAPTCHAs (EB, AM, CF, SB, JCM, DJ), pp. 2637–2646.
ICFP-2012-StefanRBLMM #concurrent #data flow #termination
Addressing covert termination and timing channels in concurrent information flow systems (DS, AR, PB, AL, JCM, DM), pp. 201–214.
OSDI-2012-GiffinLSTMMR #named #privacy #web
Hails: Protecting Data Privacy in Untrusted Web Applications (DBG, AL, DS, DT, DM, JCM, AR), pp. 47–60.
SAS-2011-Mitchell #program analysis #security #web
Program Analysis for Web Security (JCM), p. 4.
LICS-2006-BarthM #linear #logic #using
Managing Digital Rights using Linear Logic (AB, JCM), pp. 127–136.
ICALP-2005-DattaDMST #logic #polynomial #probability #protocol #security #semantics
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic (AD, AD, JCM, VS, MT), pp. 16–29.
PPDP-2005-Mitchell #analysis #logic #network #protocol #security
Security analysis of network protocols: logical and computational methods (JCM), pp. 151–152.
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.
PADL-2003-LiM #constraints #datalog #trust
DATALOG with Constraints: A Foundation for Trust Management Languages (NL, JCM), pp. 58–73.
RTA-2002-Mitchell #analysis #multi #protocol #security
Multiset Rewriting and Security Protocol Analysis (JCM), pp. 19–22.
ESOP-2001-Mitchell #analysis #calculus #polynomial #probability #process #protocol #security
Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis (JCM), pp. 23–29.
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.
POPL-2001-Mitchell #programming language #security
Programming language methods in computer security (JCM), pp. 1–3.
ASPLOS-2000-LieTMLBMH #architecture
Architectural Support for Copy and Tamper Resistant Software (DL, CAT, MM, PL, DB, JCM, MH), pp. 168–177.
FM-v1-1999-LincolnMMS #analysis #equivalence #polynomial #probability #security
Probabilistic Polynomial-Time Equivalence and Security Analysis (PL, JCM, MM, AS), pp. 776–793.
OOPSLA-1999-FreundM #bytecode #framework #java #verification
A Formal Framework for the Java Bytecode Language and Verifier (SNF, JCM), pp. 147–166.
CAV-1998-Mitchell #analysis #finite #protocol #security
Finite-State Analysis of Security Protocols (JCM), pp. 71–76.
OOPSLA-1998-FreundM #bytecode #java #type system
A Type System for Object Initialization in the Java Bytecode Language (SNF, JCM), pp. 310–327.
OOPSLA-1997-AgesenFM #java
Adding Type Parameterization to the Java Language (OA, SNF, JCM), pp. 49–65.
ICALP-1996-MitchellV #effectiveness #modelling #morphism #polymorphism #recursion #type system
Effective Models of Polymorphism, Subtyping and Recursion (JCM, RV), pp. 170–181.
POPL-1995-HoangM #bound #type inference #type system
Lower Bounds on Type Inference with Subtypes (MH, JCM), pp. 176–185.
POPL-1994-KatiyarLM #prototype #type system
A Type System for Prototyping Languages (DK, DCL, JCM), pp. 138–150.
CSL-1992-MitchellS
Notes on Sconing and Relators (JCM, AS), pp. 352–378.
LICS-1992-LincolnM #aspect-oriented #linear #λ-calculus
Operational aspects of linear λ calculus (PL, JCM), pp. 235–246.
POPL-1992-BruceM #higher-order #modelling #morphism #polymorphism #recursion #type system
PER Models of Subtyping, Recursive Types and Higher-Order Polymorphism (KBB, JCM), pp. 316–327.
POPL-1992-LincolnM #algorithm #aspect-oriented #type inference #type system
Algorithmic Aspects of Type Inference with Subtypes (PL, JCM), pp. 293–304.
POPL-1991-MitchellMM #inheritance #ml #standard #type system
An Extension of Standard ML Modules with Subtyping and Inheritance (JCM, SM, NM), pp. 270–278.
LFP-1990-HowardM #axiom #semantics
Operational and Axiomatic Semantics of PCF (BTH, JCM), pp. 298–306.
POPL-1990-HarperMM #higher-order
Higher-Order Modules and the Phase Distinction (RH, JCM, EM), pp. 341–354.
POPL-1990-Mitchell #inheritance #towards
Toward a Typed Foundation for Method Specialization and Inheritance (JCM), pp. 109–124.
FPCA-1989-CanningCHOM #bound #morphism #object-oriented #polymorphism #programming
F-Bounded Polymorphism for Object-Oriented Programming (PSC, WRC, WLH, WGO, JCM), pp. 273–280.
POPL-1989-KanellakisM #ml #polymorphism #type system #unification
Polymorphic Unification and ML Typing (PCK, JCM), pp. 105–115.
LFP-1988-JategaonkarM #ml #pattern matching #type system
ML with Extended Pattern Matching and Subtypes (LJ, JCM), pp. 198–211.
POPL-1988-MitchellH #ml
The Essence of ML (JCM, RH), pp. 28–46.
LICS-1987-MitchellM #modelling #λ-calculus
Kripke-Style models for typed λ calculus (JCM, EM), pp. 303–314.
POPL-1987-MeyerMMS #polymorphism #λ-calculus
Empty Types in Polymorphic λ Calculus (ARM, JCM, EM, RS), pp. 253–262.
LFP-1986-Mitchell #approach #polymorphism #reduction #semantics
A Type-Inference Approach to Reduction Properties and Semantics of Polymorphic Expressions (JCM), pp. 308–319.
POPL-1986-Mitchell #abstraction #independence #representation
Representation Independence and Data Abstraction (JCM), pp. 263–276.
POPL-1985-MitchellP #data type
Abstract Types Have Existential Type (JCM, GDP), pp. 37–51.
POPL-1984-Mitchell #type inference
Coercion and Type Inference (JCM), pp. 175–185.
PODS-1983-Mitchell #dependence #functional
Inference Rules for Functional and Inclusion Dependencies (JCM), pp. 58–69.
POPL-1982-MeyerM #axiom #recursion #source code
Axiomatic Definability and Completeness for Recursive Programs (ARM, JCM), pp. 337–346.
Haskell-2011-StefanRMM #data flow #flexibility #haskell #information management
Flexible dynamic information flow control in Haskell (DS, AR, JCM, DM), pp. 95–106.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.