Concept
Runtime verification
Publications associées (87)
Formal Verification of Rust with Stainless
Writing correct software is hard, yet in systems that have a high failure cost or are not easily upgraded like blockchains, bugs and security problems cannot be tolerated. Therefore, these systems are perfect use cases for formal verification, the task of ...
2021A non-twisting flux tube for local gyrokinetic simulations
Stephan Brunner, Justin Richard Ball
Local gyrokinetic simulations use a field-aligned domain that twists due to the magnetic shear of the background magnetic equilibrium. However, if the magnetic shear is strong and/or the domain is long, the twist can become so extreme that it fails to prop ...
2021Convergence of adaptive algorithms for constrained weakly convex optimization
Volkan Cevher, Ahmet Alacaoglu, Yurii Malitskyi
We analyze the adaptive first order algorithm AMSGrad, for solving a constrained stochastic optimization problem with a weakly convex objective. We prove the rate of convergence for the squared norm of the gradient of Moreau envelope, ...
2021WOK: Statistical Program Slicing in Production
James Richard Larus, Bogdan-Alexandru Stoica
Dynamic program slicing can significantly reduce the amount of code developers need to inspect by focusing only on program statements relevant to their investigation. However, this technique is still not ready for production-level use either in terms of ru ...
IEEE2019The AKLT Model on a Hexagonal Chain is Gapped
In 1987, Affleck, Kennedy, Lieb, and Tasaki introduced the AKLT spin chain and proved that it has a spectral gap above the ground state. Their concurrent conjecture that the two-dimensional AKLT model on the hexagonal lattice is also gapped remains open. I ...
2019Efficient Verifiable Delay Functions
Benjamin Pierre Charles Wesolowski
We construct a verifiable delay function (VDF). A VDF is a function whose evaluation requires running a given number of sequential steps, yet the result can be efficiently verified. They have applications in decentralised systems, such as the generation of ...
SPRINGER INTERNATIONAL PUBLISHING AG2019SAT Based Exact Synthesis using DAG Topology Families
Giovanni De Micheli, Mathias Soeken, Winston Jason Haaswijk
SAT based exact synthesis is a powerful technique, with applications in logic optimization, technology mapping, and synthesis for emerging technologies. However, its runtime behavior can be unpredictable and slow. In this paper, we propose to add a new typ ...
IEEE2018Initialization patterns in Dotty
Safe object initialization is important to avoid a category of runtime errors in programming languages. In this paper, we provide a case study of the initialization patterns on the Dotty compiler. In particular, we find that calling dynamic-dispatching met ...
2018