default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 31 matches
- 2007
- Ofer Strichman, Armin Biere:
Proceedings of the Fourth International Workshop on Bounded Model Checking, BMC@FLoC 2006, Seattle, WA, USA, August 15, 2006. Electronic Notes in Theoretical Computer Science 174(3), Elsevier 2007 [contents] - 2006
- Erika Ábrahám, Marc Herbstritt, Bernd Becker, Martin Steffen:
Bounded Model Checking with Parametric Data Structures. BMC@FLoC 2006: 3-16 - Paul B. Jackson, Daniel Sheridan:
A Compact Linear Translation for Bounded Model Checking. BMC@FLoC 2006: 17-30 - Toni Jussila, Armin Biere:
Compressing BMC Encodings with QBF. BMC@FLoC 2006: 45-56 - Xuandong Li, Sumit Jha Aanand, Lei Bu:
Towards an Efficient Path-Oriented Tool for Bounded Reachability Analysis of Linear Hybrid Systems using Linear Programming. BMC@FLoC 2006: 57-70 - João Marques-Silva:
Interpolant Learning and Reuse in SAT-Based Model Checking. BMC@FLoC 2006: 31-43 - Ofer Strichman, Armin Biere:
Preface. BMC@FLoC 2006: 1-2 - Armin Biere, Ofer Strichman:
Proceedings of the Third International Workshop on Bounded Model Checking, BMC@CAV 2005, Edinburgh, UK, July 11, 2005. Electronic Notes in Theoretical Computer Science 144(1), Elsevier 2006 [contents] - 2005
- Mohammad Awedh, Fabio Somenzi:
Termination Criteria for Bounded Model Checking: Extensions and Comparison. BMC@CAV 2005: 51-66 - Armin Biere, Ofer Strichman:
Preface. BMC@CAV 2005: 1 - Anders Franzén:
Using Satisfiability Modulo Theories for Inductive Verification of Lustre Programs. BMC@CAV 2005: 19-33 - Daniel Geist, Mark Ginzburg, Yoad Lustig, Ishai Rabinovitz, Ohad Shacham, Rachel Tzoref:
Supporting SAT based BMC on Finite Path Models. BMC@CAV 2005: 67-77 - Markus Jehle, Jan Johannsen, Martin Lange, Nicolas Rachinsky:
Bounded Model Checking for All Regular Properties. BMC@CAV 2005: 3-18 - Daniel Kroening:
Computing Over-Approximations with Bounded Model Checking. BMC@CAV 2005: 79-92 - Ohad Shacham, Karen Yorav:
Adaptive Application of SAT Solving Techniques. BMC@CAV 2005: 35-50 - Armin Biere, Ofer Strichman:
Proceedings of the 2nd International Workshop on Bounded Model Checking, BMC@CAV 2004, Boston, MA, USA, July 18, 2004. Electronic Notes in Theoretical Computer Science 119(2), Elsevier 2005 [contents] - 2004
- Roy Armoni, Limor Fix, Ranan Fraer, Scott Huddleston, Nir Piterman, Moshe Y. Vardi:
SAT-based Induction for Temporal Safety Properties. BMC@CAV 2004: 3-16 - Gilles Audemard, Marco Bozzano, Alessandro Cimatti, Roberto Sebastiani:
Verifying Industrial Hybrid Systems with MathSAT. BMC@CAV 2004: 17-32 - Armin Biere, Ofer Strichman:
Preface. BMC@CAV 2004: 1- - Gabriel P. Bischoff, Karl S. Brace, Gianpiero Cabodi, Sergio Nocco, Stefano Quer:
Exploiting Target Enlargement and Dynamic Abstraction within Mixed BDD and SAT Invariant Checking. BMC@CAV 2004: 33-49 - Alex Groce, Daniel Kroening:
Making the Most of BMC Counterexamples. BMC@CAV 2004: 67-81 - HoonSang Jin, Fabio Somenzi:
An Incremental Algorithm to Check Satisfiability for Bounded Model Checking. BMC@CAV 2004: 51-65 - Daniel Sheridan:
Bounded Model Checking with SNF, Alternating Automata, and Bu"chi Automata. BMC@CAV 2004: 83-101 - 2003
- Gianpiero Cabodi, Sergio Nocco, Stefano Quer, Alex Kondratyev, Luciano Lavagno, Yosinori Watanabe:
A BMC-formulation for the scheduling problem in highly constrained hardware Systems. BMC@CAV 2003: 623-638 - Niklas Eén, Niklas Sörensson:
Temporal induction by incremental SAT solving. BMC@CAV 2003: 543-560 - Toni Jussila, Keijo Heljanko, Ilkka Niemelä:
BMC via on-the-fly determinization. BMC@CAV 2003: 561-577 - Zurab Khasidashvili, Ziyad Hanna:
SAT-based methods for sequential hardware equivalence verification without synchronization. BMC@CAV 2003: 593-607 - Bing Li, Chao Wang, Fabio Somenzi:
A satisfiability-based approach to abstraction refinement in model checking. BMC@CAV 2003: 608-622 - P. Madhusudan, Wonhong Nam, Rajeev Alur:
Symbolic computational techniques for solving games. BMC@CAV 2003: 578-592 - Ofer Strichman, Armin Biere:
Preface. BMC@CAV 2003: 541-542
skipping 1 more match
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-18 15:19 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint