[图书][B] Principles of model checking
A comprehensive introduction to the foundations of model checking, a fully automated
technique for finding flaws in hardware and software; with extensive examples and both …
technique for finding flaws in hardware and software; with extensive examples and both …
[图书][B] Partial-order methods for the verification of concurrent systems: an approach to the state-explosion problem
P Godefroid - 1996 - Springer
The first technique for computing the set of transitions T to consider in a selective search
actually corresponds to a whole family of algorithms lOve81, Va191, GW91b] that have been …
actually corresponds to a whole family of algorithms lOve81, Va191, GW91b] that have been …
[图书][B] An introduction to input/output automata
NA Lynch, MR Tuttle - 1988 - groups.csail.mit.edu
The input/output automaton model has recently been de ned, in LT1, LT2], as a tool for
modeling concurrent and distributed discrete event systems of the sorts arising in computer …
modeling concurrent and distributed discrete event systems of the sorts arising in computer …
[图书][B] Distributed computing through combinatorial topology
Distributed Computing Through Combinatorial Topology describes techniques for analyzing
distributed algorithms based on award winning combinatorial topology research. The …
distributed algorithms based on award winning combinatorial topology research. The …
[图书][B] Algorithms and theory of computation handbook, volume 2: special topics and techniques
MJ Atallah, M Blanton - 2009 - books.google.com
This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …
topics, techniques, and applications. Along with updating and revising many of the existing …
[图书][B] Concurrency verification: Introduction to compositional and non-compositional methods
WP De Roever - 2001 - books.google.com
This is a systematic and comprehensive introduction both to compositional proof methods for
the state-based verification of concurrent programs, such as the assumption-commitment …
the state-based verification of concurrent programs, such as the assumption-commitment …
The heard-of model: computing in distributed systems with benign faults
B Charron-Bost, A Schiper - Distributed Computing, 2009 - Springer
Problems in fault-tolerant distributed computing have been studied in a variety of models.
These models are structured around two central ideas:(1) degree of synchrony and failure …
These models are structured around two central ideas:(1) degree of synchrony and failure …
[PDF][PDF] Round-by-round fault detectors (extended abstract) unifying synchrony and asynchrony
E Gafni - Proceedings of the seventeenth annual ACM …, 1998 - dl.acm.org
This paper presents a new family of models of distributed-computation which combines
features from synchronous, asynchronous, and failure-detectoraugmented systems. Like …
features from synchronous, asynchronous, and failure-detectoraugmented systems. Like …
Programming and proving with distributed protocols
Distributed systems play a crucial role in modern infrastructure, but are notoriously difficult to
implement correctly. This difficulty arises from two main challenges:(a) correctly …
implement correctly. This difficulty arises from two main challenges:(a) correctly …
PSync: a partially synchronous language for fault-tolerant distributed algorithms
C Drăgoi, TA Henzinger, D Zufferey - ACM SIGPLAN Notices, 2016 - dl.acm.org
Fault-tolerant distributed algorithms play an important role in many critical/high-availability
applications. These algorithms are notoriously difficult to implement correctly, due to …
applications. These algorithms are notoriously difficult to implement correctly, due to …