2002
DOI: 10.1007/3-540-45620-1_35
|View full text |Cite
|
Sign up to set email alerts
|

Lazy Theorem Proving for Bounded Model Checking over Infinite Domains

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
70
0
1

Year Published

2002
2002
2010
2010

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 90 publications
(74 citation statements)
references
References 25 publications
0
70
0
1
Order By: Relevance
“…All experiments were performed on a SUN Blade 1000 with 8 Gbytes of main memory and two 900 Mhz UltraSparc III+ processors; each one with an 8 Mbyte cache. We used ICS (version 2.0b) [3] for checking satisfiability of the formulas in the BMC approach.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…All experiments were performed on a SUN Blade 1000 with 8 Gbytes of main memory and two 900 Mhz UltraSparc III+ processors; each one with an 8 Mbyte cache. We used ICS (version 2.0b) [3] for checking satisfiability of the formulas in the BMC approach.…”
Section: Resultsmentioning
confidence: 99%
“…The BMC approach can be extended not only to search for counter-example but also to verify state properties [5,3]. The methods proposed in [5] can only be applied to verify finite state systems.…”
Section: Formalizationmentioning
confidence: 99%
“…Dadurch, dass während der Generierung des Zustandsraums keine Interaktion möglich ist, muss der Modellprüfer mittels Heuristiken automatisch mit Situationen umgehen, in denen die Zustandsräume sehr groß oder sogar unendlich sind. Es gibt inzwischen Modellprüfer, die mit eingeschränkten Klassen unendlicher Zustandsräumen umgehen können, zum Beispiel [21,33]. Diese Modellprüfer unterliegen jedoch in der Regel an anderer Stelle so starker Einschränkungen, dass ein Einsatz für die Verifikation von Asbru nicht möglich ist.…”
Section: Generierung Des Abstrahierten Modellsunclassified
“…This is the case of our previous solver MX-SOLVER [NMA + 02] and also that of [MRS02] where it was called "lemmas on demand". In [NMA + 02] the following strategy is used: a conjunction of numerical constraints that need to be satisfied under the current assignment is maintained, represented as a DBM (Difference Bound Matrix).…”
Section: Incremental Approachesmentioning
confidence: 99%