jSpin is a graphical user interface for the Spin model checker that is used for verifying concurrent and distributed programs. The user interface of jSpin is simple and consists of a single window with menus, a toolbar and three adjustable text areas. Spin option strings are automatically supplied and the Spin output is filtered and presented in a tabular form. All aspects of jSpin are configurable: some at compile time, some at initialization through a configuration file and some at runtime.

References in zbMATH (referenced in 17 articles )

Showing results 1 to 17 of 17.
Sorted by year (citations)

  1. Cooper, James; Nicolescu, Radu: Alternative representations of P systems solutions to the graph colouring problem (2019)
  2. Clarke, Edmund M.; Henzinger, Thomas A.; Veith, Helmut: Introduction to model checking (2018)
  3. Figueira, Diego; Libkin, Leonid: Synchronizing relations on words (2015)
  4. Park, Heejong; Malik, Avinash; Salcic, Zoran: Compiling and verifying SC-SystemJ programs for safety-critical reactive systems (2015)
  5. Gheorghe, Marian; Ipate, Florentin; Lefticaru, Raluca; Pérez-Jiménez, Mario J.; Ţurcanu, Adrian; Cabrera, Luis Valencia; García-Quismondo, Manuel; Mierlă, Laurenţiu: 3-Col problem modelling using simple kernel P systems (2013)
  6. Rauf, Usman; Sameen, Sheema; Cerone, Antonio: Formal analysis of oscillatory behaviors in biological regulatory networks: an alternative approach (2013)
  7. Ipate, Florentin; Lefticaru, Raluca; Pérez-Hurtado, Ignacio; Pérez-Jiménez, Mario J.; Tudose, Cristina: Formal verification of P systems with active membranes through model checking (2012)
  8. Ipate, Florentin; Lefticaru, Raluca; Tudose, Cristina: Formal verification of P systems using Spin (2011)
  9. Leuschel, Michael; Bendisposto, Jens: Directed model checking for B: an evaluation and new techniques (2011)
  10. Ma, Ji; Orgun, Mehmet A.; Adi, Kamel: An analytic tableau calculus for a temporalised belief logic (2011)
  11. van Gastel, Bernard; Lensink, Leonard; Smetsers, Sjaak; van Eekelen, Marko: Deadlock and starvation free reentrant readers-writers: a case study combining model checking with theorem proving (2011)
  12. Aravind, Alex A.: Highly-fair bakery algorithm using symmetric tokens (2010)
  13. Leuschel, Michael; Massart, Thierry: Efficient approximate verification of B and Z models via symmetry markers (2010)
  14. Wolter, Christian; Meinel, Christoph: An approach to capture authorisation requirements in business processes (2010) ioport
  15. Armoni, Michal; Ben-Ari, Mordechai: The concept of nondeterminism: Its development and implications for teaching (2009) MathEduc
  16. Kühnrich, Morten: Formal model-driven design of distributed algorithms (2009)
  17. Ben-Ari, Mordechai: Principles of the SPIN model checker. Foreword by Gerard J. Holzmann (2008)