找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: SPIN Model Checking and Software Verification; 7th International SP Klaus Havelund,John Penix,Willem Visser Conference proceedings 2000 Spr

[复制链接]
查看: 26022|回复: 65
发表于 2025-3-21 18:40:31 | 显示全部楼层 |阅读模式
书目名称SPIN Model Checking and Software Verification
副标题7th International SP
编辑Klaus Havelund,John Penix,Willem Visser
视频video
概述Includes supplementary material:
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: SPIN Model Checking and Software Verification; 7th International SP Klaus Havelund,John Penix,Willem Visser Conference proceedings 2000 Spr
描述The SPIN workshop is a forum for researchers interested in the subject of automata-based, explicit-state model checking technologies for the analysis and veri?cation of asynchronous concurrent and distributed systems. The SPIN - del checker (http://netlib.bell-labs.com/netlib/spin/whatispin.html), developed by Gerard Holzmann, is one of the best known systems of this kind, and has attracted a large user community. This can likely be attributed to its e?cient state exploration algorithms. The fact that SPIN’s modeling language, Promela, resembles a programming language has probably also contributed to its success. Traditionally, the SPIN workshops present papers on extensions and uses of SPIN. As an experiment, this year’s workshop was broadened to have a slightly wider focus than previous workshops in that papers on software veri?cation were encouraged. Consequently, a small collection of papers describe attempts to analyze and verify programs written in conventional programming languages. Solutions include translations from source code to Promela, as well as specially designed model checkers that accept source code. We believe that this is an - teresting research direction for the
出版日期Conference proceedings 2000
关键词Concurrent Systems; Distributed Systems; Finite State Systems; Formal Methods; Formal Verification; Softw
版次1
doihttps://doi.org/10.1007/10722468
isbn_softcover978-3-540-41030-0
isbn_ebook978-3-540-45297-3Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2000
The information of publication is updating

书目名称SPIN Model Checking and Software Verification影响因子(影响力)




书目名称SPIN Model Checking and Software Verification影响因子(影响力)学科排名




书目名称SPIN Model Checking and Software Verification网络公开度




书目名称SPIN Model Checking and Software Verification网络公开度学科排名




书目名称SPIN Model Checking and Software Verification被引频次




书目名称SPIN Model Checking and Software Verification被引频次学科排名




书目名称SPIN Model Checking and Software Verification年度引用




书目名称SPIN Model Checking and Software Verification年度引用学科排名




书目名称SPIN Model Checking and Software Verification读者反馈




书目名称SPIN Model Checking and Software Verification读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:52:10 | 显示全部楼层
Using Garbage Collection in Model Checkingid referencing problems. In order to efficiently model check programs that use garbage collection, similar functionalities have to be embedded in model checkers. This paper focuses on the implementation of two classic garbage collection algorithms in dSPIN, an extension of the model checker SPIN whi
发表于 2025-3-22 00:42:40 | 显示全部楼层
发表于 2025-3-22 05:21:29 | 显示全部楼层
发表于 2025-3-22 11:49:42 | 显示全部楼层
Verification and Optimization of a PLC Control Schedule This work was carried out as part of a case study for the EC VHS project (Verification of Hybrid Systems), in which the program for a Programmable Logic Controller (PLC) of an experimental chemical plant had to be designed and verified. The intention of our approach was to see how much could be ach
发表于 2025-3-22 14:50:59 | 显示全部楼层
Modeling the ASCB-D Synchronization Algorithm with SPIN: A Case Study communication over a network. We used the SPIN model to check certain performance properties of the system; in particular, we were able to verify that the algorithm achieves synchronization within a time bound, even in the presence of certain types of faults. Our results suggest that state space ex
发表于 2025-3-22 19:00:52 | 显示全部楼层
发表于 2025-3-22 23:10:28 | 显示全部楼层
发表于 2025-3-23 03:47:48 | 显示全部楼层
Interaction Abstraction for Compositional Finite State Systemsgorithms as it tries to preserve only the relevant information for checking properties. It works better than compositional minimization because it reduces components individually and does not need to compose components. Hence it does not suffer from state explosion. Instead, it uses information abou
发表于 2025-3-23 07:43:11 | 显示全部楼层
Correctness by Construction: Towards Verification in Hierarchical System Developmentmporal logics. Most approaches however assume, that the initial specification is indeed the intended one. Changing the specification thus necessitates to find an accordingly adapted system and to carry out the verification from scratch. During a systems life cycle however, changes of the requirement
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-15 04:22
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表