Model checking of concurrent software systems via heuristic-guided SAT solving

DOI10.1007/978-3-319-68972-2_16MaRDI QIDQ2093157zbMATH OpenOpenAlexFDO

Authors Nils Timm, Stefan Gruner, Prince Sibanda

Publication date 4 November 2022

Full work available at URL https://doi.org/10.1007/978-3-319-68972-2_16

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Tools and Algorithms for the Construction and Analysis of Systems
• The fixed-parameter tractability of model checking concurrent systems
• Model checking concurrent programs
• Compositional Model Checking of Concurrent Systems
• Efficient SAT-based bounded model checking for software verification
• scientific article; zbMATH DE number 2086592
• SAT-Based Model Checking
• Computer Aided Verification

Cited in

(4)

• Guided model checking with a Bayesian meta-heuristic
• Scalable error detection using Boolean satisfiability
• Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving
• A bounded model checker for three-valued abstractions of concurrent software systems

This page was built for publication: Model checking of concurrent software systems via heuristic-guided SAT solving

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