{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T16:24:04Z","timestamp":1694622244122},"reference-count":57,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2003,4]]},"abstract":"<jats:title>Abstract.<\/jats:title>\n          <jats:p>We describe how the tree identification phase of the IEEE 1394 high-performance serial bus (FireWire) protocol is modelled in Promela and verified using SPIN. The verification of arbitrary system configurations is discussed.<\/jats:p>","DOI":"10.1007\/s001650300004","type":"journal-article","created":{"date-parts":[[2003,12,10]],"date-time":"2003-12-10T21:38:13Z","timestamp":1071092293000},"page":"247-266","source":"Crossref","is-referenced-by-count":4,"title":["Using SPIN to Analyse the Tree Identification Phase of the IEEE 1394 High-Performance Serial Bus (FireWire) Protocol"],"prefix":"10.1145","volume":"14","author":[{"given":"M.","family":"Calder","sequence":"first","affiliation":[{"name":"Department of Computing Science, University of Glasgow, Glasgow, UK, , , , , , GB"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Miller","sequence":"additional","affiliation":[{"name":"Department of Computing Science, University of Glasgow, Glasgow, UK, , , , , , GB"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"p_1","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0020-0190(86)90071-2","article-title":"Limits for automatic verification of finite-state concurrent systems","volume":"22","author":"Ap","year":"1986","journal-title":"Information Processing Letters"},{"key":"p_2","volume-title":"editor","author":"Ara","year":"1999"},{"key":"p_3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44585-4","volume-title":"editors","author":"Berry G.","year":"2001"},{"key":"p_4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0890-5401(89)90026-6","article-title":"Reasoning about networks with many identical finite state processes","volume":"81","author":"Browne M. C.","year":"1989","journal-title":"Information and Computation"},{"key":"p_5","first-page":"40","volume-title":"Partial order reduction in presence of rendez-vous communication with unless and weak fairness. In [DGL99]","author":"Bos","year":"1999"},{"key":"p_6","first-page":"395","volume-title":"Verifying parameterized networks using abstraction and regular languages. In [LeS95]","author":"Clarke E. M.","year":"1995"},{"key":"p_7","first-page":"5","volume-title":"Model checking safety critical software with SPIN: an application to a railway interlocking system. In [Lan97]","author":"Cimatti A.","year":"1997"},{"key":"p_8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0022-0000(74)80051-6","article-title":"Theories of automata on \u03c9-tapes: a simplified approach","volume":"8","author":"Cho","year":"1974","journal-title":"Journal of Computer and System Sciences"},{"key":"p_9","unstructured":"[CaM] Calder M. and Miller A.: Veriscope publications web site: http:\/\/www.dcs.gla.ac.uk\/research\/veriscope\/publications.html."},{"key":"p_11","first-page":"143","volume-title":"Using SPIN for feature interaction analysis: a case study. In [Dwy01]","author":"Ca","year":"2001"},{"key":"p_12","volume-title":"Formal verification of arbitrary network topologies. In [Ara99]","author":"Cr","year":"1999"},{"key":"p_13","volume-title":"Data independent induction over structured networks. In [PDP00]","author":"Cr","year":"2000"},{"key":"p_14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-48234-2","volume-title":"editors","author":"Dams D.","year":"1999"},{"key":"p_15","first-page":"105","volume-title":"Proceedings of ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM'99)","author":"Dw","year":"1999"},{"key":"p_16","series-title":"Lecture Notes in Computer Science","volume-title":"editor","author":"Dwy","year":"2001"},{"key":"p_17","first-page":"236","volume-title":"Reducing model checking of the many to the few. In [McA00]","author":"Em","year":"2000"},{"key":"p_18","first-page":"85","volume-title":"Reasoning about rings. In [POP95]","author":"Em","year":"1995"},{"key":"p_19","first-page":"70","volume-title":"13th IEEE Symposium on Logic in Computer Science","author":"Em","year":"1998"},{"key":"p_20","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","volume-title":"editors","author":"Gregoire J.-Ch.","year":"1996"},{"key":"p_21","series-title":"Lecture Notes in Computer Science","volume-title":"Partial Order Methods for the Verification of Concurrent Systems","author":"God","year":"1996"},{"key":"p_22","first-page":"3","volume-title":"Proceedings of the 15th International Conference on Protocol Specification Testing and Verification (PSTV '95)","author":"Gerth R.","year":"1995"},{"issue":"3","key":"p_23","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1145\/146637.146681","article-title":"Reasoning about systems with many processes","volume":"39","author":"Ge","year":"1992","journal-title":"Journal of the ACM"},{"key":"p_25","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1016\/0169-7552(93)90095-L","article-title":"Design and validation of protocols: a tutorial","volume":"25","author":"Hol","year":"1993","journal-title":"Computer Networks and ISDN Systems"},{"issue":"5","key":"p_26","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1109\/32.588521","article-title":"The model checker Spin","volume":"23","author":"Hol","year":"1997","journal-title":"IEEE Transactions on Software Engineering"},{"key":"p_27","volume-title":": State compression in Spin: recursive indexing and compression training runs. In [Lan97]","author":"Hol","year":"1997"},{"issue":"3","key":"p_28","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1023\/A:1008696026254","article-title":"An analysis of bitstate hashing","volume":"13","author":"Hol","year":"1998","journal-title":"Formal Methods in System Design"},{"key":"p_29","first-page":"232","volume-title":": The engineering of a model checker: the gnu i-protocol case study revisited. In [DGLM99]","author":"Hol","year":"1999"},{"issue":"3","key":"p_30","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/s100090050034","article-title":"A minimized automaton representation of reachable states","volume":"2","author":"Ho","year":"1999","journal-title":"International Journal on Software Tools for Technology Transfer"},{"issue":"4","key":"p_31","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/s100090050043","article-title":"Model checking JAVA programs using JAVA PathFinder","volume":"2","author":"Ha","year":"2000","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"p_32","first-page":"481","volume-title":"Software model checking: extracting verification models from source code. In [WCG99]","author":"Ho","year":"1999"},{"key":"p_33","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00625968","article-title":"Better verification through symmetry","volume":"9","author":"Ip","year":"1996","journal-title":"Formal Methods in System Design"},{"key":"p_34","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1008723125149","article-title":"Verifying systems with replicated components","volume":"14","author":"Ip","year":"1999","journal-title":"Mur\u03c6. Formal Methods in System Design"},{"key":"p_35","volume-title":"IEEE Standard for a High Performance Serial Bus Std 1394-1995","year":"1995"},{"key":"p_36","volume-title":"IEEE Standard for a High Performance Serial Bus (Supplement) Std 1394a-2000","year":"2000"},{"issue":"4","key":"p_37","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/s100090050045","article-title":"Formalization and validation of the General Inter-ORB Protocol (GIOP) using PROMELA and SPIN","volume":"2","author":"Ka","year":"2000","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"p_38","series-title":"Lecture Notes in Computer Science","volume-title":"editor","author":"Kap","year":"1992"},{"key":"p_39","first-page":"239","volume-title":"Proceedings of the Eighth Annual ACM Symposium on Principles of Distrubuted Computing","author":"Ku","year":"1989"},{"issue":"3","key":"p_40","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF01383832","article-title":"A structural linearization principle for processes","volume":"5","author":"Kurshan R. P.","year":"1994","journal-title":"Formal Methods in System Design"},{"key":"p_41","volume-title":"Computer-Aided Reasoning: An Approach","author":"Kaufmann M.","year":"2000"},{"key":"p_42","volume-title":"Twente University","author":"Lan","year":"1997"},{"key":"p_43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60218-6","volume-title":"editors","author":"Le","year":"1995"},{"key":"p_44","volume-title":"Creating a validated implementation of the steam boiler control. In [Lan97]","author":"Lo","year":"1997"},{"key":"p_45","series-title":"Lecture Notes in Computer Science","volume-title":"editor","author":"Mc","year":"2000"},{"key":"p_47","volume-title":"editors","author":"Maharaj S.","year":"2001"},{"issue":"4","key":"p_48","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s100090050041","article-title":"Issues in slicing PROMELA and its applications to model checking, protocol understanding, and simulation","volume":"2","author":"Mi","year":"2000","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"p_49","first-page":"748","volume-title":"PVS: a prototype verification system. In [Kap92]","author":"Owre S.","year":"1992"},{"key":"p_50","volume-title":"Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'00)","year":"2000"},{"key":"p_51","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF00121262","article-title":"Combining partial order reductions with on-the-fly model checking","volume":"8","author":"Pel","year":"1996","journal-title":"Formal Methods in System Design"},{"key":"p_52","first-page":"233","volume-title":"Partial order reduction: linear and branching temporal logics and process algebras. In [PPH96]","author":"Pel","year":"1996"},{"key":"p_53","volume-title":"Conference Record of the 22nd Annual ACM Symposium on Principles of Programming Languages (POPL '95)","year":"1995"},{"key":"p_54","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","volume-title":"editors","author":"Peled D. A.","year":"1996"},{"key":"p_55","first-page":"25","volume-title":"Automated inductive verification of parameterized protocols. In [BCF01]","author":"Ro","year":"2001"},{"key":"p_56","series-title":"Lecture Notes in Computer Science","volume-title":"editor","author":"Sif","year":"1989"},{"key":"p_57","first-page":"185","volume-title":"Memory efficient state storage in Spin. In [GHP96]","author":"Vi","year":"1996"},{"key":"p_58","first-page":"332","volume-title":"Proceedings, Symposium on Logic in Computer Science","author":"Va","year":"1986"},{"key":"p_59","series-title":"International Federation For Information Processing","volume-title":"editors","author":"Wu J.","year":"1999"},{"key":"p_60","first-page":"68","volume-title":"Properties of large sets of processes with network invariants (extended abstract). In [Sif89]","author":"Wo","year":"1989"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s001650300004.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s001650300004\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/s001650300004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:41:24Z","timestamp":1641483684000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/s001650300004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":57,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["10.1007\/s001650300004"],"URL":"https:\/\/doi.org\/10.1007\/s001650300004","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}