From quantified CTL to QBF

DOI10.4230/LIPICS.TIME.2019.11MaRDI QIDQ6487554zbMATH OpenFDO

Authors Akash Hossain, François Laroussinie

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.TIME.2019.11

zbMATH Keywords

model checkingQBF solversquantified CTLSAT-based model checking

Mathematics Subject Classification ID

Temporal logic (03B44) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
• Quantified CTL: expressiveness and complexity
• Quantified CTL: expressiveness and model checking (extended abstract)
• Quantified computation tree logic
• On the expressiveness of QCTL

Cited in

(5)

• Quantified CTL: expressiveness and model checking (extended abstract)
• Quantified CTL: expressiveness and complexity
• On the expressiveness of QCTL
• QBF-Based Symbolic Model Checking for Knowledge and Time
• \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers

This page was built for publication: From quantified CTL to QBF

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