Principles of the Spin Model Checker

ISBN-10: 1846287693
ISBN-13: 9781846287695
Edition: 2008
Buy it from $63.01
This item qualifies for FREE shipping

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description: Principles of Spin is an introductory book, the only requirement is a background in programming. Spin models are written in the Promela language which is easily learned by students and programmers. Spin is easy to install and use. The Spin model  More...

New Starting from $63.01
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
You could win $10,000

Get an entry for every item you buy, rent, or sell.

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Periodic Table Online content $4.95 $1.99
Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

Copyright year: 2008
Publisher: Springer
Publication date: 1/8/2008
Binding: Paperback
Pages: 220
Size: 6.00" wide x 9.00" long x 0.25" tall
Weight: 0.330

Principles of Spin is an introductory book, the only requirement is a background in programming. Spin models are written in the Promela language which is easily learned by students and programmers. Spin is easy to install and use. The Spin model checker is not only a widely used professional tool but it is also a superb tool for teaching important concepts of computer science such as verification, concurrency and nondeterminism. The book introduces Spin-based software that the author has developed for teaching: ???jSpin - an integrated development environment for Spin. ???SpinSpider - uses output from Spin to automatically construct state diagrams of concurrent programs. ???VN is a tool for visualizing nondeterminism. Complete programs will demonstrate each construct and concept and these programs will be available on a companion website.

Foreword
Preface
Sequential Programming in Promela
A first program in Promela
Random simulation
Data types
Type conversions
Operators and expressions
Local variables
Symbolic names
Control statements
Selection statements
Conditional expressions
Repetitive statements
Counting loops
Jump statements
Verification of Sequential Programs
Assertions
Verifying a program in Spin
Guided simulation
Displaying a computation
Concurrency
Interleaving
Displaying a computation
Atomicity
Interactive simulation
Interference between processes
Sets of processes
Interference revisited
Deterministic sequences of statements
Verification with assertions
The critical section problem
Synchronization
Synchronization by blocking
Executability of statements
State transition diagrams
Atomic sequences of statements
d_step and atomic
Semaphores
Nondeterminism in models of concurrent systems
Generating values nondeterministically
Generating from an arbitrary range
Termination of processes
Deadlock
End states
The order of process termination
Verification with Temporal Logic
Beyond assertions
Introduction to linear temporal logic
The syntax of LTL
The semantics of LTL
Safety properties
Expressing safety properties in LTL
Expressing safety properties in Promela
Verifying safety properties in Spin
Liveness properties
Expressing liveness properties in Spin
Verifying liveness properties in Spin
Fairness
Duality
Verifying correctness without ghost variables
Modeling a noncritical section
Advanced temporal specifications
Latching
Infinitely often
Precedence
Overtaking
Next
Data and Program Structures
Arrays
Type definitions
The preprocessor
Condition compilation
Macros
Inline
Channels
Channels in Promela
Channels and channel variables
Rendezvous channels
Reply channels
Arrays of channels
Local channels
Limitations of rendezvous channels
Buffered channels
Checking the content of a channel
Checking if a channel is full or empty
Checking the number of messages in a channel
Random receive
Sorted send
Copying the value of a message
Polling
Comparing rendezvous and buffered channels
Nondeterminism
Nondeterministic finite automata
timeout
Using verification to find accepting computations
Finding all counterexamples
[lambda]-transitions
VN: Visualizing nondeterminism
NP problems
Advanced Topics in Promela
Specifiers for variables
Predefined variables
The anonymous variable
Process identifiers
Priority
Simulation priority
Modeling priority with global constraints
Modeling exceptions
Reading from standard input
Embedded C code
Advanced Topics in Spin
How Spin searches the state space
Optimizing the performance of verifications
Writing efficient models
Allocating memory for the hash table
Compressing the state vector
Minimal automaton
Partial-order reduction
Never claims
A never claim for a safety property
A never claim for a liveness property
Never claims for other LTL formulas
Predefined constructs for use in never claims
Non-progress cycles
Case Studies
Channels as data structures
Nondeterministic algorithms
The eight-queens problem
Cycles in a directed graph
Modeling a real-time scheduling algorithm
Real-time systems
Modeling a scheduler in Promela
Simplifying the model
Modeling a scheduler with priorities
Rate monotonic scheduling
Fischer's algorithm
Modeling distributed systems
The Chandy-Lamport algorithm for global snapshots
The Chandy-Lamport snapshot algorithm in Promela
Structure of the program
Encoding lists of channels
The environment node
Local data for each node
Nodes of the distributed system
Nondeterministic choice of a channel
Verification of the snapshot algorithm
Software Tools
Spin
jSpin
SpinSpider
VN: Visualizing nondeterminism
Links
References
Index

×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×