A Revised and Verified Proof of the Scalable Commutativity Rule

09/23/2018
by   Lillian Tsai, et al.
0

This paper explains a flaw in the published proof of the Scalable Commutativity Rule (SCR), presents a revised and formally verified proof of the SCR in the Coq proof assistant, and discusses the insights and open questions raised from our experience proving the SCR.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/05/2018

Natural Deduction and the Isabelle Proof Assistant

We describe our Natural Deduction Assistant (NaDeA) and the interfaces b...
research
01/03/2022

Spreads and Packings of PG(3,2), Formally!

We study how to formalize in the Coq proof assistant the smallest projec...
research
06/04/2018

A fairer penalty shootout design in soccer

Penalty shootout in soccer is known to be unfair ex post: the team kicki...
research
08/26/2018

Rule Module Inheritance with Modification Restrictions

Adapting rule sets to different settings, yet avoiding uncontrolled prol...
research
11/27/2018

Counting Polynomial Roots in Isabelle/HOL: A Formal Proof of the Budan-Fourier Theorem

Many problems in computer algebra and numerical analysis can be reduced ...
research
10/17/2022

Holbert: Reading, Writing, Proving and Learning in the Browser

This paper presents Holbert: a work-in-progress pedagogical proof assist...
research
01/13/2021

On the Computational Properties of Obviously Strategy-Proof Mechanisms

We present a polynomial-time algorithm that determines, given some choic...

Please sign up or login with your details

Forgot password? Click here to reset