Article

BDD-Based Debugging Of Design Using Language Containment and Fair CTL

Authors:

Ramin Hojati,

Robert K. Brayton,

Robert P. KurshanAuthors Info & Claims

CAV '93: Proceedings of the 5th International Conference on Computer Aided Verification

Pages 41 - 58

Published: 28 June 1993 Publication History

Abstract

No abstract available.

Cited By

View all

Kember MTran LGao GDay NChechik MStrüber DVarró D(2019)Extracting counterexamples from transitive-closure-based model checkingProceedings of the 11th International Workshop on Modelling in Software Engineerings10.1109/MiSE.2019.00015(47-54)Online publication date: 26-May-2019
https://dl.acm.org/doi/10.1109/MiSE.2019.00015
Ji YLiu HHuang H(2018)iSpanProceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis10.5555/3291656.3291734(1-12)Online publication date: 11-Nov-2018
https://dl.acm.org/doi/10.5555/3291656.3291734
Ji YLiu HHuang H(2018)iSpanProceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis10.1109/SC.2018.00061(1-12)Online publication date: 11-Nov-2018
https://dl.acm.org/doi/10.1109/SC.2018.00061
Show More Cited By

Recommendations

Bounded Semantics of CTL and SAT-Based Verification
ICFEM '09: Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering

Bounded model checking has been proposed as a complementary approach to BDD based symbolic model checking for combating the state explosion problem, esp. for efficient error detection. This has led to a lot of successful work with respect to error ...
Model Checking CTL*[DC]
TACAS 2001: Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems

We define a logic called CTL*[DC] which extends CTL* with ability to specify past-time and quantitative timing properties using the formulae of Quantified Discrete-time Duration Calculus (QDDC). Alternately, we can consider CTL*[DC] as extending logic ...
Transition predicate abstraction and fair termination
POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Predicate abstraction is the basis of many program verification tools. Until now, the only known way to overcome the inherent limitation of predicate abstraction to safety properties was to manually annotate the finite-state abstraction of a program. We ...

Comments

Information & Contributors

Information

Published In

CAV '93: Proceedings of the 5th International Conference on Computer Aided Verification

June 1993

516 pages

ISBN:3540569227

Editor:
Costas Courcoubetis

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 28 June 1993

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kember MTran LGao GDay NChechik MStrüber DVarró D(2019)Extracting counterexamples from transitive-closure-based model checkingProceedings of the 11th International Workshop on Modelling in Software Engineerings10.1109/MiSE.2019.00015(47-54)Online publication date: 26-May-2019
https://dl.acm.org/doi/10.1109/MiSE.2019.00015
Ji YLiu HHuang H(2018)iSpanProceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis10.5555/3291656.3291734(1-12)Online publication date: 11-Nov-2018
https://dl.acm.org/doi/10.5555/3291656.3291734
Ji YLiu HHuang H(2018)iSpanProceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis10.1109/SC.2018.00061(1-12)Online publication date: 11-Nov-2018
https://dl.acm.org/doi/10.1109/SC.2018.00061
Attie PBab KSakr M(2017)Model and Program Repair via SAT SolvingACM Transactions on Embedded Computing Systems10.1145/314742617:2(1-25)Online publication date: 7-Dec-2017
https://dl.acm.org/doi/10.1145/3147426
(2015)Model and program repair via SAT solvingProceedings of the 2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign10.1109/MEMCOD.2015.7340481(148-157)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1109/MEMCOD.2015.7340481
Hong SRodia NOlukotun KGropp WMatsuoka S(2013)On fast parallel detection of strongly connected components (SCC) in small-world graphsProceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis10.1145/2503210.2503246(1-11)Online publication date: 17-Nov-2013
https://dl.acm.org/doi/10.1145/2503210.2503246
Rozier K(2011)SurveyComputer Science Review10.1016/j.cosrev.2010.06.0025:2(163-203)Online publication date: 1-May-2011
https://dl.acm.org/doi/10.1016/j.cosrev.2010.06.002
Hong HCha SLee ISokolsky OUral HClarke LDillon LTichy W(2003)Data flow testing as model checkingProceedings of the 25th International Conference on Software Engineering10.5555/776816.776844(232-242)Online publication date: 3-May-2003
https://dl.acm.org/doi/10.5555/776816.776844
Černá IPelánek R(2003)Distributed explicit fair cycle detectionProceedings of the 10th international conference on Model checking software10.5555/1767111.1767115(49-73)Online publication date: 9-May-2003
https://dl.acm.org/doi/10.5555/1767111.1767115
Beer IBen-David SEisner CRodeh Y(2001)Efficient Detection of Vacuity in Temporal Model CheckingFormal Methods in System Design10.1023/A:100877961053918:2(141-163)Online publication date: 1-Mar-2001
https://dl.acm.org/doi/10.1023/A%3A1008779610539
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Recommendations

Bounded Semantics of CTL and SAT-Based Verification

Model Checking CTL*[DC]

Transition predicate abstraction and fair termination

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations