Model Checking Software: 14th International SPIN Workshop, by Dennis Dams (auth.), Dragan Bošnački, Stefan Edelkamp (eds.)

Posted by

By Dennis Dams (auth.), Dragan Bošnački, Stefan Edelkamp (eds.)

This booklet constitutes the refereed complaints of the 14th foreign SPIN workshop on version Checking software program, SPIN 2007, held in Berlin, Germany in July 2007 along side the nineteenth overseas convention on desktop Aided Verification, CAV 2007.

The 14 revised complete papers awarded including four software presentation papers and the abstracts of two invited talks have been conscientiously reviewed and chosen from 39 submissions. The papers are prepared in topical sections on directed version checking, partial order relief, application research, exploration advances, modeling and case stories, in addition to instrument demonstrations.

Show description

Read or Download Model Checking Software: 14th International SPIN Workshop, Berlin, Germany, July 1-3, 2007. Proceedings PDF

Similar international conferences and symposiums books

Next Generation Information Technologies and Systems: 5th International Workshop, NGITS 2002 Caesarea, Israel, June 24–25, 2002 Proceedings

NGITS2002 used to be the ? fth workshop of its sort, selling papers that debate new applied sciences in details structures. Following the luck of the 4 p- vious workshops (1993, 1995, 1997, and 1999), the ? fth NGITS Workshop came about on June 24–25, 2002, within the historic urban of Caesarea. in keeping with the decision for Papers, 22 papers have been submitted.

Knowledge Discovery in Inductive Databases: 4th International Workshop, KDID 2005, Porto, Portugal, October 3, 2005, Revised Selected and Invited Papers

The4thInternationalWorkshoponKnowledgeDiscoveryinInductiveDatabases (KDID 2005) was once held in Porto, Portugal, on October three, 2005 along with the sixteenth eu convention on computing device studying and the ninth eu convention on ideas and perform of information Discovery in Databases. Ever because the commence of the ?

Rules and Rule Markup Languages for the Semantic Web: First International Conference, RuleML 2005, Galway, Ireland, November 10-12, 2005. Proceedings

RuleML 2005 was once the ? rst foreign convention on ideas and rule markup languages for the Semantic internet, held together with the foreign Semantic net C- ference (ISWC) at Galway, eire. With the good fortune of the RuleML workshop sequence got here the necessity for prolonged study and purposes themes equipped in a convention structure.

Annual World Bank Conference on Development Economics-Europe 2003: Toward Pro-Poor Policies--Aid, Institutions, and Globalization

The once a year international financial institution convention on improvement Economics (ABCDE) brings jointly the world's most interesting improvement thinkers to provide their views and concepts. lately, a parallel, moment convention has been held in Europe with an identical target of increasing the circulation of rules among thinkers, practitioners, and policymakers within the box of overseas improvement.

Extra resources for Model Checking Software: 14th International SPIN Workshop, Berlin, Germany, July 1-3, 2007. Proceedings

Sample text

The description is given in Algorithm 1. Note that, once the distances are computed by a BFS, a backward search in the graph starting from s and following edges for which the distance decreases until r (hence distance 0) is reached, allows to construct efficiently the shortest path from r to s. Unfortunately, backward searches cannot be used in practice 28 P. Gastin and P. Moro Algorithm 1. pop(); with SPIN since it would be hard to compute the set of predecessors of a state. , if the state is reached by an assignment to some integer variable.

More precisely, for each state we store an integer (depth field) and a few bits (bfs flag or marked). In fact, these flags should be erased after each call to an algorithm, this is omitted for simplicity. The size of each queue is at most linear in the number of states. 4 Improvements The first improvement is to use, before calling Algorithm 5, a nested-DFS algorithm such as [CVWY92, HPY96, SE05, GMZ04], or a Tarjan-like algorithm [Cou99, VG04]2 . This allows to perform a linear time search to detect whether there exists some counterexample, and in this case it can also initialize maxdepth to the size of the counterexample found in order to speed-up Algorithm 5.

205–219. : Reliable hashing without collosion detection. In: Courcoubetis, C. ) CAV 1993. LNCS, vol. 697, pp. 59–70. Springer, Heidelberg (1993) Generating Counter-Examples Through Randomized Guided Search Neha Rungta and Eric G. Mercer Department of Computer Science Brigham Young University Provo, UT 84602, USA Abstract. Computational resources are increasing rapidly with the explosion of multi-core processors readily available from major vendors. Model checking needs to harness these resources to help make it more effective in practical verification.

Download PDF sample

Rated 4.85 of 5 – based on 7 votes