@article{biereBoundedModelChecking2009,
  title = {Bounded Model Checking},
  volume = {185},
  issn = {09226389},
  doi = {10.3233/978-1-58603-929-5-457},
  abstract = {One of the most important industrial applications of SAT is currently Bounded Model Checking (BMC). This technique is typically used for formal hardware verification in the context of Electronic Design Automation. But BMC has successfully been applied to many other domains as well. In practice, BMC is mainly used for falsification, which is concerned with violations of temporal properties. In addition, a considerable part of this chapter discusses complete extensions, including k-induction and interpolation. These extensions also allow to prove properties. © 2009 John Franco and John Martin and IOS Press.},
  number = {1},
  journaltitle = {Frontiers in Artificial Intelligence and Applications},
  date = {2009},
  pages = {457--481},
  author = {Biere, Armin},
  file = {/home/dimitri/Nextcloud/Zotero/storage/SB4RYQKV/SATChapter14.pdf}
}

{"_id":"uobiSE36ZFCZXrnbZ","bibbaseid":"biere-boundedmodelchecking","authorIDs":[],"author_short":["Biere, A."],"bibdata":{"bibtype":"article","type":"article","title":"Bounded Model Checking","volume":"185","issn":"09226389","doi":"10.3233/978-1-58603-929-5-457","abstract":"One of the most important industrial applications of SAT is currently Bounded Model Checking (BMC). This technique is typically used for formal hardware verification in the context of Electronic Design Automation. But BMC has successfully been applied to many other domains as well. In practice, BMC is mainly used for falsification, which is concerned with violations of temporal properties. In addition, a considerable part of this chapter discusses complete extensions, including k-induction and interpolation. These extensions also allow to prove properties. © 2009 John Franco and John Martin and IOS Press.","number":"1","journaltitle":"Frontiers in Artificial Intelligence and Applications","date":"2009","pages":"457–481","author":[{"propositions":[],"lastnames":["Biere"],"firstnames":["Armin"],"suffixes":[]}],"file":"/home/dimitri/Nextcloud/Zotero/storage/SB4RYQKV/SATChapter14.pdf","bibtex":"@article{biereBoundedModelChecking2009,\n title = {Bounded Model Checking},\n volume = {185},\n issn = {09226389},\n doi = {10.3233/978-1-58603-929-5-457},\n abstract = {One of the most important industrial applications of SAT is currently Bounded Model Checking (BMC). This technique is typically used for formal hardware verification in the context of Electronic Design Automation. But BMC has successfully been applied to many other domains as well. In practice, BMC is mainly used for falsification, which is concerned with violations of temporal properties. In addition, a considerable part of this chapter discusses complete extensions, including k-induction and interpolation. These extensions also allow to prove properties. © 2009 John Franco and John Martin and IOS Press.},\n number = {1},\n journaltitle = {Frontiers in Artificial Intelligence and Applications},\n date = {2009},\n pages = {457--481},\n author = {Biere, Armin},\n file = {/home/dimitri/Nextcloud/Zotero/storage/SB4RYQKV/SATChapter14.pdf}\n}\n\n","author_short":["Biere, A."],"key":"biereBoundedModelChecking2009","id":"biereBoundedModelChecking2009","bibbaseid":"biere-boundedmodelchecking","role":"author","urls":{},"downloads":0},"bibtype":"article","biburl":"https://raw.githubusercontent.com/dlozeve/newblog/master/bib/all.bib","creationDate":"2020-01-08T20:39:39.015Z","downloads":0,"keywords":[],"search_terms":["bounded","model","checking","biere"],"title":"Bounded Model Checking","year":null,"dataSources":["3XqdvqRE7zuX4cm8m"]}