Software Seminar Series (S3)

Abstract: Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful compu...


Federico Olmedo

Tuesday, November 29, 2011

Federico Olmedo, PhD Student, IMDEA Software Institute

Probabilistic Relational Reasoning for Differential Privacy

Abstract: In this talk I will present two algorithmical approaches to static partial order reduction for Markov Decision Processes...


José Miguel Rojas Siles

Tuesday, November 22, 2011

José Miguel Rojas Siles, PhD Student, The CLIP Laboratory, UPM

Resource-driven CLP-based Test Data Generation

Abstract: Test Data Generation aims at automatically obtaining test inputs that can be used to validate the functional behaviour o...


Alexander Malkis

Tuesday, November 15, 2011

Alexander Malkis, Post-doctoral Researcher, IMDEA Software Institute

Automatic Verification of Software Barriers

Abstract: We describe semi-automatic verification of the software barrier synchronization primitive. We improve the state of the a...


Abstract: Hoare Type Theory (HTT) is as a powerful tool for “structuring the verification of heap manipulating programs&rdqu...


Abstract: Java monitors as implemented in the java.util.concurrent.locks package provide no-priority nonblocking monitors. That is...


Mark Marron

Tuesday, October 18, 2011

Mark Marron, Researcher, IMDEA Software Institute

Collecting a Heap of Shapes

Abstract: I will be giving an informal presentation of results from a recently concluded study on the heap structures that appear ...


Alexey Gotsman

Tuesday, October 11, 2011

Alexey Gotsman, Assistant Research Professor, IMDEA Software Institute

The Importance of Being Linearizable

Abstract: Specifications of concurrent libraries are commonly given by the well-known notion of linearizability. However, to date ...


Aleksandar Nanevski

Tuesday, October 4, 2011

Aleksandar Nanevski, Assistant Research Professor, IMDEA Software Institute

How to make ad hoc proof automation less ad hoc

Abstract: Most interactive theorem provers provide support for some form of user-customizable proof automation. In a number of pop...


Boris Köpf

Thursday, July 14, 2011

Boris Köpf, Assistant Research Professor, IMDEA Software Institute

Information-theoretic Bounds for Differentially Private Mechanisms

Abstract: There are two active and independent lines of research that aim at quantifying the amount of information that is reveale...


Rémy Haemmerlé

Tuesday, June 28, 2011

Rémy Haemmerlé, Post-doctoral Researcher, The CLIP Laboratory, UPM

Observational Equivalences for Linear Logic Concurrent Constraint Languages

Abstract: Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC) where the...


Abstract: We present a framework for (static) verification of general resource usage program properties. The framework extends the...


Abstract: In Service-Oritented Computing, business processes are usually expressed in terms of workflows that describe control and...


Álvaro García

Tuesday, May 24, 2011

Álvaro García, PhD Student, IMDEA Software Institute

Full-Reduction in open strict calculus

Abstract: Theorem provers based on dependent types rely on efficient full-reducers implementing a beta-equivalence tester for thei...


Alexander Malkis

Tuesday, May 17, 2011

Alexander Malkis, Post-doctoral Researcher, IMDEA Software Institute

A Lower Bound on Resource Verification

Abstract: In multi-threaded programs data is often separated into lock-protected resources. Properties of those resources are typi...


Aleks Nanevski

Tuesday, May 10, 2011

Aleks Nanevski, Assistant Research Professor, IMDEA Software Institute

Verification of Information Flow and Access Control Policies with Dependent Types

Abstract: This talk presents Relational Hoare Type Theory (RHTT), a language and verification system for expressing and verifying ...


Germán Delbianco

Tuesday, May 3, 2011

Germán Delbianco, Research Intern, IMDEA Software Institute

Applicative Shortcut Fusion

Abstract: In functional programming one usually writes programs as the composition of simpler functions. Consequently, the result ...


Abstract: Coding rules are used in industry to enforce good software practices that improve software reliability and maintainabili...


Pierre Ganty

Tuesday, April 12, 2011

Pierre Ganty, Assistant Research Professor, IMDEA Software Institute

Petri-nets and finite-index Context-free languages

Abstract: We investigate the issue of determining whether the intersection of a context-free language (CFL) and a Petri net langua...


Abstract: The automata-theoretic approach to model checking reduces a model checking problem to automata constructions and automat...


Juan Caballero

Tuesday, March 29, 2011

Juan Caballero, Assistant Research Professor, IMDEA Software Institute

Differential Slicing: Identifying Causal Execution Differences for Security Applications

Abstract: A security analyst often needs to understand two runs of the same program that exhibit a difference in program state or ...


Alexander Malkis

Tuesday, March 22, 2011

Alexander Malkis, Post-doctoral Researcher, IMDEA Software Institute

A Practical Generic Privacy Language

Abstract: We present a declarative language with a formal semantics for specifying both users’ privacy preferences and servi...


Laurent Mauborgne

Tuesday, March 15, 2011

Laurent Mauborgne, Researcher, IMDEA Software Institute

Solvers, Theories, and Static Analysis

Abstract: Recent progress in solvers modulo theories reach a point where it seems feasible to perform automatic static analysis of...


Alexey Gotsman

Wednesday, March 9, 2011

Alexey Gotsman, Assistant Research Professor, IMDEA Software Institute

Modular verification of preemptive OS kernels

Abstract: Modern concurrency logics are sound only with respect to the interleaving semantics, which assumes scheduling is impleme...


Tuesday, February 8, 2011

Felipe Andrés Manzano, PhD Student, FaMAF, Universidad Nacional de Córdoba - CONICET, Argentina

Efficient Symbolic Execution for Analysing Cryptographic Protocol Implementations

Abstract: The analysis of code that uses cryptographic primitives is unfeasible with current state-of-the-art symbolic execution t...


Tomas Poch

Thursday, January 20, 2011

Tomas Poch, Research Intern, IMDEA Software Institute

Pattern-based verification of concurrent program

Abstract: Reachability of a program location in the concurrent program is an undecidable problem. The pattern based verification i...