{"title":"The application of Promela and Spin in the BOS project","authors":"P. Kars","doi":"10.1090/dimacs/032/05","DOIUrl":"https://doi.org/10.1090/dimacs/032/05","url":null,"abstract":"After a short introduction to the BOS project, we discuss the why, what and how\" of the use of formal methods in the project, some recent experience using Promela/Spin and re ections on the pragmatics of validation.","PeriodicalId":347523,"journal":{"name":"The Spin Verification System","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123632073","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Modelling and analysis of a collision avoidance protocol using Spin and Uppaal","authors":"H. Jensen, K. Larsen, A. Skou","doi":"10.1090/dimacs/032/04","DOIUrl":"https://doi.org/10.1090/dimacs/032/04","url":null,"abstract":"This paper compares the tools SPIN and UPPAAL by modelling and verifying a Collision Avoidance Protocol for an Ethernet-like medium. We find that SPIN is well suited for modelling the untimed aspects of the protocol processes and for expressing the relevant (untimed) properties. However, the modelling of the media becomes awkward due to the lack of broadcast communication in the PROMELA language. On the other hand we find it easy to model the timed aspects using the UPPAAL tool. Especially, the notion of committed locations supports the modelling of broadcast communication. However, the property language of UPPAAL lacks some expressivity for verification of bounded liveness properties, and we indicate how timed testing automata may be constructed for such properties, inspired by the (untimed) checking automata of SPIN.","PeriodicalId":347523,"journal":{"name":"The Spin Verification System","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134601833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Implementing and verifying MSC specifications using Promela/XSpin","authors":"S. Leue, P. Ladkin","doi":"10.1090/dimacs/032/06","DOIUrl":"https://doi.org/10.1090/dimacs/032/06","url":null,"abstract":"We discuss a translation of Message Sequence Charts (MSCs) into the language PROMELA (we call this translation anìmplementation') that is consistent with the formal semantics we have previously deened for Message Flow Graphs and Message Sequence Charts, which handled the syntactic features with mathematical import from ITU-T recommendation Z.120. We report on experiments executing the PROMELA code using the XSPIN sim-ulator and validator. In previous work we found that potential process divergence and non-local choice situations impose problems on implementations of MSCs, and we discuss how these impact our PROMELA translation and suggest solutions. Finally, we show how to model-check liveness requirements imposed on MSC speciications. We use the PROMELA models obtained from our implementation, describe how to use control state propositions based on these models, use Linear Time Temporal Logic formulas to specify the liveness properties, and demonstrate the use of XSPIN as a model checker for these properties.","PeriodicalId":347523,"journal":{"name":"The Spin Verification System","volume":"421 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117343819","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On nested depth first search","authors":"G. Holzmann, D. Peled, M. Yannakakis","doi":"10.1090/dimacs/032/03","DOIUrl":"https://doi.org/10.1090/dimacs/032/03","url":null,"abstract":"We show in this paper that the algorithm for solving the model checking problem with a nested depth-first search can interfere with algorithms that support partial order reduction. We introduce a revised version of the algorithm that guarantees compatibility. The change also improves the performance of the nested depth-first search algorithm when partial order reduction is not used.","PeriodicalId":347523,"journal":{"name":"The Spin Verification System","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115968706","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dynamic analysis of SA/RT models using Spin and modular verification","authors":"J. Tuya, J. Diego, C. Riva, J. A. Corrales","doi":"10.1090/dimacs/032/12","DOIUrl":"https://doi.org/10.1090/dimacs/032/12","url":null,"abstract":"This paper presents the integrated use of the Spin Model Checker in conjunction with Structured Methods (SA/RT). The graphical model is translated into a Promela program in which we prove assertions about the desired behaviour of the system. We also provide support for modular verification, by separately verifying different components of the model and deducing the desired global properties from the previous verifications. The above approach is then illustrated using a steam boiler system as a case study .","PeriodicalId":347523,"journal":{"name":"The Spin Verification System","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128522388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Outline for an operational semantics of Promela","authors":"V. Natarajan, G. Holzmann","doi":"10.1090/dimacs/032/10","DOIUrl":"https://doi.org/10.1090/dimacs/032/10","url":null,"abstract":"PROMELA is a high-level specification language for modeling interactions in distributed systems, and for expressing logical correctness requirements about such interactions. The model checker SPIN accepts specifications written in this language, and it can produce automated proofs for each type of property. SPIN either proves that a property is valid in the given system, or it generates a counter-example that shows that it is not. This paper contains the outline for an operational- semantics definition of PROMELA.","PeriodicalId":347523,"journal":{"name":"The Spin Verification System","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134145874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Modelling and verification of the MCS layer with Spin","authors":"P. Merino, J. M. Troya","doi":"10.1090/dimacs/032/08","DOIUrl":"https://doi.org/10.1090/dimacs/032/08","url":null,"abstract":"","PeriodicalId":347523,"journal":{"name":"The Spin Verification System","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133710726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Not checking for closure under stuttering","authors":"G. Holzmann, O. Kupferman","doi":"10.1090/dimacs/032/02","DOIUrl":"https://doi.org/10.1090/dimacs/032/02","url":null,"abstract":"The model checker SPIN works better with specifications that are closed under stuttering. Checking such specifications, SPIN can use its partial-order reductions. It is hard to check whether a given specification is closed under stuttering and it is pity to give up SPIN'S partial-order reductions. We suggest an algorithm that, given a program P and a specification N of bad behaviors for P, checks the correctness of P with respect to an extension N' of N that is guaranteed to be closed under stuttering. In this check, SPIN can use its partial-order reductions. If P is correct with respect to N', we conclude that it is correct also with respect to N. If P is not correct with respect to N', we use the counter-example that SPIN provides to determine whether the program is correct with respect to N or that N is not closed under stuttering.","PeriodicalId":347523,"journal":{"name":"The Spin Verification System","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130619460","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A simulation and validation tool for self-stabilizing protocols","authors":"S. Shukla, D. Rosenkrantz, S. Ravi","doi":"10.1090/dimacs/032/11","DOIUrl":"https://doi.org/10.1090/dimacs/032/11","url":null,"abstract":"","PeriodicalId":347523,"journal":{"name":"The Spin Verification System","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122569684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Memory efficient state storage in Spin","authors":"W. Visser, H. Barringer","doi":"10.1090/dimacs/032/13","DOIUrl":"https://doi.org/10.1090/dimacs/032/13","url":null,"abstract":"The use of an Ordered Binary Decision Diagram (OBDD) to store all visited states during on-they model checking (or reachability analysis) is investigated. To improve the time and space e ciency a state compression technique is introduced. This compression technique is safe, in the sense that no two unique states will have the same compressed representation. A number of examples are used to evaluate an experimental implementation of the OBDD state store within the SPIN validation tool. In all the examples a reduction in space is achieved when using the OBDD state store as opposed to the more traditional hash table state store. The memory and time usage when combining partial orders with the OBDD state store is also considered.","PeriodicalId":347523,"journal":{"name":"The Spin Verification System","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123033674","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}