Foundations of fine-grained explainability

DOI10.1007/978-3-030-81688-9_24zbMath1493.68209OpenAlexW3185067521MaRDI QIDQ832283

Hugo Tremblay, Sylvain Hallé

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81688-9_24

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05)

Uses Software

• BeepBeep
• Dytan
• Apache Flink

Cites Work

• Unnamed Item
• Unnamed Item
• Explaining counterexamples using causality
• XML graphs in program analysis
• Declarative layout constraints for testing web applications
• Monitoring of temporal first-order properties with aggregations
• Complexity results for structure-based causality.
• Vacuity in practice: temporal antecedent failure
• The Computational Complexity of Structure-Based Causality
• Trace Diagnostics Using Temporal Implicants
• Whodunit? Causal Analysis for Counterexamples
• Causes and Explanations: A Structural-Model Approach. Part I: Causes
• Tools and Algorithms for the Construction and Analysis of Systems
• Model checking of safety properties

This page was built for publication: Foundations of fine-grained explainability