no code implementations • 15 Mar 2017 • Alejandro Aguirre, Gilles Barthe, Marco Gaboardi, Deepak Garg, Pierre-Yves Strub
Relational program verification can be used for reasoning about a broad range of properties, including equivalence and refinement, and specialized notions such as continuity, information flow security or relative cost.
Programming Languages
1 code implementation • 13 Feb 2015 • Gilles Barthe, Marco Gaboardi, Emilio Jesús Gallego Arias, Justin Hsu, Aaron Roth, Pierre-Yves Strub
To address both concerns, we explore techniques from computer-aided verification to construct formal proofs of incentive properties.
Computer Science and Game Theory Logic in Computer Science
1 code implementation • 25 Jul 2014 • Gilles Barthe, Marco Gaboardi, Emilio Jesús Gallego Arias, Justin Hsu, Aaron Roth, Pierre-Yves Strub
Unlike typical programmatic properties, it is not sufficient for algorithms to merely satisfy the property---incentive properties are only useful if the strategic agents also believe this fact.
Programming Languages Computer Science and Game Theory
