6 citations · 16 across the 7 of their papers we have counts for
8 papers
Safe asynchronous mixed-choice for timed interactions
Jonah Pears, Laura Bocchi, Andy King
Mixed-choice has long been barred from models of asynchronous communication since it compromises key properties of communicating finite-state machines. Session types inherit this r…
Backjumping is Exception Handling
Ed Robbins, Andy King, Jacob M. Howe
ISO Prolog provides catch and throw to realise the control flow of exception handling. This pearl demonstrates that catch and throw are inconspicuously amenable to the implementati…
Incrementally Closing Octagons
Aziem Chawdhary, Ed Robbins, Andy King
The octagon abstract domain is a widely used numeric abstract domain expressing relational information between variables whilst being both computationally efficient and simple to i…
Transfer Function Synthesis without Quantifier Elimination
Jörg Brauer, Andy King
Traditionally, transfer functions have been designed manually for each operation in a program, instruction by instruction. In such a setting, a transfer function describes the sema…
RedAlert: Determinacy Inference for Prolog
Jael Kriener, Andy King
This paper revisits the problem of determinacy inference addressing the problem of how to uniformly handle cut. To this end a new semantics is introduced for cut, which is abstract…
Convex Hull of Planar H-Polyhedra
Axel Simon, Andy King
Suppose are planar (convex) H-polyhedra, that is, and . Let $P_i = \{\vec{x} \in \mathbb{R}^2…