Skip to search formSkip to main contentSkip to account menu

Promela

PROMELA is a process modeling language whose intended use is to verify the logic of parallel systems. Given a program in PROMELA, Spin can verify the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Concurrency (computer science)Formal verificationGuard (computer science)Guarded Command Language

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
EventCJ: a context-oriented programming language with declarative event-based context transition
This paper proposes EventCJ, a context-oriented programming (COP) language that can modularly control layer activation based on… 
Highly Cited
2010
Highly Cited
2010
Service Research Challenges and Solutions for the Future Internet
In this age of modern era, the use of internet must be maximized. Yeah, internet will help us very much not only for important… 
Highly Cited
2008
Highly Cited
2008
A decision procedure for propositional projection temporal logic with infinite models
This paper investigates the satisfiability of Propositional Projection Temporal Logic (PPTL) with infinite models. A decision… 
2008
2008
Automatic Symmetry Detection for Promela
We introduce a specification language, Promela-Lite, which captures the essential features of Promela but which, unlike Promela… 
Highly Cited
2005
Highly Cited
2005
Towards a Formal Verification of OWL-S Process Models
In this paper, we apply automatic tools to the verification of interaction protocols of Web services described in OWL-S… 
2004
2004
An Automatic Translation of CSP to Handel-C
We present tools that convert a subset of CSP into Handel-C code. Handel-C was derived from the original occam concurrency… 
Highly Cited
2000
Highly Cited
2000
Logic Verification of ANSI-C Code with SPIN
We describe a tool, called AX, that can be used in combination with the model checker Spin to efficiently verify logical… 
Highly Cited
1998
Highly Cited
1998
Implementing statecharts in PROMELA/SPIN
We translate statecharts into PROMELA, the input language of the SPIN verification system, using extended hierarchical automata… 
1998
1998
On the Stubborn Set Method in Reduced State Space Generation
Reachability analysis is a powerful formal method for analysis of concurrent and distributed nite state systems. It suuers from… 
Highly Cited
1997
Highly Cited
1997
On formal semantics of statecharts as supported by STATEMATE
We formalize the rigorous but informal description of the semantics of statecharts given by Harel and Naamad in [3] which… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)