An efficient algorithm for computing causal trace sets in causality checking

DOI10.1007/978-3-030-31784-3_10MaRDI QIDQ3297592zbMATH OpenOpenAlexFDO

Authors Martin Kölbl, Stefan Leue

Publication date 20 July 2020

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL http://nbn-resolving.de/urn:nbn:de:bsz:352-2-1u56ubk3dc5085

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Causality checking for complex system models
• Explaining Counterexamples Using Causality
• Explaining counterexamples using causality
• Reachability analysis on distributed executions
• From Checking to Inference: Actual Causality Computations as Optimization Problems

Cites work

• Causality checking for complex system models
• Causes and Explanations: A Structural-Model Approach. Part I: Causes
• Heuristic search. Theory and applications
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(6)

• Mining CSTNUDs significant for a set of traces is polynomial
• Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework
• Causality checking for complex system models
• The Causal Graph Revisited for Directed Model Checking
• Operational causality -- necessarily sufficient and sufficiently necessary
• From verification to causality-based explications (invited talk)

Describes a project that uses

Uses Software

• SPIN

This page was built for publication: An efficient algorithm for computing causal trace sets in causality checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3297592)