Cited By
View all- Stern UDill D(2001)Parallelizing the Murφ VerifierFormal Methods in System Design10.1023/A:100877132465218:2(117-129)Online publication date: 1-Mar-2001
Finite state machine verification on MIMD machines
Authors: 
Nand Kumar, Ranga VemuriAuthors Info & Claims
Nand Kumar, Ranga VemuriAuthors Info & Claims
References
[1]
P. Ashar, A. Ghosh, S. Devadas, and A.R. Newton, "Implicit State Transition Graphs: Applications to Sequential Logic Synthesis and Test", Proceedings o} ICCAD, Santa Clara, pp. 84-87, November 1990.
[2]
P. Camurati, M. Gilli, P. Prinetto, and M. Sonza Reorda, "Proving Finite State Machines correct with an automatonbased method", IEEE First Great Lakes Symposium on VLSI, pp. 255-258, 1991.
[3]
H. Cho, G. Hachtd, S-W. Jeong, B. Plessier, E. Schwarz, and F. Somenzi, "ATPG Aspects of FSM Verification", Proceedings of ICCAD, Santa Clara, pp. 134-137, November 1990.
[4]
O. Coudert, C. Berthet, and J.C. Mac{re, "Verification of Synchronous Sequential Machines Based on Symbolic Execution", Proceedings of the Workshop on Automatic Verification Methods }or Finite State Systems, Grenoble, France, June 1989.
[5]
O. Coudert, C. Berthet, and J.C. Madre, "Verification of Sequential Machines Using Boolean Functional Vectors", Pro. ceedings of the IFIP international Workshop on Applied Formal Methods for Correct VLSI Design, Leuven, pp. 111-128, November 1989.
[6]
O. Coudert and J.C. Madre, "A Unified Framework for the Formal Verification of Sequential Circuits", Proceedings of ICCAD, Santa Clara, pp. 126--129, November 1990.
[7]
E.W. Dijkstra and C.S. Scholten, "Termination Detection for Diffusing Computations", Inf. Process. Lett., Vol. 11, No. 1, pp. 1-4, August 1980.
[8]
S. Devadas, H-K.T. Ms, A.R. Newton, "On the Verification of Sequential Machines at Differing Levels of Abstraction", IEEE Transactions on Computer-Aided Design, Vol. 7, No. 6, pp. 713-722, June 1988.
[9]
A. Ghosh, S. Devadas, A.R. Newton, "Verification of Interacting Sequential Circuits", Proceedings of the ~Tth A CM/IEEE Design Automation Conference, pp. 213-219, June 1990.
[10]
G.D. Hachtel and R.M. Jacoby, "Verification Algorithms for VLSI Synthesis", IEEE Transactions on Computer-Aided Design, Vol. 7, No. 5, pp. 616-640, May 1988.
[11]
S.H. Hwang, A.R. Newton, "An Efficient Verifier for Finite State Machines", IEEE Transactions on Computer-Aided Design, Vol. 10, No. 3, pp. 326-334, March 1991.
[12]
Z. Kohavi, Switching and Finite Automata Theory, McGraw-Hill, New York, 1970.
[13]
H-K.T. Ms, S. Devadas, R-S. Wei, and A. Sangiovanni- Vincentelli, "Logic Verification Algorithms and Their Parallel Implementation", IEEE Transactions on Computer-Aided Design, Vol. 8, No. 2, pp. 181-189, February 1989.
[14]
J. Minre, ~nd K.M. Chandy, "Termination Detection of Diffusing Computations in Communicating Sequential Processes", A CM Transactions on Programming Languages and Systems, Vol. 4, No. 1, pp. 37'-43, January 1982.
[15]
M.J. Quinn, Designing Efficient Algorithms for Parallel Computersd', McGraw-Hill, 1987".
[16]
M. Raynal, Distributed Algorithms and Protocols, John Wiley & Sons Ltd., 1988.
[17]
Ed Surma, "Extensible Software Platform Software Development Environment Programmer's Guide", MCC Technical Report: ACA-ESP-223-88, August 1990.
Index Terms
- Finite state machine verification on MIMD machines
Recommendations
Generating finite state machines from abstract state machines
ISSTA '02: Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysisWe give an algorithm that derives a finite state machine (FSM) from a given abstract state machine (ASM) specification. This allows us to integrate ASM specs with the existing tools for test case generation from FSMs. ASM specs are executable but have ...
Generating finite state machines from abstract state machines
We give an algorithm that derives a finite state machine (FSM) from a given abstract state machine (ASM) specification. This allows us to integrate ASM specs with the existing tools for test case generation from FSMs. ASM specs are executable but have ...
Simulated Annealing Based Parallel State Assignment of Finite State Machines
Simulated annealing is an effective tool in many optimization problems in VLSI CAD but its time requirements are prohibitive. In this paper, we report parallel algorithms for a well established simulated annealing based algorithm for the state ...
Comments
Information & Contributors
Information
Published In
Sponsors
- SIGDA: ACM Special Interest Group on Design Automation
- IEEE-CS: Computer Society
Publisher
IEEE Computer Society Press
Washington, DC, United States
Publication History
Published: 01 November 1992
Check for updates
Qualifiers
- Article
Upcoming Conference
DAC '25
- Sponsor:
- sigda
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 151Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)2
Reflects downloads up to 03 Sep 2024
Other Metrics
Citations
Cited By
View all- Stern UDill D(2001)Parallelizing the Murφ VerifierFormal Methods in System Design10.1023/A:100877132465218:2(117-129)Online publication date: 1-Mar-2001
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.
Sign in