Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy
From MaRDI portal
Publication:2819789
DOI10.1145/2676726.2677000zbMath1346.68058arXiv1407.6845OpenAlexW3106186972MaRDI QIDQ2819789
Gilles Barthe, Justin Hsu, Aaron Roth, Marco Gaboardi, Emilio Jesús Gallego Arias, Pierre-Yves Strub
Publication date: 29 September 2016
Published in: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.6845
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Product programs and relational program logics, Model checking differentially private properties, Computer-Aided Verification for Mechanism Design, Divergences on monads for relational program logics, Is Your Software on Dope?, A general semantic construction of dependent refinement type systems, categorically, Graded Hoare logic and its categorical semantics, Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs, Relational cost analysis in a functional-imperative setting
