Results 21 to 30 of about 864 (171)
A multi-paradigm language for reactive synthesis [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 This paper proposes a language for describing reactive synthesis problems that integrates imperative and declarative elements. The semantics is defined in terms of two-player turn-based infinite games with full information.
Ioannis Filippidis +2 more
doaj +1 more source
Model Checking Embedded Systems with PROMELA [PDF]
12th IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS'05), 2005 The design process for embedded systems can benefit from the usage of formal methods, if some properties of the systems are checked, before design and implementation decisions are accomplished. This paper presents a model checking approach using the Spin tool, to verify some important properties of embedded systems, namely liveness, deadlock-freedom ...
Ribeiro, Óscar R. +2 more
openaire +2 more sources
SpinS:Extending LTSmin with Promela through SpinJa [PDF]
, 2012 We show how PROMELA can be supported by the high-performance generic model checking tools of LTSMIN. The success of the SPIN model checker has made PROMELA an important modeling language.
Laarman, Alfons +1 more
core +3 more sources
Model Checking Paxos in Spin [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We present a formal model of a distributed consensus algorithm in the executable specification language Promela extended with a new type of guards, called counting guards, needed to implement transitions that depend on majority voting. Our formalization
Giorgio Delzanno +2 more
doaj +1 more source
Distributed MAP in the SpinJa Model Checker [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Spin in Java (SpinJa) is an explicit state model checker for the Promela modelling language also used by the SPIN model checker. Designed to be extensible and reusable, the implementation of SpinJa follows a layered approach in which each new layer ...
Stefan Vijzelaar +3 more
doaj +1 more source
A Refinement Calculus for Promela [PDF]
2013 18th International Conference on Engineering of Complex Computer Systems, 2013 The use of formal methods for developing software is increasing. However in many cases only a model of the system is validated against a set of specifications. The actual implementation may thus not correspond to the formal model. One approach to this problem is to directly verify the actual implementation.
openaire +1 more source
From symbolic constraint automata to Promela
Journal of Logical and Algebraic Methods in Programming, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feng, H., Bonsangue, M.M., Lion, B.
openaire +4 more sources
Application of Coloured Petri Nets for Verification of Scenario Control Structures in UCM Notation
Моделирование и анализ информационных систем, 2016 This article presents a method for the analysis and verification of Use Case Maps (UCM) models with scenario control structures — protected components and failure handling constructs.
N. V. Vizovitin +2 more
doaj +1 more source
A Technique for Parameterized Verification of Cache Coherence Protocols
Труды Института системного программирования РАН, 2018 This paper introduces a technique for scalable functional verification of cache coherence protocols that is based on the verification method, which was previously developed by the author.
V. S. Burenkov
doaj +1 more source
Feature interaction detection by pairwise analysis of LTL properties—A case study [PDF]
, 2005 A Promela specification and a set of temporal properties are developed for a basic call service with a number of features. The properties are expressed in the logic LTL.
Calder, M. +3 more
core +1 more source