{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T15:41:08Z","timestamp":1648654868324},"reference-count":27,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Systems and Software"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1016\/0164-1212(90)90105-u","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T00:49:55Z","timestamp":1060303795000},"page":"3-20","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for analyzing concurrent software systems using derivatives"],"prefix":"10.1016","volume":"11","author":[{"given":"Allan M.","family":"Stavely","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0164-1212(90)90105-U_BIB1","article-title":"Flow Languages Are Recursively Enumerable","author":"Araki","year":"1978"},{"key":"10.1016\/0164-1212(90)90105-U_BIB2","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1109\/TSE.1986.6312944","article-title":"Constrained Expressions: Adding Analysis Capabilities to Design Methods for Concurrent Software Systems","volume":"SE-12","author":"Avrunin","year":"1986","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0164-1212(90)90105-U_BIB3","series-title":"Proc. Thirteenth ACM Symposium on Principles of Programming Languages","first-page":"173","article-title":"A Really Abstract Concurrent Model and Its Temporal Logic","author":"Barringer","year":"1986"},{"key":"10.1016\/0164-1212(90)90105-U_BIB4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","article-title":"Process Algebra for Synchronous Communication","volume":"60","author":"Bergstra","year":"1984","journal-title":"Information and Control"},{"key":"10.1016\/0164-1212(90)90105-U_BIB5","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/321239.321249","article-title":"Derivatives of Regular Expressions","volume":"11","author":"Brzozowski","year":"1964","journal-title":"J. ACM"},{"key":"10.1016\/0164-1212(90)90105-U_BIB6","author":"Garey","year":"1979"},{"key":"10.1016\/0164-1212(90)90105-U_BIB7","first-page":"72","article-title":"Finite-State Testing of Structured Programs","author":"Henderson","year":"1974"},{"key":"10.1016\/0164-1212(90)90105-U_BIB8","series-title":"Proc. 1975 International Conf. on Reliable Software","first-page":"221","article-title":"Finite-State Modelling in Program Development","author":"Henderson","year":"1975"},{"key":"10.1016\/0164-1212(90)90105-U_BIB9","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating Sequential Processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/0164-1212(90)90105-U_BIB10","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/0164-1212(90)90105-U_BIB11","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"issue":"2","key":"10.1016\/0164-1212(90)90105-U_BIB12","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1145\/3318.3322","article-title":"CIRCAL and the Representation of Communication, Concurrency, and Time","volume":"7","author":"Milne","year":"1985","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"10.1016\/0164-1212(90)90105-U_BIB13","article-title":"A Calculus of Communicating Systems","volume":"92","author":"Milner","year":"1980"},{"key":"10.1016\/0164-1212(90)90105-U_BIB14","series-title":"Proc. Fifth ACM Symposium on Principles of Programming Languages","first-page":"185","article-title":"Complexity of Expressions Allowing Concurrency","author":"Ogden","year":"1978"},{"key":"10.1016\/0164-1212(90)90105-U_BIB15","article-title":"The Software Design Technology Project: Evaluation of the Analysis Tools","author":"Orr","year":"1983"},{"key":"10.1016\/0164-1212(90)90105-U_BIB16","article-title":"Modeling and Analysis of Supervisory Systems","author":"Riddle","year":"1972"},{"key":"10.1016\/0164-1212(90)90105-U_BIB17","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0096-0551(79)90008-0","article-title":"An Approach to Software System Behavior Description","volume":"4","author":"Riddle","year":"1979","journal-title":"Computer Languages"},{"key":"10.1016\/0164-1212(90)90105-U_BIB18","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/TSE.1978.231501","article-title":"Software Descriptions with Flow Expressions","volume":"SE-4","author":"Shaw","year":"1978","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0164-1212(90)90105-U_BIB19","series-title":"Software Development Tools","first-page":"148","article-title":"Software Specification Languages Based on Regular Expressions","author":"Shaw","year":"1980"},{"key":"10.1016\/0164-1212(90)90105-U_BIB20","article-title":"The Membership Problem for Behaviors of Concurrent Software Systems","author":"Stavely","year":"1979"},{"key":"10.1016\/0164-1212(90)90105-U_BIB21","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0164-1212(83)90026-2","article-title":"Modeling and Projection in Software Development","volume":"3","author":"Stavely","year":"1983","journal-title":"J. Systems and Software"},{"key":"10.1016\/0164-1212(90)90105-U_BIB22","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0164-1212(85)90019-6","article-title":"Inference from Models of Software Systems","volume":"5","author":"Stavely","year":"1985","journal-title":"J. Systems and Software"},{"key":"10.1016\/0164-1212(90)90105-U_BIB23","series-title":"Proc. Eighth International Conference on Software Engineering","first-page":"111","article-title":"A Collection of Software Tools for Analyzing Designs of Concurrent Software Systems","author":"Stavely","year":"1985"},{"key":"10.1016\/0164-1212(90)90105-U_BIB24","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1145\/69586.69587","article-title":"A General-Purpose Algorithm for Analyzing Concurrent Programs","volume":"26","author":"Taylor","year":"1983","journal-title":"Commun. ACM"},{"key":"10.1016\/0164-1212(90)90105-U_BIB25","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF00263928","article-title":"Complexity of Analyzing the Synchronization Structure of Concurrent Programs","volume":"19","author":"Taylor","year":"1983","journal-title":"Acta Informatica"},{"key":"10.1016\/0164-1212(90)90105-U_BIB26","article-title":"Algorithms for Finite-State Testing of Concurrent Software Systems","author":"Titus","year":"1986"},{"key":"10.1016\/0164-1212(90)90105-U_BIB27","article-title":"Derivatives of Message Transfer Expressions","author":"Wileden","year":"1976"}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016412129090105U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016412129090105U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T22:57:28Z","timestamp":1552604248000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016412129090105U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["016412129090105U"],"URL":"https:\/\/doi.org\/10.1016\/0164-1212(90)90105-u","relation":{},"ISSN":["0164-1212"],"issn-type":[{"value":"0164-1212","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}