Software Seminar Series (S3)
Monday, December 12, 2011
Álvaro Fernández, PhD Student, BABEL, UPMStatic Partial Order Reduction for Probabilistic Systems
Abstract: Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful compu...
Tuesday, November 29, 2011
Federico Olmedo, PhD Student, IMDEA Software InstituteProbabilistic Relational Reasoning for Differential Privacy
Abstract: In this talk I will present two algorithmical approaches to static partial order reduction for Markov Decision Processes...
Tuesday, November 22, 2011
José Miguel Rojas Siles, PhD Student, The CLIP Laboratory, UPMResource-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...
Tuesday, November 15, 2011
Alexander Malkis, Post-doctoral Researcher, IMDEA Software InstituteAutomatic Verification of Software Barriers
Abstract: We describe semi-automatic verification of the software barrier synchronization primitive. We improve the state of the a...
Tuesday, November 8, 2011
German Delbianco, PhD Student, IMDEA Software InstituteVerifying Continuations: Reasoning about Control Effects in Hoare Type Theory
Abstract: Hoare Type Theory (HTT) is as a powerful tool for “structuring the verification of heap manipulating programs&rdqu...
Wednesday, October 26, 2011
Julio Mariño, Researcher, BABEL, UPMVerifying a Priority Monitors Java Library
Abstract: Java monitors as implemented in the java.util.concurrent.locks package provide no-priority nonblocking monitors. That is...
Tuesday, October 18, 2011
Mark Marron, Researcher, IMDEA Software InstituteCollecting 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 ...
Tuesday, October 11, 2011
Alexey Gotsman, Assistant Research Professor, IMDEA Software InstituteThe Importance of Being Linearizable
Abstract: Specifications of concurrent libraries are commonly given by the well-known notion of linearizability. However, to date ...
Tuesday, October 4, 2011
Aleksandar Nanevski, Assistant Research Professor, IMDEA Software InstituteHow 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...
Thursday, July 14, 2011
Boris Köpf, Assistant Research Professor, IMDEA Software InstituteInformation-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...
Tuesday, June 28, 2011
Rémy Haemmerlé, Post-doctoral Researcher, The CLIP Laboratory, UPMObservational Equivalences for Linear Logic Concurrent Constraint Languages
Abstract: Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC) where the...
Tuesday, June 7, 2011
Pedro López-García, Researcher, IMDEA Software InstituteVerification and Debugging of Resource Usage Properties in the CiaoPP System
Abstract: We present a framework for (static) verification of general resource usage program properties. The framework extends the...
Tuesday, May 31, 2011
Dragan Ivanovic, PhD Student, The CLIP Laboratory, UPMAttribute Inference in Complex Service Workflows Based on Sharing Analysis
Abstract: In Service-Oritented Computing, business processes are usually expressed in terms of workflows that describe control and...
Tuesday, May 24, 2011
Álvaro García, PhD Student, IMDEA Software InstituteFull-Reduction in open strict calculus
Abstract: Theorem provers based on dependent types rely on efficient full-reducers implementing a beta-equivalence tester for thei...
Tuesday, May 17, 2011
Alexander Malkis, Post-doctoral Researcher, IMDEA Software InstituteA Lower Bound on Resource Verification
Abstract: In multi-threaded programs data is often separated into lock-protected resources. Properties of those resources are typi...
Tuesday, May 10, 2011
Aleks Nanevski, Assistant Research Professor, IMDEA Software InstituteVerification 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 ...
Tuesday, May 3, 2011
Germán Delbianco, Research Intern, IMDEA Software InstituteApplicative Shortcut Fusion
Abstract: In functional programming one usually writes programs as the composition of simpler functions. Consequently, the result ...
Tuesday, April 26, 2011
Guillem Marpons, Researcher, BABEL, UPMLayered Coding Rule Definition and Enforcing Using LLVM
Abstract: Coding rules are used in industry to enforce good software practices that improve software reliability and maintainabili...
Tuesday, April 12, 2011
Pierre Ganty, Assistant Research Professor, IMDEA Software InstitutePetri-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...
Tuesday, April 5, 2011
Cesar Sanchez, Assistant Research Professor, IMDEA Software InstituteEfficient Complementation of Alternating Parity Automata (or why strong alternating automata is not that expensive)
Abstract: The automata-theoretic approach to model checking reduces a model checking problem to automata constructions and automat...
Tuesday, March 29, 2011
Juan Caballero, Assistant Research Professor, IMDEA Software InstituteDifferential 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 ...
Tuesday, March 22, 2011
Alexander Malkis, Post-doctoral Researcher, IMDEA Software InstituteA Practical Generic Privacy Language
Abstract: We present a declarative language with a formal semantics for specifying both users’ privacy preferences and servi...
Tuesday, March 15, 2011
Laurent Mauborgne, Researcher, IMDEA Software InstituteSolvers, Theories, and Static Analysis
Abstract: Recent progress in solvers modulo theories reach a point where it seems feasible to perform automatic static analysis of...
Wednesday, March 9, 2011
Alexey Gotsman, Assistant Research Professor, IMDEA Software InstituteModular 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, ArgentinaEfficient 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...
Thursday, January 20, 2011
Tomas Poch, Research Intern, IMDEA Software InstitutePattern-based verification of concurrent program
Abstract: Reachability of a program location in the concurrent program is an undecidable problem. The pattern based verification i...