Probabilistic Horn clause verification

DOI10.1007/978-3-319-66706-5_1MaRDI QIDQ5233234zbMATH OpenOpenAlexFDO

Authors Aws Albarghouthi

Publication date 16 September 2019

Published in Static Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-66706-5_1

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC
• Horn clause solvers for program verification
• Relational verification through Horn clause transformation
• Proving correctness of imperative programs by linearizing constrained Horn clauses
• scientific article; zbMATH DE number 1500556

Cited in

(12)

• Automating induction for solving Horn clauses
• Horn clause solvers for program verification
• scientific article; zbMATH DE number 1497833 (Why is no real title available?)
• An iterative approach to precondition inference using constrained Horn clauses
• Predicate pairing for program verification
• Synchronizing constrained Horn clauses
• Removing unnecessary variables from Horn clause verification conditions
• RustHorn: CHC-based verification for Rust programs
• Analysis and Transformation of Constrained Horn Clauses for Program Verification
• The octatope abstract domain for verification of neural networks
• The \textsc{Golem} Horn solver
• Verifying generalization in deep learning

This page was built for publication: Probabilistic Horn clause verification

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