Detecting temporal logic predicates in distributed programs using computation slicing
From MaRDI portal
Recommendations
Cited in
(12)- Concurrency-preserving and sound monitoring of multi-threaded component-based systems: theory, algorithms, implementation, and evaluation
- Techniques and applications of computation slicing
- Unified mathematical framework for slicing and symmetry reduction over event structures
- Efficient abstraction algorithms for predicate detection
- Modeling, analyzing and slicing periodic distributed computations
- Producing Short Counterexamples Using “Crucial Events”
- Detecting Temporal Logic Predicates on Distributed Computations
- Testing Distributed Systems Through Symbolic Model Checking
- Computation slicing: Techniques and theory
- Finding missing synchronization in a distributed computation using controlled re-execution
- Decentralized runtime verification of message sequences in message-based systems
- On the complexity of partial order trace model checking
This page was built for publication: Detecting temporal logic predicates in distributed programs using computation slicing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466227)