Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Parallel SAT Solving in Bounded Model Checking

From MaRDI portal
Publication:3069995
Jump to:navigation, search

DOI10.1093/logcom/exp002zbMath1213.68359OpenAlexW2041340053MaRDI QIDQ3069995

Bernd Becker, Erika Ábrahám, Martin Fränzle, Christian Herde, Tobias Schubert

Publication date: 2 February 2011

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exp002


zbMATH Keywords

linear programminghybrid systemsparallel programsSAT solvingbounded model checking


Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)


Related Items (3)

Towards better heuristics for solving bounded model checking problems ⋮ Engineering constraint solvers for automatic analysis of probabilistic hybrid automata ⋮ Challenges in Constraint-Based Analysis of Hybrid Systems


Uses Software

  • MiniSat
  • MPI/MPICH
  • Chaff
  • BerkMin



This page was built for publication: Parallel SAT Solving in Bounded Model Checking

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3069995&oldid=16135288"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:47.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki