{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T09:37:25Z","timestamp":1773653845159,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540646082","type":"print"},{"value":"9783540693390","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0028742","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:48:09Z","timestamp":1133419689000},"page":"159-171","source":"Crossref","is-referenced-by-count":10,"title":["Structural symmetry and model checking"],"prefix":"10.1007","author":[{"given":"Gurmeet","family":"Singh Manku","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramin","family":"Hojati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Brayton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,18]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"M. Agrawal and T. Thierauf. The Boolean Isomorphism Problem. In Proc. Symp. on Foundations of Computer Science, pp. 422\u2013430, October 1996.","DOI":"10.1109\/SFCS.1996.548501"},{"key":"17_CR2","unstructured":"R. K. Brayton et al. BLIF-MV: An Interchange Format for Design Verification and Synthesis. Technical Report UCB\/ERL M91\/97, UC Berkeley, November 1991."},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/43.275352","volume":"13","author":"J. R. Burch","year":"1994","unstructured":"J. R. Burch, E. M. Clarke, D. E. Long, K. L. McMillan, and D. L. Dill. Symbolic Model Checking for Sequential Circuit Verification. IEEE Tran. on Comp. Aided Design of Integrated Circuits and Sys., 13(4):401\u2013424, April 1994.","journal-title":"IEEE Tran. on Comp. Aided Design of Integrated Circuits and Sys."},{"issue":"1\/2","key":"17_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF00625969","volume":"9","author":"E. M. Clarke","year":"1996","unstructured":"E. M. Clarke, R. Enders, T. Filkorn, and S. Jha. Exploiting Symmetry in Temporal Logic Model Checking. Formal Meth. in Sys. Design, 9(1\/2):77\u2013104, 1996.","journal-title":"Formal Meth. in Sys. Design"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E. M. Clarke","year":"1986","unstructured":"E. M. Clarke, E. A. EMERSON, and A. P. Sistla. Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems, 8(2):244\u2013263, 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"17_CR6","unstructured":"S.-T. Cheng, G. York, and R. K. Brayton. VL2MV: A Compiler from Verilog to BLIF-MV, October 1993."},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"E. A. Emerson, S. Jha, and D. Peled. Combining Partial Order and Symmetry Reductions. In Proc. TACAS 97, pp. 19\u201334, April 1997.","DOI":"10.1007\/BFb0035378"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"E. A. Emerson and A. P. Sistla. Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata-theoretic Approach. In Proc. CAV 95, pp. 309\u2013324, July 1995.","DOI":"10.1007\/3-540-60045-0_59"},{"issue":"1\/2","key":"17_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF00625970","volume":"9","author":"E. A. Emerson","year":"1996","unstructured":"E. A. Emerson and A. P. Sistla. Symmetry and Model Checking. Formal Meth. in Sys. Design, 9(1\/2):105\u2013131, 1996.","journal-title":"Formal Meth. in Sys. Design"},{"key":"17_CR10","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0004-3702(83)80012-5","volume":"21","author":"G. Fowler","year":"1983","unstructured":"G. Fowler, R. HARALICK, et al. Efficient Graph Automorphism by Vertex Partitioning. Aritificial Intelligence, 21:245\u2013269, 1983.","journal-title":"Aritificial Intelligence"},{"key":"17_CR11","unstructured":"GAP: Groups, Algorithms and Programs, Version 3, Release 4. Available via ftp from ftp.math. rwth-aachen.de,directory \/pub\/gap."},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"V. GYURIS AND A. P. SISTLA. On-the-Fly Model Checking under Fairness that Exploits Symmetry. In Proc. CAV 97, Haifa, Israel, June 1997, pp. 232\u2013243, 1997.","DOI":"10.1007\/3-540-63166-6_24"},{"key":"17_CR13","unstructured":"C. M. Hoffman. On the Complexity of Intersecting Permutation Groups and its Relationship with Graph Isomorphism. Technical Report 4\/80, Instit\u00fct for Informatik und Praktische Mathematik, Christian-Albrechts-Universit\u00e4t Kiel, 1980."},{"issue":"1\/2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00625968","volume":"9","author":"C. N. Ip","year":"1996","unstructured":"C. N. Ip and D. L. Dill. Better Verification Through Symmetry. Formal Meth. in Sys. Design, 9(1\/2):41\u201376, 1996.","journal-title":"Formal Meth. in Sys. Design"},{"key":"17_CR15","unstructured":"Gurmeet Singh Manku. Structural Symmetries and Model Checking. Master's thesis UCB\/ERL M97\/92, University of California at Berkeley, 1997. Available as http:\/\/www-cad.eecs.berkeley.edu\/~manku\/papers\/ms.ps.gz."},{"key":"17_CR16","unstructured":"B. D. MCKAY. Practical Graph Isomorphism. In Proc. Tenth Manitoba Conf. on Numerical Math. and Computing, Winnepeg, 1980, vol 1, pp. 45\u201387, 1981."},{"key":"17_CR17","series-title":"Technical Report TR-CS-90-02","volume-title":"Nauty Users Guide (Version 1.5)","author":"B. D. McKay","year":"1990","unstructured":"B. D. McKay. Nauty Users Guide (Version 1.5). Technical Report TR-CS-90-02, Computer Science Department, Australian National University, Australia, 1990."},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"M. PANDEY AND E. BRYANT. Exploiting Symmetry when Verifying Transistor-Level Circuits by Symbolic Trajectory Evaluation. In Proc. CAV 97, Haifa, Israel, June 1997, pp. 244\u2013255, 1997.","DOI":"10.1007\/3-540-63166-6_25"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"J. VAN LEEUWEN. Graph Algorithms. In Algorithms and Complexity, volume A of Handbook of Theoretical Computer Science, pp. 525\u2013631. Elsevier Science, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50015-1"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028742","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T01:44:43Z","timestamp":1736127883000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028742"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646082","9783540693390"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0028742","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}