Techniques and applications of computation slicing
From MaRDI portal
Publication:1953245
DOI10.1007/s00446-004-0117-0zbMath1264.68030OpenAlexW2004960534MaRDI QIDQ1953245
Publication date: 7 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-004-0117-0
testing and debuggingpredicate detectionpredicate controlanalyzing distributed computationglobal property evaluationsoftware fault tolerance
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items (5)
Fast Detection of Stable and Count Predicates in Parallel Computations ⋮ Efficient online algorithm for identifying useless states in distributed systems ⋮ Scalable offline monitoring of temporal specifications ⋮ On Detecting Regular Predicates in Distributed Systems ⋮ Efficient abstraction algorithms for predicate detection
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A framework for viewing atomic events in distributed computations
- Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Recovery in distributed systems using optimistic message logging and checkpointing
- Time, clocks, and the ordering of events in a distributed system
- Maximal Sublattices of Finite Distributive Lattices. II
This page was built for publication: Techniques and applications of computation slicing