Abstract
Program Verification IS a systematic approach to proving the correctness of programs. Correctness means that the programs enjoy certain desirable properties. For sequential programs these properties are delivery of correct results and termination. For concurrent programs, that is, those with several active components, the properties of interference freedom, deadlock freedom and fair behavior are also important. The emphasis in this book is on verification of concurrent programs, in particular of parallel and distributed programs where the components communicate either via shared variables or explicit message passing. Such programs are usually difficult to design, and errors are more a rule than an exception. Of course, we also consider sequential programs because they occur as components of concurrent ones.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2010 Springer-Verlag London Limited
About this chapter
Cite this chapter
(2010). Introduction. In: Verification of Sequential and Concurrent Programs. Texts in Computer Science. Springer, London. https://doi.org/10.1007/978-1-84882-745-5_1
Download citation
DOI: https://doi.org/10.1007/978-1-84882-745-5_1
Publisher Name: Springer, London
Print ISBN: 978-1-84882-744-8
Online ISBN: 978-1-84882-745-5
eBook Packages: Computer ScienceComputer Science (R0)