Concurrency Verification: Introduction to Compositional and by Willem-Paul de Roever, Frank de Boer, Ulrich Hanneman, Jozef

By Willem-Paul de Roever, Frank de Boer, Ulrich Hanneman, Jozef Hooman, Yassine Lakhnech, Mannes Poel, Job Zwiers

It is a systematic and accomplished creation either to compositional facts equipment for the state-based verification of concurrent courses, reminiscent of the assumption-commitment and rely-guarantee paradigms, and to noncompositional tools, whose presentation culminates in an exposition of the communication-closed-layers (CCL) paradigm for verifying community protocols. Compositional concurrency verification tools decrease the verification of a concurrent software to the self sufficient verification of its components. If these elements are tightly coupled, one also wishes verification tools in keeping with the causal order among occasions. those are awarded utilizing CCL. The semantic procedure right here permits a scientific presentation of these types of options in a unified framework which highlights crucial recommendations. The e-book is self-contained, guiding the reader from complex undergraduate point to the cutting-edge. each strategy is illustrated by way of examples, and an image gallery of a few of the subject's key figures enhances the textual content.

Show description

Read Online or Download Concurrency Verification: Introduction to Compositional and Non-compositional Methods PDF

Similar algorithms and data structures books

Adaptive filtering: algorithms and practical implementation

This publication provides a entire review of either the basics of wavelet research and comparable instruments, and of the main lively contemporary advancements in the direction of functions. It bargains a state of the art in numerous lively components of analysis the place wavelet principles, or extra normally multiresolution rules have proved fairly potent.

Fundamentals of Algebraic Specification 2: Module Specifications and Constraints

Because the early seventies thoughts of specification became valuable within the complete region of machine technology. specially algebraic specification ideas for summary info forms and software program platforms have won significant value lately. they've got not just performed a imperative function within the thought of information variety specification, yet in the meantime have had a amazing impact on programming language layout, method architectures, arid software program instruments and environments.

Simple Program Design: A Step-by-Step Approach

Uncomplicated software layout: A step-by-step procedure, 5th version is written for programmers who are looking to improve solid programming abilities for fixing universal company difficulties. The 5th version has been completely revised in accordance with glossy application layout concepts. The easy-to-follow educational variety has been retained in addition to the language-independent method of application layout.

Additional info for Concurrency Verification: Introduction to Compositional and Non-compositional Methods

Sample text

Carraghan and P. Paradalos. An exact algorithm for the maximum clique problem. In Operations Research Letters, volume 9, pages 375-382, 1990. CR76 J. Cohen and M. Roth. On the implementation of Strassen's fast multiplication algorithm. Acta Informatica, 6:341-355, 1976. CR94 M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, New York, 1994. Cra94 R. Crandall. Topics in Scientific Computation. Telos/Springer-Verlag, New York, 1994. CS93 J. Conway and N. Sloane. Sphere packings, lattices, and groups.

Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of three graph drawing algorithms. In Proc. 11th ACM Symposium on Computational Geometry, pages 306-315, 1995. BGS95 M Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs, and non-approximability - towards tight results. In Proc. IEEE 36th Symp. Foundations of Computer Science, pages 422-431, 1995. BH90 F. Buckley and F. Harary. Distances in Graphs. , 1990. BJ85 S. Bent and J. John. Finding the median requires 2n comparisons.

Sudan. Free bits, PCPs, and non-approximability - towards tight results. In Proc. IEEE 36th Symp. Foundations of Computer Science, pages 422-431, 1995. BH90 F. Buckley and F. Harary. Distances in Graphs. , 1990. BJ85 S. Bent and J. John. Finding the median requires 2n comparisons. In Proc. 17th ACM Symp. on Theory of Computing, pages 213-216, 1985. HTM (5 of 50) [19/1/2003 1:28:01] References BJL 91 A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yanakakis. Linear approximation of shortest superstrings.

Download PDF sample

Rated 4.80 of 5 – based on 35 votes