SPLASH 2022
Mon 5 - Sat 10 December 2022 Auckland, New Zealand
Sat 10 Dec 2022 14:00 - 14:30 at Seminar Room LG004 - PLDI and POPL Papers Chair(s): Joxan Jaffar

This paper shows that a variety of software model-checking algorithms can be seen as proof-search strategies for a non-standard proof system, known as a cyclic proof system. Our use of the cyclic proof system as a logical foundation of software model checking enables us to compare different algorithms, to reconstruct well-known algorithms from a few simple principles, and to obtain soundness proofs of algorithms for free. Among others, we show the significance of a heuristics based on a notion that we call maximal conservativity; this explains the cores of important algorithms such as property-directed reachability (PDR) and reveals a surprising connection to an efficient solver of games over infinite graphs that was not regarded as a kind of PDR.

Sat 10 Dec

Displayed time zone: Auckland, Wellington change

13:30 - 15:00
PLDI and POPL PapersCOVID Time Papers In Person at Seminar Room LG004
Chair(s): Joxan Jaffar National University of Singapore
13:30
30m
Talk
PMEvo: portable inference of port mappings for out-of-order processors by evolutionary optimization
COVID Time Papers In Person
Fabian Ritter Saarland University, Germany, Sebastian Hack Saarland University, Germany
Link to publication DOI
14:00
30m
Talk
Software Model-Checking as Cyclic-Proof Search
COVID Time Papers In Person
Takeshi Tsukada Chiba University, Hiroshi Unno University of Tsukuba; RIKEN AIP
Link to publication DOI
14:30
30m
Talk
SolType: Refinement Types for Arithmetic Overflow in Solidity
COVID Time Papers In Person
Bryan Tan , Benjamin Mariano The University of Texas at Austin, Texas, USA, Shuvendu K. Lahiri Microsoft Research, Işıl Dillig University of Texas at Austin, Yu Feng University of California at Santa Barbara
Link to publication DOI