David Sands
Proceedings of the 10th European Symposium on Programming
ESOP, 2001.
@proceedings{ESOP-2001, address = "ETAPS 2001 Genova, Italy", editor = "David Sands", isbn = "3-540-41862-8", publisher = "{Springer-Verlag}", series = "{Lecture Notes in Computer Science}", title = "{Proceedings of the 10th European Symposium on Programming}", volume = 2028, year = 2001, }
Contents (28 items)
- ESOP-2001-CardelliG #logic #query
- A Query Language Based on the Ambient Logic (LC, GG), pp. 1–22.
- ESOP-2001-Mitchell #analysis #calculus #polynomial #probability #process #protocol #security
- Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis (JCM), pp. 23–29.
- ESOP-2001-PottierSS #approach #data access
- A Systematic Approach to Static Access Control (FP, CS, SFS), pp. 30–45.
- ESOP-2001-ZdancewicM #continuation #data flow
- Secure Information Flow and CPS (SZ, ACM), pp. 46–61.
- ESOP-2001-Thiemann #safety #using
- Enforcing Safety Properties Using Type Specialization (PT), pp. 62–76.
- ESOP-2001-Laud #data flow #program analysis #semantics
- Semantics and Program Analysis of Computationally Secure Information Flow (PL), pp. 77–91.
- ESOP-2001-Weirich #analysis #encoding
- Encoding Intensional Type Analysis (SW), pp. 92–106.
- ESOP-2001-Backhouse
- Fusion on Languages (RCB), pp. 107–121.
- ESOP-2001-GraunkeKHF #programming language #web
- Programming the Web with High-Level Programming Languages (PTG, SK, SVDH, MF), pp. 122–136.
- ESOP-2001-Ranzato #model checking #on the
- On the Completeness of Model Checking (FR), pp. 137–154.
- ESOP-2001-HuthJS #program analysis
- Modal Transition Systems: A Foundation for Three-Valued Program Analysis (MH, RJ, DAS), pp. 155–169.
- ESOP-2001-SuA #constraints #similarity
- Entailment with Conditional Equality Constraints (ZS, AA), pp. 170–189.
- ESOP-2001-Muller-OlmR #complexity #constant #on the
- On the Complexity of Constant Propagation (MMO, OR), pp. 190–205.
- ESOP-2001-AmtoftKP #question #what
- What Are Polymorphically-Typed Ambients? (TA, AJK, SMPG), pp. 206–220.
- ESOP-2001-ConchonP #calculus #constraints #type inference
- JOIN(X): Constraint-Based Type Inference for the Join-Calculus (SC, FP), pp. 221–236.
- ESOP-2001-CuoqP #composition
- Modular Causality in a Synchronous Stream Language (PC, MP), pp. 237–251.
- ESOP-2001-NielsonS #analysis #control flow #polynomial
- Control-Flow Analysis in Cubic Time (FN, HS), pp. 252–268.
- ESOP-2001-Boudol #recursion #revisited #semantics
- The Recursive Record Semantics of Objects Revisited (GB), pp. 269–283.
- ESOP-2001-Jacobs #exception #formal method #java
- A Formalisation of Java’s Exception Mechanism (BJ), pp. 284–301.
- ESOP-2001-BartheDJSS #execution #framework #platform #semantics
- A Formal Executable Semantics of the JavaCard Platform (GB, GD, LJ, BPS, SMdS), pp. 302–319.
- ESOP-2001-ClementsFF #algebra #modelling
- Modeling an Algebraic Stepper (JC, MF, MF), pp. 320–334.
- ESOP-2001-XuRM #type system
- Typestate Checking of Machine Code (ZX, TWR, BPM), pp. 335–351.
- ESOP-2001-KatsumataO #decompiler #low level
- Proof-Directed De-compilation of Low-Level Code (SyK, AO), pp. 352–366.
- ESOP-2001-Monniaux #abstract interpretation #probability #source code
- Backwards Abstract Interpretation of Probabilistic Programs (DM), pp. 367–382.
- ESOP-2001-KomondoorH #dependence #tool support #using
- Tool Demonstration: Finding Duplicated Code Using Program Dependences (RK, SH), pp. 383–386.
- ESOP-2001-CadoliS #compilation #problem #satisfiability #specification
- Compiling Problem Specifications into SAT (MC, AS), pp. 387–401.
- ESOP-2001-BossiERS #logic programming #scheduling #semantics #source code #termination
- Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling (AB, SE, SR, JGS), pp. 402–416.
- ESOP-2001-GenaimC #analysis #approach #dependence
- The Def-inite Approach to Dependency Analysis (SG, MC), pp. 417–432.
4 ×#analysis
4 ×#semantics
2 ×#approach
2 ×#calculus
2 ×#constraints
2 ×#data flow
2 ×#dependence
2 ×#on the
2 ×#polynomial
2 ×#probability
4 ×#semantics
2 ×#approach
2 ×#calculus
2 ×#constraints
2 ×#data flow
2 ×#dependence
2 ×#on the
2 ×#polynomial
2 ×#probability