---
title: "10-gomela-go-to-promela-spin"
description: "Computer Science Programming Languages arXiv:2004.01323 (cs) Title:Bounded verification of message-passing concurrency in Go using Promela and Spin Authors:Nicolas Dilley (University of Kent), Julie…"
doc_version: 1
last_updated: 2026-10-17
canonical_url: "http://parc.yolo.scapegoat.dev/note/research/software-architecture-garden/sessionstream/designs/research/sources/10-gomela-go-to-promela-spin"
---

# 10-gomela-go-to-promela-spin

Computer Science > Programming Languages arXiv:2004.01323 (cs) Title:Bounded verification of message-passing concurrency in Go using Promela and Spin Authors:Nicolas Dilley (University of Kent), Julie…

## Content

## Computer Science > Programming Languages

**arXiv:2004.01323** (cs)

## Title:Bounded verification of message-passing concurrency in Go using Promela and Spin

Authors:[Nicolas Dilley](https://arxiv.org/search/cs?searchtype=author&query=Dilley,+N) (University of Kent), [Julien Lange](https://arxiv.org/search/cs?searchtype=author&query=Lange,+J) (University of Kent)

[View PDF](https://arxiv.org/pdf/2004.01323)

> Abstract:This paper describes a static verification framework for the message-passing fragment of the Go programming language. Our framework extracts models that over-approximate the message-passing behaviour of a program. These models, or behavioural types, are encoded in Promela, hence can be efficiently verified with Spin. We improve on previous works by verifying programs that include communication-related parameters that are unknown at compile-time, i.e., programs that spawn a parameterised number of threads or that create channels with a parameterised capacity. These programs are checked via a bounded verification approach with bounds provided by the user.

| Comments: | In Proceedings PLACES 2020, [arXiv:2004.01062](https://arxiv.org/abs/2004.01062) |
| --- | --- |
| Subjects: | Programming Languages (cs.PL); Software Engineering (cs.SE) |
| Cite as: | [arXiv:2004.01323](https://arxiv.org/abs/2004.01323) $$cs.PL$$ |
|  | (or [arXiv:2004.01323v1](https://arxiv.org/abs/2004.01323v1) $$cs.PL$$ for this version) |
|  | [https://doi.org/10.48550/arXiv.2004.01323](https://doi.org/10.48550/arXiv.2004.01323)  arXiv-issued DOI via DataCite |
| Journal reference: | EPTCS 314, 2020, pp. 34-45 |
| Related DOI: | [https://doi.org/10.4204/EPTCS.314.4](https://doi.org/10.4204/EPTCS.314.4) |

## Submission history

From: EPTCS $$[view email](https://arxiv.org/show-email/e4bee5b5/2004.01323)$$ $$via EPTCS proxy$$
**$$v1$$** Fri, 3 Apr 2020 01:25:46 UTC (85 KB)

## Bibliographic and Citation Tools

Bibliographic Explorer *([What is the Explorer?](https://info.arxiv.org/labs/showcase.html#arxiv-bibliographic-explorer))*

Connected Papers *([What is Connected Papers?](https://www.connectedpapers.com/about))*

Litmaps *([What is Litmaps?](https://www.litmaps.co/))*

scite Smart Citations *([What are Smart Citations?](https://www.scite.ai/))*

## Code, Data and Media Associated with this Article

alphaXiv *([What is alphaXiv?](https://alphaxiv.org/))*

CatalyzeX Code Finder for Papers *([What is CatalyzeX?](https://www.catalyzex.com/))*

DagsHub *([What is DagsHub?](https://dagshub.com/))*

Gotit.pub *([What is GotitPub?](http://gotit.pub/faq))*

Hugging Face *([What is Huggingface?](https://huggingface.co/huggingface))*

ScienceCast *([What is ScienceCast?](https://sciencecast.org/welcome))*

## Demos

Replicate *([What is Replicate?](https://replicate.com/docs/arxiv/about))*

Hugging Face Spaces *([What is Spaces?](https://huggingface.co/docs/hub/spaces))*

TXYZ.AI *([What is TXYZ.AI?](https://txyz.ai/))*

## Recommenders and Search Tools

Influence Flower *([What are Influence Flowers?](https://influencemap.cmlab.dev/))*

CORE Recommender *([What is CORE?](https://core.ac.uk/services/recommender))*

## arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? [**Learn more about arXivLabs**](https://info.arxiv.org/labs/index.html).

[Which authors of this paper are endorsers?](https://arxiv.org/auth/show-endorsers/2004.01323) | Disable MathJax ([What is MathJax?](https://info.arxiv.org/help/mathjax.html))

## Backlinks

- [research/software-architecture-garden/sessionstream/designs/research/02-constraining-the-go-binary-layered-refinement-from-proved-kernels-to-executables](http://parc.yolo.scapegoat.dev/note/research/software-architecture-garden/sessionstream/designs/research/02-constraining-the-go-binary-layered-refinement-from-proved-kernels-to-executables)

## Sitemap

- [Home](http://parc.yolo.scapegoat.dev/)
- [Home markdown mirror](http://parc.yolo.scapegoat.dev/index.md)
- [Markdown sitemap](http://parc.yolo.scapegoat.dev/sitemap.md)