Programme of BYTECODE at ETAPS 2011

Sunday, March 27

Room E1.3/107

09:15 - 10:30 SESSION 1

09.15: Welcome

09.30: Invited Talk: VeriFast: A Powerful, Fast, Sound, Predictable Verifier for C and Java

Bart Jacobs (Katholieke Universiteit Leuven)

10:30 - 11:00 Coffee

11:00 - 12:30 SESSION 2

11.00: Complete and Platform-independent Calling Context Profiling for the Java Virtual Machine

Aibek Sarimbekov1, Philippe Moret1, Walter Binder1, Andreas Sewe2, and Mira Mezini2 (University of Lugano1, Technische Universitat Darmstadt2)

11.30: Implementing Whiley on the JVM

David Pearce and James Noble (Victoria University of Wellington)

12.00: Treegraph-based instruction scheduling for stack-based virtual machines

Jiin Park1, Jinhyung Park1, Wonjoon Song1, Sungwook Yoon1, Bernd Burgstaller1, and Bernhard Scholz2 (Yonsei University1, University of Sydney2)

12:30 - 14:30 Lunch

14:30 - 16:00 SESSION 3

14:30: Handling non-linear operations in the value analysis of COSTA

Diego Esteban Alonso Blas, Puri Arenas, and Samir Genaim (Complutense University of Madrid)

15:00: Static Resource Analysis for Java Bytecode Using Amortisation and Separation Logic

Kenneth MacKenzie and Damon Fenacci  (University of Edinburgh)

15:30: LCT: An Open Source Concolic Testing Tool For Java Programs

Kari KähkönenTuomas Launiainen, Olli Saarikivi, Janne Kauttio, Keijo Heljanko, and Ilkka Niemelä (Aalto University)

16:00 - 16:30 Coffee

16:30 - 17:30 SESSION 4

16.30: Invited Talk: Bytecode at Microsoft Research

Todd Mytkowicz (Microsoft Research)

 
HOME PAGE:   http://software.imdea.org/~pierreganty/bytecode2011/