Abstract conflict driven learning
From MaRDI portal
Publication:2931790
DOI10.1145/2429069.2429087zbMath1301.68156OpenAlexW2125189388MaRDI QIDQ2931790
Daniel Kroening, Leopold Haller, Vijay D'Silva
Publication date: 27 November 2014
Published in: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2429069.2429087
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Lattices (06B99)
Related Items
Abstract interpretation as automated deduction ⋮ An approximation framework for solvers and decision procedures ⋮ On abstract modular inference systems and solvers ⋮ SAT-Based Model Checking ⋮ Abstract Interpretation as Automated Deduction ⋮ raSAT: an SMT solver for polynomial constraints ⋮ Deciding floating-point logic with abstract conflict driven clause learning ⋮ Extending Maximal Completion (Invited Talk)
