Leveraging Horn clause solving for compositional verification of PLC software
From MaRDI portal
Publication:2177778
Recommendations
Cites work
- An axiomatic basis for computer programming
- Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis
- Efficient CTL verification via Horn constraints solving
- Generalized property directed reachability
- Horn clause solvers for program verification
- scientific article; zbMATH DE number 438994 (Why is no real title available?)
- scientific article; zbMATH DE number 4055578 (Why is no real title available?)
- Temporal verification of reactive systems: response
Cited in
(3)
This page was built for publication: Leveraging Horn clause solving for compositional verification of PLC software
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2177778)