Type inference and strong static type checking for Promela
From MaRDI portal
Publication:988201
DOI10.1016/j.scico.2010.05.010zbMath1209.68080OpenAlexW2068086706MaRDI QIDQ988201
Simon J. Gay, Alastair F. Donaldson
Publication date: 26 August 2010
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2010.05.010
Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Feature interaction detection by pairwise analysis of LTL properties -- A case study
- Objects and session types
- An algebraic verification of a mobile network
- A theory of type polymorphism in programming
- A syntactic approach to type soundness
- Simplifying subtyping constraints: a theory
- Type error slicing in implicitly typed higher-order languages
- Simplified Reducibility Proofs of Church-Rosser for β- and βη-reduction
- A framework for type inference with subtyping
- The Principal Type-Scheme of an Object in Combinatory Logic