Using Mutations to Analyze Formal Specifications
Wed 7 Dec 2022 18:45 - 19:00 at AMRF Auditorium - SRC Talks
The result of a formal verification is only as good as the specifications. A key challenge in automated verification is therefore coming up with a strong specification. This is somewhat analogous to having a good test suite in software testing. A well-studied technique for improving and assessing a test suite is mutation testing. It is a method for systematically modifying the source code to determine whether the resulting “mutants” can be “caught” by the tests. This paper explores mutation verification, i.e., the use of mutations to strengthen and assess the quality of formal specifications used in a verification tool. We built a prototype for mutation verification—dubbed Gambit—and used it for an industrial tool that verifies smart contracts. Early results indicate that Gambit generates useful mutants that can provide valuable insights about the coverage of the specifications.
Mon 5 DecDisplayed time zone: Auckland, Wellington change
18:00 - 20:00 | SPLASH PostersStudent Research Competition / Posters at Atrium Chair(s): Xujie Si McGill University, Canada, Caterina Urban Inria & École Normale Supérieure | Université PSL | ||
18:00 2hPoster | Simple Extensible Programming through Precisely-Typed Open Recursion Student Research Competition Andong Fan Hong Kong University of Science and Technology DOI | ||
18:00 2hPoster | CodeSpider: Automatic Code Querying with Multi-modal Conjunctive Query Synthesis Student Research Competition Chengpeng Wang Hong Kong University of Science and Technology DOI | ||
18:00 2hPoster | LoRe: Local-First Reactive Programming with Verified Safety Guarantees Student Research Competition Julian Haas TU Darmstadt DOI | ||
18:00 2hPoster | Qiwi: A Beginner Friendly Quantum Language Student Research Competition DOI | ||
18:00 2hPoster | Provably Correct Smart Contracts: An Approach using DeepSEA Posters DOI | ||
18:00 2hPoster | Tower: Data Structures in Quantum Superposition Posters Charles Yuan Massachusetts Institute of Technology, Michael Carbin Massachusetts Institute of Technology | ||
18:00 2hPoster | Using Mutations to Analyze Formal Specifications Student Research Competition Siraphob Phipathananunth Vanderbilt University DOI | ||
18:00 2hPoster | Competitive Debugging: Toward Contests Promoting Debugging as a Skill Posters Patrick Rein University of Potsdam; Hasso Plattner Institute, Tom Beckmann University of Potsdam; Hasso Plattner Institute, Leonard Geier University of Potsdam; Hasso Plattner Institute, Toni Mattis University of Potsdam; Hasso Plattner Institute, Robert Hirschfeld University of Potsdam; Hasso Plattner Institute | ||
18:00 2hPoster | Foundationally Sound Annotation Verifier via Control Flow Splitting Student Research Competition Litao Zhou Shanghai Jiao Tong University DOI | ||
18:00 2hPoster | Semi-symbolic Inference for Efficient Streaming Probabilistic Programming Posters Eric Atkinson Massachusetts Institute of Technology, Charles Yuan Massachusetts Institute of Technology, Guillaume Baudart Inria, Louis Mandel IBM Research, Michael Carbin Massachusetts Institute of Technology | ||
18:00 2hPoster | A Study of the Impact of Callbacks in Staged Static+Dynamic Partial Analysis Student Research Competition Aditya Anand IIT Mandi DOI | ||
18:00 2hPoster | Multiverse Notebook: A Notebook Environment for Safe and Efficient Exploration Posters DOI | ||
18:00 2hPoster | Katara: Synthesizing CRDTs with Verified Lifting Posters Shadaj Laddad University of California at Berkeley, Conor Power University of California at Berkeley, Mae Milano University of California at Berkeley, Alvin Cheung University of California at Berkeley, Joseph M. Hellerstein University of California at Berkeley | ||
18:00 2hPoster | Explicit Code Reuse Recommendation Posters DOI | ||
18:00 2hPoster | Automated Verification for Real-Time Systems using Implicit Clocks and an Extended Antimirov Algorithm Student Research Competition DOI | ||
18:00 2hPoster | Composing Linear Types and Separation Logic Proofs of Memory Safety Posters Pilar Selene Linares Arévalo University of Melbourne DOI | ||
18:00 2hPoster | ARENA: Enhancing Abstract Refinement for Neural Network Verification Student Research Competition Yuyi Zhong National University of Singapore, Quang-Trung Ta National University of Singapore, Siau-Cheng Khoo National University of Singapore DOI | ||
18:00 2hPoster | Termination of Recursive Functions by Lexicographic Orders of Linear Combinations Student Research Competition DOI |
Wed 7 DecDisplayed time zone: Auckland, Wellington change
This is the main atrium used for registration, posters, tea/coffee/lunches.