Mark N. Wegman, Thomas W. Reps
Proceedings of the 27th Symposium on Principles of Programming Languages
POPL, 2000.

@proceedings{POPL-2000,
	acmid         = "325694",
	address       = "Boston, Massachusetts, USA",
	editor        = "Mark N. Wegman and Thomas W. Reps",
	isbn          = "1-58113-125-9",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 27th Symposium on Principles of Programming Languages}",
	year          = 2000,
}

Contents (31 items)

4 ×#type system
3 ×#analysis
2 ×#constraints
2 ×#graph
2 ×#mobile
2 ×#semantics
2 ×#verification

POPL-2000-EsparzaP #algorithm #graph #interprocedural #parallel #performance

Efficient Algorithms for pre^* and post^* on Interprocedural Parallel Flow Graphs (JE, AP), pp. 1–11.

POPL-2000-CousotC #abstract interpretation

Temporal Abstract Interpretation (PC, RC), pp. 12–25.

POPL-2000-HeintzeJV #analysis #framework #verification

A Framework for Combining Analysis and Verification (NH, JJ, RV), pp. 26–39.

POPL-2000-Agat

Transforming Out Timing Leaks (JA), pp. 40–53.

POPL-2000-ColcombetF #program transformation

Enforcing Trace Properties by Program Transformation (TC, PF), pp. 54–66.

POPL-2000-MuthD #analysis #complexity #data flow #on the

On the Complexity of Flow-Sensitive Dataflow Analyses (RM, SKD), pp. 67–80.

POPL-2000-SuFA #constraints #graph

Projection Merging: Reducing Redundancies in Inclusion Constraint Graphs (ZS, MF, AA), pp. 81–95.

POPL-2000-AspertiCM #recursion

(Optimal) Duplication is not Elementary Recursive (AA, PC, SM), pp. 96–107.

POPL-2000-LewisLMS #parametricity #static typing

Implicit Parameters: Dynamic Scoping with Static Types (JRL, JL, EM, MS), pp. 108–118.

POPL-2000-Hinze #approach #functional #programming

A New Approach to Generic Functional Programming (RH), pp. 119–132.

POPL-2000-Bawden #metaprogramming

First-Class Macros have Types (AB), pp. 133–141.

POPL-2000-NielsonN #analysis #mobile

Shape Analysis for Mobile Ambients (HRN, FN), pp. 142–154.

POPL-2000-KomondoorH #semantics

Semantics-Preserving Procedure Extraction (RK, SH), pp. 155–169.

POPL-2000-RuthingKS

Sparse Code Motion (OR, JK, BS), pp. 170–183.

POPL-2000-CraryW #bound #certification

Resource Bound Certification (KC, SW), pp. 184–198.

POPL-2000-LiblitA #data type #distributed #type system

Type Systems for Distributed Data Structures (BL, AA), pp. 199–213.

POPL-2000-StoneH #equivalence

Deciding Type Equivalence with Singleton Kinds (CAS, RH), pp. 214–227.

POPL-2000-KnoblockR #bytecode #java #type system

Type Elaboration and Subtype Completion for Java Bytecode (TBK, JR), pp. 228–242.

POPL-2000-AppelF #semantics

A Semantic Model of Types and Machine Instuctions for Proof-Carrying Code (AWA, APF), pp. 243–253.

POPL-2000-Walker #policy #security #type system

A Type System for Expressive Security Policies (DW), pp. 254–267.

POPL-2000-VolpanoS #verification

Verifying Secrets and Relative Secrecy (DMV, GS), pp. 268–276.

POPL-2000-ChambersHV #design pattern #tool support

A Debate on Language and Tool Support for Design Patterns (CC, BH, JMV), pp. 277–289.

POPL-2000-SandholmS #documentation #type system #web

A Type System for Dynamic Web Documents (AS, MIS), pp. 290–301.

POPL-2000-AbadiFG #authentication #compilation

Authentication Primitives and Their Compilation (MA, CF, GG), pp. 302–315.

POPL-2000-GunterJ

Generalized Certificate Revocation (CAG, TJ), pp. 316–329.

POPL-2000-CharatonikPT #program analysis

Paths vs. Trees in Set-Based Program Analysis (WC, AP, JMT), pp. 330–337.

POPL-2000-Hickey #constraints #theorem proving

Analytic Constraint Solving and Interval Arithmetic (TJH), pp. 338–351.

POPL-2000-LeviS

Controlling Interference in Ambients (FL, DS), pp. 352–364.

POPL-2000-CardelliG #logic #mobile

Anytime, Anywhere: Modal Logics for Mobile Ambients (LC, ADG), pp. 365–377.

POPL-2000-ChungMES

Reducing Sweep Time for a Nearly Empty Heap (YCC, SMM, KE, DS), pp. 378–389.

POPL-2000-AlurG #composition #refinement

Modular Refinement of Hierarchic Reactive Machines (RA, RG), pp. 390–402.