Gobra: Modular Specification and Verification of Go Programs
Open Access
- 15 July 2021
- book chapter
- Published by Springer Nature
- p. 367-379
Abstract
Go is an increasingly-popular systems programming language targeting, especially, concurrent and distributed systems. Go differentiates itself from other imperative languages by offering structural subtyping and lightweight concurrency through goroutines with message-passing communication. This combination of features poses interesting challenges for static verification, most prominently the combination of a mutable heap and advanced concurrency primitives.We present Gobra, a modular, deductive program verifier for Go that proves memory safety, crash safety, data-race freedom, and user-provided specifications. Gobra is based on separation logic and supports a large subset of Go. Its implementation translates an annotated Go program into the Viper intermediate verification language and uses an existing SMT-based verification backend to compute and discharge proof obligations.Keywords
This publication has 18 references indexed in Scilit:
- Fencing off go: liveness and safety for channel-based programmingACM SIGPLAN Notices, 2017
- Foundations of Session Types and Behavioural ContractsACM Computing Surveys, 2016
- Viper: A Verification Infrastructure for Permission-Based Reasoning2015
- The VerCors Tool for Verification of Concurrent Programs2014
- An Overview of the mCRL2 Toolset and Its Recent Advances2013
- Proving Copyless Message Passing2009
- Z3: An Efficient SMT Solver2008
- Separation logic and abstractionACM SIGPLAN Notices, 2005
- Checking Interference with Fractional Permissions2003
- A behavioral notion of subtypingACM Transactions on Programming Languages and Systems, 1994