1 citations · 1 across the 2 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2020★ 1 cited
Solving bitvectors with MCSAT: explanations from bits and pieces (long version)
Stéphane Graham-Lengrand, Dejan Jovanović, Bruno Dutertre
We present a decision procedure for the theory of fixed-sized bitvectors in the MCSAT framework. MCSAT is an alternative to CDCL(T) for SMT solving and can be seen as an extension…
cs.LO2019
Verifying Visibility-Based Weak Consistency
Siddharth Krishna, Michael Emmi, Constantin Enea +1
Multithreaded programs generally leverage efficient and thread-safe concurrent objects like sets, key-value maps, and queues. While some concurrent-object operations are designed t…