Johannes Kinder
High System-Code Security with Low Overhead
High System-Code Security with Low Overhead
Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems
Self join elimination and new notions of query containment

Stipend for outstanding female students

Economics and Computation: Five Challenges in Algorithmic Game Theory, Computational Social Choice, and Fair Division
Classifying Bugs with Interpolants

Lower bounds for branching programs of bounded repetition computing CNFs of bounded treewidth: an overview
We introduce transactions into libraries of concurrent data structures; such transactions can be used to ensure atomicity of sequences of data structure operations. By focusing on transactional access to a well-defined set of data structure operations, we strike a balance…
Leslie Lamport will answer questions regarding his Heidelberg Laureate Forum lecture.

The highly successful second edition of the VCLA International Student Awards was concluded on April 16, 2016. Click here for more information and photos.