Vitor Santos Costa

Wednesday, November 28, 2012

Vitor Santos Costa, Associate Research Professor, University ofPorto, Portugal

Learning with Prolog

Abstract: Prolog is an expressive declarative language, and it is the ideal language for learning from structured and complex data...


Derek Dreyer

Monday, November 19, 2012

Derek Dreyer, Assistant Research Professor, Max Planck Institute for Software Systems, Germany

Logical Relations for Fine-Grained Concurrency

Abstract: Fine-grained concurrent data structures (or FCDs) reduce the granularity of critical sections in both time and space, th...


Abstract: Microsoft research connecting to Labs and Academia


Roberto Di Cosmo

Tuesday, October 30, 2012

Roberto Di Cosmo, Professor, Université Paris Diderot, France

Analysing co-installability of software components

Abstract: Modern software systems are built by composing components drawn from large repositories, whose size and complexity is in...


Jan Reineke

Thursday, October 25, 2012

Jan Reineke, Assistant Professor, Saarland University, Germany

Timing Analysis of Embedded Software for Platforms

Abstract: Interaction of embedded systems with their physical environment often imposes timing constraints on the embedded system&...


Kathryn Francis

Friday, October 19, 2012

Kathryn Francis, PhD Student, The University of Melbourne, Australia

Optimization modelling for software developers

Abstract: The field of Constraint Programming (CP) is concerned with solving combinatorial optimisation problems, and the associat...


Jérôme Feret

Monday, October 15, 2012

Jérôme Feret, Researcher, École Normale Supérieure, Paris, France

Formal model reduction

Abstract: Combinatorial explosion of protein states generated by post-translational modifications and complex formation. Rule-base...


Heiko Mantel

Friday, June 22, 2012

Heiko Mantel, Professor, TU Darmstadt, Germany

Certifying Noninterference for Concurrent Programs

Abstract: Research on certifying information flow security for sequential programs has made much progress over the last fifteen ye...


Carroll Morgan

Friday, June 22, 2012

Carroll Morgan, Research Professor, University of New South Wales, Australia

Program algebra for noninterference security

Abstract: Noninterference security (due to Goguen and Meseguer) considers breaches that result from the -interference- that hidden...


Geoffrey Smith

Friday, June 22, 2012

Geoffrey Smith, Associate Research Professor, Florida International University, USA

Some Recent Results on Min-Entropy Leakage

Abstract: In this talk we discuss several recent results about min-entropy leakage. We first briefly recall the definitions of min...


Diego Garbervetsky

Wednesday, June 20, 2012

Diego Garbervetsky, Professor, Universidad de Buenos Aires and CONICET, Argentina

Quantitative analysis of Java/.Net like programs to understand heap memory requirements

Abstract: There is an increasing interest in understanding and analyzing the use of resources in software and hardware systems. Ce...


Geoffrey Smith

Wednesday, June 13, 2012

Geoffrey Smith, Associate Research Professor, Florida International University, USA

Measuring Information Leakage using Generalized Gain Functions

Abstract: This talk introduces g-leakage, a rich generalization of the min-entropy model of quantitative information flow. In g-le...


Pietro Ferrara

Tuesday, June 12, 2012

Pietro Ferrara, Post-doctoral Researcher, ETH Zurich, Switzerland

TVLA and Value Analyses Together

Abstract: Effective static analyses must precisely approximate both heap structure and information about values. During the last d...


Mike Hicks

Friday, June 1, 2012

Mike Hicks, Associate Research Professor, University of Maryland, USA

Polymonads: reasoning and inference

Abstract: Many useful programming constructions can be expressed as monads. Examples include probabilistic modeling, functional re...


Mike Dodds

Wednesday, May 23, 2012

Mike Dodds, Post-doctoral Researcher, University of Cambridge, United Kingdom

Recovering Disjointness from Concurrent Sharing

Abstract: Disjointness between resources is an extraordinarily useful property when verifying concurrent programs. Threads that ac...


Earl Barr

Tuesday, May 22, 2012

Earl Barr, Post-doctoral Researcher, University of California at Davis, USA

On the Naturalness of Software (to appear at ICSE 2012)

Abstract: Natural languages like English are rich, complex, and powerful. The highly creative and graceful use of languages like E...


Earl Barr

Friday, May 18, 2012

Earl Barr, Post-doctoral Researcher, University of California at Davis, USA

Techniques and Tools for Engineering Robust Numerical Software

Abstract: Writing correct software is difficult; writing reliable numerical software involving floating-point numbers is even more...


Yuriy Brun

Thursday, April 12, 2012

Yuriy Brun, Post-doctoral Researcher, University of Washington, USA

Speculative Analysis: What's Wrong with the Program I Haven't Written Yet?

Abstract: Software developers primarily rely on experience and intuition to make development decisions. I will describe speculativ...


Schmuel Mooly Sagiv

Wednesday, March 28, 2012

Schmuel Mooly Sagiv, Professor, Tel Aviv University, Israel

Data Representation Synthesis

Abstract: We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both decl...


Schmuel Mooly Sagiv

Monday, March 26, 2012

Schmuel Mooly Sagiv, Professor, Tel Aviv University, Israel

COLT: Testing and Verifying Atomicity of Composed Operations

Abstract: In the last two decades, program verification and testing have gone a long way from a concept to practical tools which c...


Neil Jones

Friday, March 23, 2012

Neil Jones, Professor, DIKU University of Copenhagen, Denmark

Some remarks on the spectrum problem

Abstract: Scholz posed in 1952 the problem of characterising the class of spectra (of formulas in first-order logic with equality)...


Neil Jones

Wednesday, March 21, 2012

Neil Jones, Professor, DIKU University of Copenhagen, Denmark

Kleenes Second Recursion Theorem (Work in Progress)

Abstract: Self-adjusting computation is a language-based approach to writing incremental programs that respond dynamically to inpu...


Neil Jones

Wednesday, March 14, 2012

Neil Jones, Professor, DIKU University of Copenhagen, Denmark

Superlinear speedup (Work in Progress)

Abstract: Many interesting program transformations (by Burstall-Darlington, Bird, Pettorossi, and many others) have been published...


Markus Rabe

Tuesday, March 13, 2012

Markus Rabe, PhD Student, Saarland University, Germany

Temporal Information Flow

Abstract: Most analysis methods for information flow properties, such as noninterference, do not consider temporal restrictions. I...


Neil Jones

Wednesday, March 7, 2012

Neil Jones, Professor, DIKU University of Copenhagen, Denmark

PROGRAMS

Abstract: From a programming perspective, Alan Turing’s epochal 1936 paper on computable functions introduced several new co...


Neil Jones

Wednesday, February 22, 2012

Neil Jones, Professor, DIKU University of Copenhagen, Denmark

Obfuscation by Partial Evaluation of Distorted Interpreters

Abstract: How to construct a general program obfuscator? We present a novel approach to automatically generating obfuscated code P...


Neil Jones

Tuesday, February 14, 2012

Neil Jones, Professor, DIKU University of Copenhagen, Denmark

Introduction to partial evaluation

Abstract: Quick overview of: Interpreters, Compilers, and Program Specialisers The Futamura projections (Futamura stated them; 13 ...