{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:41:15Z","timestamp":1778298075362,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Formal Methods in System Design"],"published-print":{"date-parts":[[1999,5]]},"DOI":"10.1023\/a:1008723125149","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T11:37:32Z","timestamp":1040557052000},"page":"273-310","source":"Crossref","is-referenced-by-count":35,"title":["Verifying Systems with Replicated Components in Mur\u03d5"],"prefix":"10.1007","volume":"14","author":[{"given":"C. Norris","family":"Ip","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David L.","family":"Dill","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"204573_CR1","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0020-0190(86)90071-2","volume":"22","author":"K.R. Apt","year":"1986","unstructured":"K.R. Apt and D.C. Kozen, \u201cLimits for automatic verification of finite-state concurrent systems,\u201d Information Processing Letters, Vol. 22, pp. 307\u2013309, 1986.","journal-title":"Information Processing Letters"},{"key":"204573_CR2","doi-asserted-by":"crossref","unstructured":"F. Balarin and A.L. Sangiovanni-Vincentelli, \u201cOn the automatic computation of network invariants,\u201d in 6th International Conference on Computer-Aided Verification, June 1994.","DOI":"10.1007\/3-540-58179-0_58"},{"key":"204573_CR3","unstructured":"J. Billing, M.C. Wilbur-Ham, and M.Y. Bearman, \u201cAutomated protocol verification,\u201d Protocol Specification, Testing, and Verification, V, 1986."},{"issue":"1","key":"204573_CR4","first-page":"11","volume":"6","author":"A. Bouajjani","year":"1993","unstructured":"A. Bouajjani, S. Bensalem, S. Graf, C. Loiseaux, and J. Sifakis, \u201cProperty preserving abstractions for the verification of concurrent systems,\u201d Formal Methods in System Design, Vol. 6,No. 1, pp. 11\u201344, 1993.","journal-title":"Formal Methods in System Design"},{"key":"204573_CR5","doi-asserted-by":"crossref","unstructured":"S. Chandra, B. Richards, and J.R. Larus, \u201cTeapot: Language support for writing memory coherence protocols,\u201d ACM SIGPLAN '96: Programming Language Design and Implementation, May 1996.","DOI":"10.1145\/231379.231430"},{"key":"204573_CR6","doi-asserted-by":"crossref","unstructured":"E.M. Clarke and O. Grumberg, \u201cAvoiding the state explosion problem in temporal logic model checking algorithms,\u201d in 6th Annual ACM Symposium on Principle of Distributed Computing, pp. 294\u2013303, 1987.","DOI":"10.1145\/41840.41865"},{"key":"204573_CR7","doi-asserted-by":"crossref","unstructured":"E.M. Clarke, O. Grumberg, and S. Jha, \u201cVerifying parameterized networks using abstraction and regular languages,\u201d in 6th International Conference on Concurrency Theory, 1995.","DOI":"10.1007\/3-540-60218-6_30"},{"key":"204573_CR8","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot, \u201cAbstract interpretation and application to logic programs,\u201d Technical report, Ecole Polytechnique, Laboratoire d'Informatique, 1992.","DOI":"10.1093\/logcom\/2.4.511"},{"key":"204573_CR9","unstructured":"D. Dams, O. Grumberg, and R. Gerth, \u201cAbstract interpretation of reactive systems: Abstractions preserving \u2200CTL*, \u2203CTL* and CTL*,\u201d Programming Concepts, Methods and Calculi (PROCOMET), pp. 561\u2013581, 1994."},{"key":"204573_CR10","unstructured":"E.J. Dijkstra, \u201cInvariance and nondeterminacy,\u201d in Mathematical Logic and Programming Languages, Prentice-Hall, 1985."},{"key":"204573_CR11","doi-asserted-by":"crossref","unstructured":"D.L. Dill, \u201cThe Mur\u03d5 verification system,\u201d in 8th International Conference on Computer Aided Verification, pp. 390\u2013393, July\/Aug. 1996.","DOI":"10.1007\/3-540-61474-5_86"},{"key":"204573_CR12","doi-asserted-by":"crossref","unstructured":"D.L. Dill, A.J. Drexler, A.J. Hu, and C.H. Yang, \u201cProtocol verification as a hardware design aid,\u201d in IEEE International Conference on Computer Design: VLSI in Computers and Processors, pp. 522\u2013525, 1992.","DOI":"10.1109\/ICCD.1992.276232"},{"key":"204573_CR13","unstructured":"D.L. Dill, S. Park, and A. Nowatzyk, \u201cFormal specification of abstract memory models,\u201d in Research on Integrated Systems: Proceedings of the 1993 Symposium, pp. 38\u201352, March 1993."},{"key":"204573_CR14","doi-asserted-by":"crossref","unstructured":"E.A. Emerson, editor, Formal Methods in System Design, Special Issue on Symmetry in Automatic Verification, Kluwer Academic Publishers, Vol. 1,Nos. 1 and 2, Aug. 1996.","DOI":"10.1007\/BF00625966"},{"issue":"3","key":"204573_CR15","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1145\/146637.146681","volume":"39","author":"S.M. German","year":"1992","unstructured":"S.M. German and A.P. Sistla, \u201cReasoning about systems with many processes,\u201d Journal of Association for Computing Machinery, Vol. 39,No. 3, pp. 675\u2013735, 1992.","journal-title":"Journal of Association for Computing Machinery"},{"key":"204573_CR16","doi-asserted-by":"crossref","unstructured":"S. Graf, \u201cVerification of a distributed cache memory by using abstractions,\u201d in 6th International Conference on Computer-Aided Verification, pp. 207\u2013219, 1994.","DOI":"10.1007\/3-540-58179-0_55"},{"key":"204573_CR17","doi-asserted-by":"crossref","unstructured":"S. Graf and C. Loiseaux, \u201cA tool for symbolic program verification and abstraction,\u201d in 5th International Conference on Computer-Aided Verification, April 1993.","DOI":"10.1007\/3-540-56922-7_7"},{"key":"204573_CR18","doi-asserted-by":"crossref","unstructured":"G.J. Holzmann, Automated Protocol Validation in Argos, Assertion Proving and Scatter Searching, Computer Science Press, 1987.","DOI":"10.1109\/TSE.1987.233206"},{"key":"204573_CR19","unstructured":"C.N. Ip and D.L. Dill, \u201cBetter verification through symmetry,\u201d in 11th International Symposium on Computer Hardware Description Languages and Their Applications, pp. 87\u2013100, April 1993."},{"key":"204573_CR20","unstructured":"C.N. Ip and D.L. Dill, \u201cEfficient verification of symmetric concurrent systems,\u201d in IEEE International Conference on Computer Design: VLSI in Computers and Processors, pp. 230\u2013234, Oct. 1993."},{"issue":"s.1","key":"204573_CR21","first-page":"41","volume":"9","author":"C.N. Ip","year":"1996","unstructured":"C.N. Ip and D.L. Dill, \u201cBetter verification through symmetry,\u201d Formal Methods in System Design, Vol. 9,Nos. 1 and 2, pp. 41\u201375, Aug. 1996.","journal-title":"Formal Methods in System Design"},{"key":"204573_CR22","doi-asserted-by":"crossref","unstructured":"C.N. Ip and D.L. Dill, \u201cState reduction using reversible rules,\u201d in 33rd Design Automation Conference, pp. 564\u2013567, June 1996.","DOI":"10.1145\/240518.240625"},{"key":"204573_CR23","unstructured":"C.N. Ip, State Reduction Methods for Automatic Formal Verification, Ph.D. Thesis, Stanford University, Dec. 1996."},{"key":"204573_CR24","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF01383832","volume":"5","author":"R.P. Kurshan","year":"1994","unstructured":"R.P. Kurshan, M. Merritt, A. Orda, and S.R. Sachs, \u201cA structural linearization principle for processes,\u201d Formal Methods in System Design, Vol. 5, pp. 227\u2013244, 1994.","journal-title":"Formal Methods in System Design"},{"key":"204573_CR25","doi-asserted-by":"crossref","unstructured":"R.P. Kurshan and K. McMillan, \u201cA structural induction theorem for processes,\u201d in 8th ACM Symposium on Principles of Distributed Computing, pp. 239\u2013247, 1989.","DOI":"10.1145\/72981.72998"},{"key":"204573_CR26","doi-asserted-by":"crossref","unstructured":"D. Lenoski, J. Laudon, K. Gharachorloo, A. Gupta, and J. Hennessy, \u201cThe directory-based cache coherence protocol for the DASH multiprocessor,\u201d in 17th International Symposium on Computer Architecture, 1990.","DOI":"10.1145\/325164.325132"},{"key":"204573_CR27","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF00289237","volume":"21","author":"B.D. Lubachevsky","year":"1984","unstructured":"B.D. Lubachevsky, \u201cAn approach to automating the verification of compact parallel coordination programs I,\u201d Acta Informatica, Vol. 21, pp. 125\u2013169, 1984.","journal-title":"Acta Informatica"},{"key":"204573_CR28","unstructured":"S. Park, Computer Assisted Analysis of Multiprocessor Memory Systems, Section 4.3 on \u2018Verification Using A Finite State Method\u2019, Ph.D. Thesis, Stanford University, June 1994."},{"key":"204573_CR29","doi-asserted-by":"crossref","unstructured":"S. Park and D.L. Dill, \u201cAn executable specification, analyzer and verifier for RMO (relaxed memory order),\u201d in 7th ACM Symposium on Parallel Algorithms and Architectures, pp. 34\u201341, 1995.","DOI":"10.1145\/215399.215413"},{"key":"204573_CR30","doi-asserted-by":"crossref","unstructured":"G.L. Peterson, \u201cMyths about the mutual exclusion problem,\u201d Information Processing Letters, Vol. 12,No. 3, 1981.","DOI":"10.1016\/0020-0190(81)90106-X"},{"issue":"2","key":"204573_CR31","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1109\/71.406955","volume":"6","author":"F. Pong","year":"1995","unstructured":"F. Pong and M. Dubois, \u201cA new approach for the verification of cache coherence protocols,\u201d IEEE Transactions on Parallel and Distributed Systems, Vol. 6,No. 2, pp. 773\u2013787, 1995.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"204573_CR32","doi-asserted-by":"crossref","unstructured":"F. Pong, A. Nowatzyk, G. Aybay, and M. Dubois, \u201cVerifying distributed directory-based cache coherence protocols: S3.mp, a case study,\u201d in First International EURO-PAR Conference on Parallel Processing, 1995.","DOI":"10.1007\/BFb0020472"},{"key":"204573_CR33","unstructured":"F. Pong, Symbolic State Model: A New Approach for the Verification of Cache Coherence Protocols, Ph.D. Thesis, University of Southern California, 1995."},{"key":"204573_CR34","doi-asserted-by":"crossref","unstructured":"J.-K. Rho and F. Somenzi, \u201cAutomatic generation of network invariants for the verification of iterative sequential systems,\u201d in 5th International Conference on Computer-Aided Verification, June 1993.","DOI":"10.1007\/3-540-56922-7_11"},{"key":"204573_CR35","unstructured":"K. Shibata, Y. Hirakawa, A. Takura, and T. Ohta, \u201cReachability analysis for specified processes in a behavior description,\u201d IEICE Transaction on Communication, Vol. E76-B,No. 11, Nov. 1993."},{"key":"204573_CR36","unstructured":"A.P. Sistla and S.M. German, \u201cReasoning with many processes,\u201d Symposium on Logic in Computer Science, pp. 138\u2013152, 1987."},{"key":"204573_CR37","doi-asserted-by":"crossref","unstructured":"U. Stern and D.L. Dill, \u201cAutomatic verification of the SCI cache coherence protocol,\u201d Correct Hardware Design and Verification Methods: IFIP WG10.5 Advanced Research Working Conference Proceedings, 1995.","DOI":"10.1007\/3-540-60385-9_2"},{"key":"204573_CR38","unstructured":"D. Weaver and T. Germond, editors, The SPARC Architecture Manual Version 9, Appendix D on \u2018Formal Specification of the Memory Models\u2019, Prentice Hall, 1994."},{"key":"204573_CR39","doi-asserted-by":"crossref","unstructured":"P. Wolper and V. Lovinfosse, \u201cVerifying properties of large sets of processes with network invariants,\u201d in Automatic Verification Methods for Finite State Systems, volume 407 of LNCS, Springer-Verlag, pp. 68\u201380. 1989.","DOI":"10.1007\/3-540-52148-8_6"},{"key":"204573_CR40","doi-asserted-by":"crossref","unstructured":"L. Yang, D. Gao, J. Mostoufi, R. Joshi, and P. Loewenstein, \u201cSystem design methodology of UltraSPARC-I,\u201d in 32nd Design Automation Conference, pp. 7\u201312, 1995.","DOI":"10.1145\/217474.217481"},{"key":"204573_CR41","doi-asserted-by":"crossref","unstructured":"P. Zafiropulo, C.H. West, H. Rudin, D.D. Cowan, and D. Brand, \u201cTowards analyzing and synthesizing protocols,\u201d IEEE Transactions on Communications, Vol. 28,No. 4, April 1980.","DOI":"10.1109\/TCOM.1980.1094687"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008723125149.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008723125149\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008723125149.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T03:55:23Z","timestamp":1754366123000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008723125149"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["204573"],"URL":"https:\/\/doi.org\/10.1023\/a:1008723125149","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"value":"0925-9856","type":"print"},{"value":"1572-8102","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}