A survey on applications of quantified Boolean formulas
The decision problem of quantified Boolean formulas (QBFs) is the archetypical problem for
the complexity class PSPACE. Beside such theoretical aspects QBF also provides an …
the complexity class PSPACE. Beside such theoretical aspects QBF also provides an …
On thin air reads towards an event structures model of relaxed memory
This is the first paper to propose a pure event structures model of relaxed memory. We
propose confusion-free event structures over an alphabet with a justification relation as a …
propose confusion-free event structures over an alphabet with a justification relation as a …
The leaky semicolon: compositional semantic dependencies for relaxed-memory concurrency
Program logics and semantics tell a pleasant story about sequential composition: when
executing (S1; S2), we first execute S1 then S2. To improve performance, however …
executing (S1; S2), we first execute S1 then S2. To improve performance, however …
CAAT: Consistency as a Theory
T Haas, R Meyer, H Ponce de León - Proceedings of the ACM on …, 2022 - dl.acm.org
We propose a family of logical theories for capturing an abstract notion of consistency and
show how to build a generic and efficient theory solver that works for all members in the …
show how to build a generic and efficient theory solver that works for all members in the …
Second-order quantified boolean logic
JHR Jiang - Proceedings of the AAAI Conference on Artificial …, 2023 - ojs.aaai.org
Second-order quantified Boolean formulas (SOQBFs) generalize quantified Boolean
formulas (QBFs) by admitting second-order quantifiers on function variables in addition to …
formulas (QBFs) by admitting second-order quantifiers on function variables in addition to …
[HTML][HTML] QCTL model-checking with QBF solvers
A Hossain, F Laroussinie - Information and computation, 2021 - Elsevier
Quantified CTL (QCTL) extends the temporal logic CTL with quantifications over atomic
propositions. This extension is known to be very expressive: QCTL allows us to express …
propositions. This extension is known to be very expressive: QCTL allows us to express …
Improving Reasoning on DQBFs/Author Ankit Shukla
A Shukla - 2024 - epub.jku.at
Abstract Quantified Boolean formulas (QBFs) extend propositional logic by allowing
universal or existential quantifiers over propositional variables. Many reasoning tasks in …
universal or existential quantifiers over propositional variables. Many reasoning tasks in …