Iniciativa IMDEA
Resumen: State-of-the-art solvers for constrained Horn clauses (CHC) are successfully used to generate reachability facts for sof...
Resumen: The FIDE Laws of Chess establish that if a player runs out of time during a game, they lose unless there exists no seque...
Resumen: Petri nets (PN) are a popular formalism to represent concurrent systems. However, they lack support for modelling and an...
Resumen: Indirect surveys have been used for decades by epidemiologists and social scientists to estimate the size of sub-populat...
Resumen: This talk starts with a result in classical Finite Automata Theory: Two regular languages with the same number of words ...
Resumen: Not many results in Computer Science are recognised to be as basic and fundamental as Kleene Theorem. It states the equa...
Resumen: Virtually all computer programs are written in high-level languages. A suitable source language can impose certain desir...
Resumen: SMT (Satisfiability Modulo Theories) solving is a technology for the fully automated solution of logical formulas. SMT s...
Resumen: Unsafe languages, like C and C++, have long been the preferred choice for systems programming thanks to their unique fea...
Resumen: Dynamically typed array languages such as Python, APL, and Matlab lift scalar operations to arrays and replicate scalars...
Resumen: Traitor-tracing systems allow identifying the users who contributed to building a rogue decoder in a broadcast environme...
Resumen: The recent years have seen remarkable progress in establishing the complexity of the reachability problem for vector add...
Resumen: The problem of Byzantine consensus has been key to designing secure distributed systems. Although it is well known that ...
Resumen: Approximate fully homomorphic encryption (FHE) schemes such as the CKKS scheme (Asiacrypt ’17) are popular in practice d...
Resumen: In this talk I will present the work I have done concerning the specification and analysis of normative documents using ...
Resumen: This talk will show some of the recent advances we are doing at Microsoft Research towards agents capable of modeling co...
Resumen: Recent years have been pivotal in the field of Industrial Control Systems (ICS) security, with a large number of high-pr...
Resumen: Adversaries exploit vulnerabilities to compromise systems. For instance, a vulnerability in a Web browser sandbox may al...
Resumen: Cyber-physical systems (CPS) are now ubiquitous among automated technologies, in which physical dynamical systems are op...
Resumen: Many security mitigation techniques rely on program analysis. Languages such as C/C++ support the use of pointers for in...
Resumen: We live in an era of unprecedented compute availability. The advent of the cloud allows anyone to deploy critical high-p...
Resumen: Indistinguishability obfuscation turns a program unintelligible without altering its functionality. Because it captures ...
Resumen: This talk will go over the basics of the PageRank problem, studied initially by the founders of Google, which allowed th...
Resumen: A strong argument in favour of dynamically-typed programming languages is their flexibility, enabling quick code writing...
