Chris Hankin, Dave Schmidt
Conference Record of the 28th Symposium on Principles of Programming Languages
POPL, 2001.

@proceedings{POPL-2001,
	acmid         = "360204",
	address       = "London, England, United Kingdom",
	editor        = "Chris Hankin and Dave Schmidt",
	isbn          = "1-58113-336-7",
	publisher     = "{ACM}",
	title         = "{Conference Record of the 28th Symposium on Principles of Programming Languages}",
	volume        = "ACM SIGPLAN Notices 36(3), March 2001",
	year          = 2001,
}

Contents (26 items)

4 ×#type system
2 ×#analysis
2 ×#calculus
2 ×#communication
2 ×#data type
2 ×#logic
2 ×#mobile
2 ×#safety
2 ×#source code
2 ×#verification

POPL-2001-Mitchell #programming language #security

Programming language methods in computer security (JCM), pp. 1–3.

POPL-2001-Sangiorgi #logic

Extensionality and Intensionality of the Ambient Logics (DS), pp. 4–13.

POPL-2001-IshtiaqO #data type

BI as an Assertion Language for Mutable Data Structures (SSI, PWO), pp. 14–26.

POPL-2001-Yahav #concurrent #java #logic #safety #source code #using #verification

Verifying safety properties of concurrent Java programs using 3-valued logic (EY), pp. 27–40.

POPL-2001-OderskyZZ #type inference

Colored local type inference (MO, CZ, MZ), pp. 41–53.

POPL-2001-RehofF #analysis #polymorphism #type system

Type-base flow analysis: from polymorphic subtyping to CFL-reachability (JR, MF), pp. 54–66.

POPL-2001-HosoyaP #pattern matching #regular expression #xml

Regular expression pattern matching for XML (HH, BCP), pp. 67–80.

POPL-2001-LeeJB #termination

The size-change principle for program termination (CSL, NDJ, AMBA), pp. 81–92.

POPL-2001-Monniaux #analysis #monte carlo #probability #source code

An abstract Monte-Carlo method for the analysis of probabilistic programs (DM), pp. 93–101.

POPL-2001-Ganzinger #deduction #performance #program analysis

Efficient deductive methods for program analysis (HG), pp. 102–103.

POPL-2001-AbadiF #communication #mobile

Mobile values, new names, and secure communication (MA, CF), pp. 104–115.

POPL-2001-UnyapothS #communication #framework #mobile

Nomadic pict: correct communication infrastructure for mobile computation (AU, PS), pp. 116–127.

POPL-2001-IgarashiK #type system #π-calculus

A generic type system for the π-calculus (AI, NK), pp. 128–141.

POPL-2001-NeculaR

Oracle-based checking of untrusted software (GCN, SPR), pp. 142–154.

POPL-2001-Calcagno #calculus #correctness #safety #semantics

Stratified operational semantics for safety and correctness of the region calculus (CC), pp. 155–165.

POPL-2001-WangA #garbage collection

Type-preserving garbage collectors (DCW, AWA), pp. 166–178.

POPL-2001-Kandemir #compilation #locality

A compiler technique for improving whole-program locality (MTK), pp. 179–192.

POPL-2001-FlanaganS #explosion #exponential #generative #verification

Avoiding exponential explosion: generating compact verification conditions (CF, JBS), pp. 193–205.

POPL-2001-BhargavanCMG #automaton #monitoring #network #what

What packets may come: automata for network monitoring (KB, SC, PJM, CAG), pp. 206–219.

POPL-2001-Milner

Computational flux (RM), pp. 220–221.

POPL-2001-BugliesiC

Secure safe ambients (MB, GC), pp. 222–235.

POPL-2001-Sewell #data type #distributed #version control

Modules, abstract types, and distributed versioning (PS), pp. 236–247.

POPL-2001-GordonS #multi #type system

Typing a multi-language intermediate code (ADG, DS), pp. 248–260.

POPL-2001-ShieldsM

Type-indexed rows (MS, EM), pp. 261–275.

POPL-2001-Gil #type system

Subtyping arithmetical types (JYG), pp. 276–289.

POPL-2001-Vouillon #calculus

Combining subsumption and binary methods: an object calculus with views (JV), pp. 290–303.