{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T04:59:29Z","timestamp":1773723569474,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540687603","type":"print"},{"value":"9783540687610","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11955757_9","type":"book-chapter","created":{"date-parts":[[2006,12,11]],"date-time":"2006-12-11T04:34:20Z","timestamp":1165811660000},"page":"79-93","source":"Crossref","is-referenced-by-count":15,"title":["Symmetry Reduction for B by Permutation Flooding"],"prefix":"10.1007","author":[{"given":"Michael","family":"Leuschel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Butler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Corinna","family":"Spermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edd","family":"Turner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624162","volume-title":"The B-Book","author":"J.-R. Abrial","year":"1996","unstructured":"Abrial, J.-R.: The B-Book. Cambridge University Press, Cambridge (1996)"},{"key":"9_CR2","first-page":"731","volume-title":"DAC","author":"F.A. Aloul","year":"2002","unstructured":"Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Solving difficult SAT instances in the presence of symmetry. In: DAC, pp. 731\u2013736. ACM Press, New York (2002)"},{"issue":"5","key":"9_CR3","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1109\/TC.2006.75","volume":"55","author":"F.A. Aloul","year":"2006","unstructured":"Aloul, F.A., Sakallah, K.A., Markov, I.L.: Efficient symmetry breaking for boolean satisfiability. IEEE Trans. Computers\u00a055(5), 549\u2013558 (2006)","journal-title":"IEEE Trans. Computers"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/11526841_16","volume-title":"FM 2005: Formal Methods","author":"M. Butler","year":"2005","unstructured":"Butler, M., Leuschel, M.: Combining CSP and B for specification and property verification. In: Fitzgerald, J.S., Hayes, I.J., Tarlecki, A. (eds.) FM 2005. LNCS, vol.\u00a03582, pp. 221\u2013236. Springer, Heidelberg (2005)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/3-540-56922-7_37","volume-title":"Computer Aided Verification","author":"E.M. Clarke","year":"1993","unstructured":"Clarke, E.M., Filkorn, T., Jha, S.: Exploiting symmetry in temporal logic model checking. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 450\u2013462. Springer, Heidelberg (1993)"},{"key":"9_CR6","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"9_CR7","unstructured":"Crawford, J.M., Ginsberg, M.L., Luks, E.M., Roy, A.: Symmetry-breaking predicates for search problems. In: KR 1996, pp. 148\u2013159 (1996)"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1145\/996566.996712","volume-title":"DAC","author":"P.T. Darga","year":"2004","unstructured":"Darga, P.T., Liffiton, M.H., Sakallah, K.A., Markov, I.L.: Exploiting structure in symmetry detection for CNF. In: Malik, S., Fix, L., Kahng, A.B. (eds.) DAC, pp. 530\u2013534. ACM Press, New York (2004)"},{"issue":"1\/2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF00625970","volume":"9","author":"E.A. Emerson","year":"1996","unstructured":"Emerson, E.A., Sistla, A.P.: Symmetry and model checking. Formal Methods in System Design\u00a09(1\/2), 105\u2013131 (1996)","journal-title":"Formal Methods in System Design"},{"key":"9_CR10","unstructured":"Flannery, S.: In Code: A Mathematical Adventure. Profile Books Ltd (2001)"},{"key":"9_CR11","unstructured":"Ip, C.N., Dill, D.L.: Better verification through symmetry. In: Computer Hardware Description Languages and their Applications, pp. 97\u2013111 (1993)"},{"key":"9_CR12","volume-title":"Combinatorial Algorithms: Generation, Enumeration, Search","author":"D.L. Kreher","year":"1999","unstructured":"Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms: Generation, Enumeration, Search. CRC Press, Boca Raton (1999)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-45614-7_2","volume-title":"FME 2002: Formal Methods - Getting IT Right","author":"B. Legeard","year":"2002","unstructured":"Legeard, B., Peureux, F., Utting, M.: Automated boundary testing from Z and B. In: Eriksson, L.-H., Lindsay, P.A. (eds.) FME 2002. LNCS, vol.\u00a02391, pp. 21\u201340. Springer, Heidelberg (2002)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1007\/978-3-540-45236-2_46","volume-title":"FME 2003: Formal Methods","author":"M. Leuschel","year":"2003","unstructured":"Leuschel, M., Butler, M.: ProB: A model checker for B. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol.\u00a02805, pp. 855\u2013874. Springer, Heidelberg (2003)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/11576280_24","volume-title":"Formal Methods and Software Engineering","author":"M. Leuschel","year":"2005","unstructured":"Leuschel, M., Butler, M.: Automatic refinement checking for B. In: Lau, K.-K., Banach, R. (eds.) ICFEM 2005. LNCS, vol.\u00a03785, pp. 345\u2013359. Springer, Heidelberg (2005)"},{"key":"9_CR16","unstructured":"McKay, B.: Nauty users guide, Available at: \n                    \n                      http:\/\/cs.anu.edu.au\/people\/bdm\/nauty\/"},{"issue":"3-4","key":"9_CR17","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.cl.2004.02.002","volume":"30","author":"A.P. Sistla","year":"2004","unstructured":"Sistla, A.P.: Employing symmetry reductions in model checking. Computer Languages, Systems & Structures\u00a030(3-4), 99\u2013137 (2004)","journal-title":"Computer Languages, Systems & Structures"},{"issue":"4","key":"9_CR18","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1145\/1011508.1011511","volume":"26","author":"A.P. Sistla","year":"2004","unstructured":"Sistla, A.P., Godefroid, P.: Symmetry and reduced symmetry in model checking. ACM Trans. Program. Lang. Syst.\u00a026(4), 702\u2013734 (2004)","journal-title":"ACM Trans. Program. Lang. Syst."}],"container-title":["Lecture Notes in Computer Science","B 2007: Formal Specification and Development in B"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11955757_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:21:32Z","timestamp":1619493692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11955757_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540687603","9783540687610"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11955757_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}