POPL 2027
Sun 10 - Sat 16 January 2027 Mexico City, Mexico

Lantana is a higher-order impredicative concurrent separation logic for proving liveness properties of concurrent programs, which allows for modular liveness and safety proofs: e.g., a developer can prove liveness properties of a library or application based on the specifications of the underlying functions that the library or application invokes. The key idea in Lantana is to decouple liveness \emph{obligations} from threads. An obligation, the mechanism for establishing a liveness property, rides on a \emph{carrier}, a thread-local budget of fuel that every step of the thread burns, and an obligation can move to the carriers of other threads. Among other benefits, this allows Lantana to support transfers of obligations between threads, while the accounting of each thread’s steps stays local. To demonstrate the benefits of Lantana, we use it to prove the safety and liveness of a concurrent reentrant task queue, a common building block for concurrent programs, as well as a client submitting a reentrant task to this task queue library; Lantana is the first logic that supports modular verification of this example. Lantana is mechanized in Rocq on top of Transfinite Iris, and comes with a generic soundness theorem that lifts always'' anduntil'' separation-logic predicates to trace-level temporal properties.