Program Analysis and Compilation, Theory and Practice : Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday

by Reps, Thomas W.; Sagiv, Mooly; Bauer, Jorg

• ISBN13: 9783540713159
• ISBN10: 3540713158
• Format: Paperback
• Copyright: 2007-06-03
• Publisher: Springer Verlag

Summary

Reinhard Wilhelm's career in Computer Science spans more than a third of a century. During this time, he has made numerous research contributions to the areas of programming languages, compilers and compiler generators, static program analysis, program transformation, algorithm animation, and real-time systems; co-founded a company to transfer some of these ideas to industry; held the Chair for Programming Languages and Compiler Construction at Saarland University; and served since its inception in 1990 as the Scientific Director of the International Conference and Research Center for Computer Science at Schloss Dagstuhl. This Festschrift volume, published to honor Reinhard Wilhelm on his 60th Birthday on June 10, 2006, includes 15 refereed papers by leading researchers, his graduate students and research collaborators, as well as current and former colleagues, who all attended a celebratory symposium held at Schloss Dagstuhl, Germany. The articles of this volume thus serve also as the proceedings of the aforementioned Dagstuhl symposium.

Table of Contents

An appreciation of the work of Reinhard Wilhelm	p. 1
New developments in WCET analysis	p. 12
Realistic worst-case execution time analysis in the context of pervasive system verification	p. 53
Lazy execution of boolean queries	p. 82
Cryptographic protocol verification using tractable classes of horn clauses	p. 97
Infering ownership types for encapsulated object-oriented program components	p. 120
ViDoC- visual design of optimizing compilers	p. 145
Abstract interpretation for worst and average case analysis	p. 160
Grammar analysis and parsing by abstract interpretation	p. 175
Ensuring properties of interaction systems	p. 201
On the expressive power of live sequence charts	p. 225
Refinement-based verification for possibly-cyclic lists	p. 247
Abstract counterexample-based refinement for powerset domains	p. 273
Types from control flow analysis	p. 293
Data flow analysis for CCS	p. 311
Towards a source level compiler : source level modulo scheduling	p. 328
Table of Contents provided by Blackwell. All Rights Reserved.