Graves-CPA: A Graph-Attention Verifier Selector (Competition Contribution)
Will Leeson, Matthew B. Dwyer
Abstract
Abstract Graves-CPA is a verification tool which uses algorithm selection to decide an ordering of underlying verifiers to most effectively verify a given program. Graves-CPA represents programs using an amalgam of traditional program graph representations and uses state-of-the-art graph neural network techniques to dynamically decide how to run a set of verification techniques. The Graves technique is implementation agnostic, but it’s competition submission, Graves-CPA , is built using several CPAchecker configurations as its underlying verifiers.
Topics & Concepts
Computer scienceGraphSet (abstract data type)Competition (biology)Theoretical computer scienceProgramming languageEcologyBiologySoftware Testing and Debugging TechniquesFormal Methods in VerificationAdversarial Robustness in Machine Learning