### Abstract

We present an executable formalization of the language Promela, the description language for models of the model checker SPIN. This formalization is part of the work for a completely verified model checker (CAVA), but also serves as a useful (and executable!) description of the semantics of the language itself, something that is currently missing. The formalization uses three steps: It takes an abstract syntax tree generated from an SML parser, removes syntactic sugar and enriches it with type information. This further gets translated into a transition system, on which the semantic engine (read: successor function) operates.

### License

BSD License

### Topics

- Computer science/System description languages

### Session Promela

- PromelaStatistics
- PromelaAST
- PromelaDatastructures
- PromelaInvariants
- Promela
- PromelaLTL
- PromelaLTLConv
- All_Of_Promela

### Depends on

- The CAVA Automata Library
- Linear Temporal Logic

### Used by

- A Fully Verified Executable LTL Model Checker

### Auto-related entries

- Labeled Transition Systems
- Transition Systems and Automata

## Cite

×

Promela-AFP

    @article{Promela-AFP,
      author  = {René Neumann},
      title   = {Promela Formalization},
      journal = {Archive of Formal Proofs},
      month   = {May},
      year    = {2014},
      note    = {\url{https://isa-afp.org/entries/Promela.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 20, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Aug 16, 2018 : Isabelle2018
- Oct 10, 2017 : Isabelle2017
- Dec 17, 2016 : Isabelle2016-1
- Feb 22, 2016 : Isabelle2016
- May 27, 2015 : Isabelle2015
- Aug 28, 2014 : Isabelle2014
- May 29, 2014 : Isabelle2013-2