Daniel Le Métayer
Proceedings of the 11th European Symposium on Programming
ESOP, 2002.
@proceedings{ESOP-2002,
address = "Grenoble, France",
editor = "Daniel Le Métayer",
isbn = "3-540-43363-5",
publisher = "{Springer International Publishing}",
series = "{Lecture Notes in Computer Science}",
title = "{Proceedings of the 11th European Symposium on Programming}",
volume = 2305,
year = 2002,
}
Contents (22 items)
- ESOP-2002-Morrisett #type checking
- Type Checking Systems Code (JGM), pp. 1–5.
- ESOP-2002-HirschowitzL #call-by #mixin
- Mixin Modules in a Call-by-Value Setting (TH, XL), pp. 6–20.
- ESOP-2002-Grossman #imperative
- Existential Types for Imperative Languages (DG), pp. 21–35.
- ESOP-2002-AspinallH #type system
- Another Type System for In-Place Update (DA, MH), pp. 36–52.
- ESOP-2002-BistarelliMR #concurrent #constraints #programming
- Soft Concurrent Constraint Programming (SB, UM, FR), pp. 53–67.
- ESOP-2002-McGuireKH #programming language
- Programming Languages for Compressing Graphics (MM, SK, JFH), pp. 68–82.
- ESOP-2002-HuIT #cumulative #parallel
- An Accumulative Parallel Skeleton for All (ZH, HI, MT), pp. 83–97.
- ESOP-2002-Weirich #analysis #higher-order
- Higher-Order Intensional Type Analysis (SW), pp. 98–114.
- ESOP-2002-WellsH #branch
- Branching Types (JBW, CH), pp. 115–132.
- ESOP-2002-Laird #continuation #exception
- Exceptions, Continuations and Macro-expressiveness (JL), pp. 133–146.
- ESOP-2002-Glew #formal method #higher-order
- A Theory of Second-Order Trees (NG), pp. 147–161.
- ESOP-2002-Horwitz #test coverage #tool support
- Tool Support for Improving Test Coverage (SH), pp. 162–177.
- ESOP-2002-Kandemir
- Data Space Oriented Tiling (MTK), pp. 178–193.
- ESOP-2002-Martel #approach #fault #finite #precise #semantics
- Propagation of Roundoff Errors in Finite Precision Computations: A Semantics Approach (MM), pp. 194–208.
- ESOP-2002-GoubaultMP #float #interpreter #precise
- Asserting the Precision of Floating-Point Computations: A Simple Abstract Interpreter (EG, MM, SP), pp. 209–212.
- ESOP-2002-WandW #analysis #composition #proving
- A Modular, Extensible Proof Method for Small-Step Flow Analyses (MW, GBW), pp. 213–227.
- ESOP-2002-Thiemann #calculus #dependence #prototype
- A Prototype Dependency Calculus (PT), pp. 228–242.
- ESOP-2002-NielsonNS #analysis #automation #complexity
- Automatic Complexity Analysis (FN, HRN, HS), pp. 243–261.
- ESOP-2002-FlanaganFQ #source code #thread #verification
- Thread-Modular Verification for Shared-Memory Programs (CF, SNF, SQ), pp. 262–277.
- ESOP-2002-WansbroughNSS #semantics #thread
- Timing UDP: Mechanized Semantics for Sockets, Threads, and Failures (KW, MN, PS, AS), pp. 278–294.
- ESOP-2002-CharatonikGT #mobile
- Finite-Control Mobile Ambients (WC, ADG, JMT), pp. 295–313.
- ESOP-2002-Feret #analysis #dependence #mobile
- Dependency Analysis of Mobile Systems (JF), pp. 314–330.