Iniciativa IMDEA
Resumen: Prolog is an expressive declarative language, and it is the ideal language for learning from structured and complex data...
Resumen: Fine-grained concurrent data structures (or FCDs) reduce the granularity of critical sections in both time and space, th...
Resumen: Microsoft research connecting to Labs and Academia
Resumen: Modern software systems are built by composing components drawn from large repositories, whose size and complexity is in...
Resumen: Interaction of embedded systems with their physical environment often imposes timing constraints on the embedded system...
Resumen: The field of Constraint Programming (CP) is concerned with solving combinatorial optimisation problems, and the associat...
Resumen: Combinatorial explosion of protein states generated by post-translational modifications and complex formation. Rule-base...
Resumen: Research on certifying information flow security for sequential programs has made much progress over the last fifteen ye...
Resumen: Noninterference security (due to Goguen and Meseguer) considers breaches that result from the -interference- that hidden...
Resumen: In this talk we discuss several recent results about min-entropy leakage. We first briefly recall the definitions of min...
Resumen: There is an increasing interest in understanding and analyzing the use of resources in software and hardware systems. Ce...
Resumen: This talk introduces g-leakage, a rich generalization of the min-entropy model of quantitative information flow. In g-le...
Resumen: Effective static analyses must precisely approximate both heap structure and information about values. During the last d...
Resumen: Many useful programming constructions can be expressed as monads. Examples include probabilistic modeling, functional re...
Resumen: Disjointness between resources is an extraordinarily useful property when verifying concurrent programs. Threads that ac...
Resumen: Natural languages like English are rich, complex, and powerful. The highly creative and graceful use of languages like E...
Resumen: Writing correct software is difficult; writing reliable numerical software involving floating-point numbers is even more...
Resumen: Software developers primarily rely on experience and intuition to make development decisions. I will describe speculativ...
Resumen: We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both decl...
Resumen: In the last two decades, program verification and testing have gone a long way from a concept to practical tools which c...
Resumen: Scholz posed in 1952 the problem of characterising the class of spectra (of formulas in first-order logic with equality)...
Resumen: Self-adjusting computation is a language-based approach to writing incremental programs that respond dynamically to inpu...
Resumen: Many interesting program transformations (by Burstall-Darlington, Bird, Pettorossi, and many others) have been published...
Resumen: Most analysis methods for information flow properties, such as noninterference, do not consider temporal restrictions. I...
Resumen: From a programming perspective, Alan Turing’s epochal 1936 paper on computable functions introduced several new co...
Resumen: How to construct a general program obfuscator? We present a novel approach to automatically generating obfuscated code P...
Resumen: Quick overview of: Interpreters, Compilers, and Program Specialisers The Futamura projections (Futamura stated them; 13 ...
