We present a novel model of concurrent computations with shared memory and provide a
simple, yet powerful, logical framework for uniform Hoarestyle reasoning about partial …

Designing efficient concurrent objects often requires abandoning the standard specification
technique of linearizability in favor of more relaxed correctness conditions. However, the …

Arguments about correctness of a concurrent data structure are typically carried out by using
the notion of linearizability and specifying the linearization points of the data structure's …

Concurrent separation logic is distinguished by transfer of state ownership upon parallel
composition and framing. The algebraic structure that underpins ownership transfer is that of …

In addition to pre- and postconditions, program specifications in recent separation logics for
concurrency have employed an algebraic structure of resources—a form of state transition …

Continuations are programming abstractions that allow for manipulating the "future" of a
computation. Amongst their many applications, they enable implementing unstructured program …

In functional programming one usually writes programs as the composition of simpler
functions. Consequently, the result of a function might be generated only to be consumed …

La correctitud del software, es decir, el problema de decidir a ciencia cierta que un algoritmo
o un programa es correcto antes de su ejecución, es una cuestión de larga data que …

Una práctica habitual en el paradigma de programación funcional es el uso de operadores
o esquemas de recursión para estructurar algoritmos. Éstos son funciones de alto orden que …

This artifact provides the full mechanization in FCSL of the developments in the companion
paper, "Concurrent Data Structures Linked in Time". In the latter, we propose a new method, …