Abstract. Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the ...
Daniel Kroening, Natasha Sharygina, Aliaksei Tsito...
The Glasgow Haskell Compiler (GHC) has quite sophisticated support for concurrency in its runtime system, which is written in lowlevel C code. As GHC evolves, the runtime system b...
Peng Li, Simon Marlow, Simon L. Peyton Jones, Andr...
In this paper, we propose FLUXO, a system that separates an Internet service's logical functionality from the architectural decisions made to support performance, scalability...
Emre Kiciman, V. Benjamin Livshits, Madanlal Musuv...
In recent years, separation logic has emerged as a contender for formal reasoning of heap-manipulating imperative programs. Recent works have focused on specialised provers that a...
Wei-Ngan Chin, Cristina David, Huu Hai Nguyen, She...
Abstract. Model verification examines the correctness of a model implementation with respect to a model specification. While being described from model specification, implementatio...