Checking Static Properties Using Conservative SAT Approximations for Reachability

DOI10.1007/978-3-319-70848-5_15zbMath1498.68149OpenAlexW2767904835MaRDI QIDQ5045468

A. W. Roscoe, Thomas Gibson-Robinson, Pedro Antonino

Publication date: 4 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving

This page was built for publication: Checking Static Properties Using Conservative SAT Approximations for Reachability