We present a unifying solution to the problem of fusion of functions, where both the producer function and the consumer function have one accumulating parameter. The key idea in t...
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
How-To queries answer fundamental data analysis questions of the form: “How should the input change in order to achieve the desired output”. As a Reverse Data Management probl...
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
Bitwise operations are commonly used in low-level systems code to access multiple data fields that have been packed into a single word. Program analysis tools that reason about s...