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...
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
The Fluent Calculus has largely been focused on building agents that work individually. However, agents often need to interact with each other to learn more about their environmen...
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...
Model transformations support a model-driven design by providing an c translation of abstract models into more concrete ones, and eventually program code. Crucial to a successful a...
Gregor Engels, Anneke Kleppe, Arend Rensink, Maria...