Pierpaolo Degano
Proceedings of the 12th European Symposium on Programming
ESOP, 2003.

@proceedings{ESOP-2003,
	address       = "Warsaw, Poland",
	editor        = "Pierpaolo Degano",
	isbn          = "3-540-00886-1",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 12th European Symposium on Programming}",
	volume        = 2618,
	year          = 2003,
}

Contents (27 items)

4 ×#analysis
3 ×#encryption
3 ×#logic programming
3 ×#protocol
3 ×#security
2 ×#evolution
2 ×#higher-order
2 ×#logic
2 ×#modelling
2 ×#requirements

ESOP-2003-Leroy #perspective #programming language #security #static analysis

Computer Security from a Programming Language and Static Analysis Perspective (XL), pp. 1–9.

ESOP-2003-Meadows #analysis #encryption #evolution #protocol #requirements #specification #what

What Makes a Cryptographic Protocol Secure? The Evolution of Requirements Specification in Formal Cryptographic Protocol Analysis (CM), pp. 10–21.

ESOP-2003-ClementsF #recursion #semantics #stack

A Tail-Recursive Semantics for Stack Inspections (JC, MF), pp. 22–37.

ESOP-2003-DrossopoulouLE #flexibility #modelling

Flexible Models for Dynamic Linking (SD, GL, SE), pp. 38–53.

ESOP-2003-AlpuenteBCF #functional #logic programming #source code

Correction of Functional Logic Programs (MA, DB, FJC, MF), pp. 54–68.

ESOP-2003-CastroW #approximate #logic programming

Approximate Pruning in Tabled Logic Programming (LFC, DSW), pp. 69–83.

ESOP-2003-GenaimK #analysis #independence #logic programming #scheduling #source code

Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling (SG, AK), pp. 84–98.

ESOP-2003-Comon-LundhC #security

Security Properties: Two Agents Are Sufficient (HCL, VC), pp. 99–113.

ESOP-2003-GorrieriLM #analysis #encryption #protocol #realtime

A Simple Language for Real-Time Cryptographic Protocol Analysis (RG, EL, FM), pp. 114–128.

ESOP-2003-Tini

Rule Formats for Non Interference (ST), pp. 129–143.

ESOP-2003-GiambiagiD #implementation #on the #protocol #security

On the Secure Implementation of Security Protocols (PG, MD), pp. 144–158.

ESOP-2003-Laud #analysis #data flow #encryption

Handling Encryption in an Analysis for Secure Information Flow (PL), pp. 159–173.

ESOP-2003-AltisenCMR #using

Using Controller-Synthesis Techniques to Build Property-Enforcing Layers (KA, AC, FM, ÉR), pp. 174–188.

ESOP-2003-Flanagan #automation #model checking #using

Automatic Software Model Checking Using CLP (CF), pp. 189–203.

ESOP-2003-YahavRSW #evolution #logic #verification

Verifying Temporal Heap Properties Specified via Evolution Logic (EY, TWR, SS, RW), pp. 204–222.

ESOP-2003-ReddyY #correctness #data transformation #data type

Correctness of Data Representations Involving Heap Data Structures (USR, HY), pp. 223–237.

ESOP-2003-GraunkeFKF #interactive #modelling #web

Modeling Web Interactions (PTG, RBF, SK, MF), pp. 238–252.

ESOP-2003-Lhoussaine #distributed #type inference #π-calculus

Type Inference for a Distributed π-Calculus (CL), pp. 253–268.

ESOP-2003-ErwigR #programming #type safety

Programming Type-Safe Program Updates (ME, DR), pp. 269–283.

ESOP-2003-HaackW #fault #higher-order #slicing

Type Error Slicing in Implicitly Typed Higher-Order Languages (CH, JBW), pp. 284–301.

ESOP-2003-DanosL #biology

Core Formal Molecular Biology (VD, CL), pp. 302–318.

ESOP-2003-GeilenB #execution #network #process #requirements

Requirements on the Execution of Kahn Process Networks (MG, TB), pp. 319–334.

ESOP-2003-DanvyL #encoding

Tagging, Encoding, and Jones Optimality (OD, PEML), pp. 335–347.

ESOP-2003-Nieto #higher-order

The Rely-Guarantee Method in Isabelle/HOL (LPN), pp. 348–362.

ESOP-2003-YuHS #library

Building Certified Libraries for PCC: Dynamic Storage Allocation (DY, NAH, ZS), pp. 363–379.

ESOP-2003-RepsSL #difference #finite #logic #static analysis

Finite Differencing of Logical Formulas for Static Analysis (TWR, SS, AL), pp. 380–398.

ESOP-2003-Ohori #proving

Register Allocation by Proof Transformation (AO), pp. 399–413.