Bounded verification of message-passing concurrency in Go using Promela and Spin
Open Access
- 3 April 2020
- journal article
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 314, 34-45
- https://doi.org/10.4204/eptcs.314.4
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- An Empirical Study of Messaging Passing Concurrency in Go ProjectsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2019
- Process-Local Static Analysis of Synchronous ProcessesPublished by Springer Science and Business Media LLC ,2018
- A static verification framework for message passing in Go using behavioural typesPublished by Association for Computing Machinery (ACM) ,2018
- Fencing off go: liveness and safety for channel-based programmingPublished by Association for Computing Machinery (ACM) ,2017
- Static deadlock detection for concurrent go by global session graph synthesisPublished by Association for Computing Machinery (ACM) ,2016
- From Communicating Machines to Graphical ChoreographiesPublished by Association for Computing Machinery (ACM) ,2015
- An Overview of the mCRL2 Toolset and Its Recent AdvancesLecture Notes in Computer Science, 2013
- Model checking JAVA programs using JAVA PathFinderInternational Journal on Software Tools for Technology Transfer, 2000
- Lectures on a calculus for communicating systemsLecture Notes in Computer Science, 1985
- On Communicating Finite-State MachinesJournal of the ACM, 1983