~/talk

Solving Queries for Boolean Fault Tree Logic via Quantified SAT

on YouTube 25m
Talkat FTSCS 2023 · on Sunday, 2023-10-22· [compilers-and-language-design]

speakers

name:Caz Saaltink
links:none on file
name:Stefano M. Nicoletti
links:none on file
name:Matthias Volk
links:none on file
name:Ernst Moritz Hahn
links:none on file
name:Mariëlle Stoelinga
links:none on file

resources

video:https://youtu.be/z1ZJlBlKtBU
slides:none on file

summary

Provides a concrete BFL-to-QBF translation and a working implementation that uses Python + Z3 backend to check BFL properties, claiming it is the first tool for BFL queries. Evaluates on a COVID case-study and seven industry benchmarks (railway, reliability), measuring runtime and memory; results show roughly linear growth with QBF formula length with one explainable outlier (Q3) and strong sensitivity to tree structure and voting/gate types. Artifact is public on Zenodo.

AI-written summary · about

chapters (10)

  1. 0:00Boolean Fault Tree analysis
  2. 3:15Limitations of fault tree queries
  3. 6:31COVID-19 fault tree queries
  4. 8:59BFL logic syntax
  5. 12:10BFL to Quantified SAT
  6. 13:55Implementation overview
  7. 15:42Single fault tree scalability
  8. 16:47Multi-fault tree scalability
  9. 18:56Conclusions and future work
  10. 20:06Q&A

related talks

~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.