Iniciativa IMDEA
Resumen: Reasoning about hyperproperties of concurrent implementations, such as the guarantees these implementations provide to r...
Resumen: Byzantine agreement, a fundamental problem in distributed computing, enables $N$ processes to reach consensus on a commo...
Resumen: In the zoo of programming languages there are two cute yet rather misbehaved animals, typically found in the Dynamic Lan...
Resumen: Many blockchain networks aim to preserve the anonymity of validators in the peer-to-peer (P2P) network, ensuring that no...
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...
