Higher-order ghost state

DOI10.1145/2951913.2951943zbMath1361.68066MaRDI QIDQ2985775

Derek R. Dreyer, Ralf Jung, Robbert Krebbers, Lars Birkedal

Publication date: 10 May 2017

Published in: Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-002D-067F-8

zbMATH Keywords

higher-order logic; compositional verification; separation logic; interactive theorem proving; fine-grained concurrency

Mathematics Subject Classification ID

68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)

68N18: Functional programming and lambda calculus

03B70: Logic in computer science

68Q60: Specification and verification (program logics, model checking, etc.)

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Related Items

Iris from the ground up: A modular foundation for higher-order concurrent separation logic, Unnamed Item, Unnamed Item, Linear capabilities for fully abstract compilation of separation-logic-verified code, Aneris: A Mechanised Logic for Modular Reasoning about Distributed Systems, Connecting Higher-Order Separation Logic to a First-Order Outside World, An algebraic glimpse at bunched implications and separation logic, Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits, Ghost signals: verifying termination of busy waiting, On models of higher-order separation logic, The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types, The Essence of Higher-Order Concurrent Separation Logic, A Higher-Order Logic for Concurrent Termination-Preserving Refinement

Uses Software

• Coq