1. Abramsky, S.: Domain theory and the logic of observable properties. PhD thesis, University of London (1987)
2. Aiken, A.: Introduction to set constraint-based program analysis. Sci. Comput. Program. 35, 79–111 (1999)
3. Bjørner, N., de Moura, L.: Applications of SMT solvers to program verification. In: Notes for the Summer School on Formal Techniques (2014)
4. Bjørner, N., Duterte, B., de Moura, L.: Accelerating lemma learning using joins – DPLL( $$\sqcup $$ ⊔ ). In: Proceedings of Logic for Programming, Artificial Intelligence and Reasoning (2008)
5. Brain, M., D’silva, V., Griggio, A., Haller, L., Kroening, D.: Deciding floating-point logic with abstract conflict driven clause learning. Form. Methods Syst. Des. 45(2), 213–245 (2014)