2 citations · 2 across the 2 of their papers we have counts for
3 papers
Random state comonads encode cellular automata evaluation
Madalina I Sas, Julian H J Sutherland
Cellular automata (CA) are quintessential ALife and ubiquitous in many studies of collective behaviour and emergence, from morphogenesis to social dynamics and even brain modelling…
Exact Separation Logic (Extended Version)
Petar Maksimović, Caroline Cronjäger, Andreas Lööw +2
Over-approximating (OX) program logics, such as separation logic (SL), are used for verifying properties of heap-manipulating programs: all terminating behaviour is characterised,…
TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs
Emanuele D'Osualdo, Azadeh Farzan, Philippa Gardner +1
We present TaDA Live, a concurrent separation logic for reasoning compositionally about the termination of blocking fine-grained concurrent programs. The crucial challenge is how t…