B2M: A semantic based tool for BLIF hardware descriptions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1954, Issue , 2000, Pages 91-107

  Basin, David ^a   Friedrich, Stefan ^a   Mödersheim, Sebastian ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; COMPUTER HARDWARE; EQUIVALENCE CLASSES; FORMAL LOGIC; FORMAL METHODS; HARDWARE; SAFETY TESTING; SEMANTICS;

AUTOMATIC VERIFICATION; CIRCUIT DESCRIPTION; DENOTATIONAL SEMANTICS; EQUIVALENCE TESTING; HARDWARE DESCRIPTIONS; HIERARCHICAL DESCRIPTION; SYMBOLIC REASONING; WEAK MONADIC SECOND-ORDER LOGIC;

COMPUTER HARDWARE DESCRIPTION LANGUAGES;

EID: 35248851773     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (14)

1. B. Alpern and F. B. Schneider. Defining liveness. Information Processing Letters, 21(4): 181-185, 7 October 1985.
2. A. Ayari and D. Basin. Bounded model construction for monadic second-order logics. In 12th International Conference on Computer-Aided Verification (CAV'00), number 1855 in Lecture Notes in Computer Science, pages 99-113, Chicago, USA, July 2000. Springer-Verlag.
3. D. Basin and S. Friedrich. Combining WS1S and HOL. In D.M. Gabbay and M. de Rijke, editors, Frontiers of Combining Systems 2, pages 39-56. Research Studies Press/Wiley, 2000.
4. D. Basin and N. Klarlund. Automata based symbolic reasoning in hardware verification. The Journal of Formal Methods in Systems Design, 13(3): 255-288, 1998.
5. M. Gordon. Why higher-order logic is a good formalism for specifying and verifying hardware. In G. J. Milne and P. A. Subrahmanyam, editors, Formal Aspects of VLSI Design. North-Holland, 1986.
6. J.G. Henriksen, J. Jensen, M. Jørgensen, N. Klarlund, B. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In TACAS '95, LNCS 1019, 1996.
7. Y. Kukimoto. BLIF-MV. 1996. Availlable at http://www-cad.eecs.berkeley.edu/Respep/Research/vis/.
8. A. Meyer. Weak monadic second-order theory of one successor is not elementaryrecursive. In LOGCOLLOQ: Logic Colloquium. LNM 453, Springer, 1975.
9. F. Morawietz and T. Cornell. On the recognizibility of relations over a tree definable in a monadic second-order tree description language. Research Report SFB 340-Report 85, 1997.
10. A methodology for verification of real-time systems. Availlable at http://www-cad.eecs.berkeley.edu/Respep/Research/hsis/.
11. J. W. Thatcher and J. B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2(1): 57-81, 1967.
12. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 4. MIT Press/Elsevier, 1990.
13. VIS Group. VIS user's manual. Availlable at http://www-cad.eecs.berkeley.edu/Respep/Research/vis/.
14. VIS Group. VIS: A system for Verification and Synthesis. In R. Alur and T. Henzinger, editors, Proceedings of CAV '96, LNCS 1102, pages 428-432. Springer, 1996.