2 results
Radu Grigore ; Nikos Tzevelekos.
Programs with dynamic allocation are able to create and use an unbounded number of fresh resources, such as references, objects, files, etc. We propose History-Register Automata (HRA), a new automata-theoretic formalism for modelling such programs. HRAs extend the expressiveness of previous […]
Published on March 29, 2016
Andrzej S. Murawski ; Nikos Tzevelekos.
We study the semantic meaning of block structure using game semantics. To that end, we introduce the notion of block-innocent strategies and characterise call-by-value computation with block-allocated storage through soundness, finite definability and universality results. This puts us in a good […]
Published on April 27, 2017