{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T03:44:16Z","timestamp":1760586256871,"version":"3.30.1"},"reference-count":28,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"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":["Information Sciences"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0020-0255(99)00030-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"99-131","source":"Crossref","is-referenced-by-count":18,"title":["An optimal algorithm for the construction of the system dependence graph"],"prefix":"10.1016","volume":"125","author":[{"given":"Panos E.","family":"Livadas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Theodore","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0255(99)00030-4_BIB1","unstructured":"A.V. Aho, J.E. Hopcoft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB2","unstructured":"A.V. Aho, R. Sethi, J.D. Ullman, Compilers: Principles, Techniques and Tools, Addison-Wesley, Reading, MA"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB3","unstructured":"L. Badger, M. Weiser, Minimizing communications for synchronizing parallel dataflow programs, in: Proceedings of the 1988 International Conference on Parallel Processing, Penn State University Press, PA"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB4","doi-asserted-by":"crossref","unstructured":"J.P. Banning, An efficient way to find the side effects of procedure calls and the aliases of variables, in: Conference Record of the Sixth ACM Symposium on Principles of Programming Languages (San Antonio, Tex, January 29\u201331, 1979). ACM, New York, 1979","DOI":"10.1145\/567752.567756"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB5","unstructured":"B.W. Boehm, in: E. Horowitz (Ed.), The High Cost of Software, Practical Strategies for Developing Large Software Systems. Addison-Wesley, Reading, MA"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB6","doi-asserted-by":"crossref","unstructured":"D. Callahan, The program summary graph and flow-sensitive interprocedural data flow analysis, in: Proceedings of the SIGPLAN 1988 Conference on Programming Language Design and Implementation, Atlanta Georgia, 22\u201324 June 1988","DOI":"10.1145\/53990.53995"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB7","doi-asserted-by":"crossref","unstructured":"J. Ferrante, K. Ottenstein, J. Warren, The Program Dependence Graph and its Use in Optimization, ACM TOPLAS, July 1987","DOI":"10.1145\/24039.24041"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB8","unstructured":"M.J. Harrold, M.L. Soffa, Selecting Data for Integration Testing"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB9","unstructured":"S. Horwitz, J. Prins, T. Reps, Integrating non-interfering versions of programs, in: Proceedings of the 15th ACM Symposium of Programming Languages, ACM Press, New York"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB10","doi-asserted-by":"crossref","unstructured":"S. Horwitz, J. Prins, T. Reps, Integrating Non-interfering Versions of Programs, ACM TOPLAS, July 1989","DOI":"10.1145\/73560.73572"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB11","doi-asserted-by":"crossref","unstructured":"S. Horwitz, T. Reps, D. Binkley, Interprocedural Slicing Using Dependence Graphs, ACM TOPLAS, January 1990","DOI":"10.1145\/77606.77608"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB12","doi-asserted-by":"crossref","unstructured":"J.C. Hwang, M.W. Du, C.R. Chou, Finding program slices for recursive procedures, in: Proceedings of the IEEE COMPSAC 88, IEEE Computer Society, 1988","DOI":"10.1109\/CMPSAC.1988.17176"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB13","doi-asserted-by":"crossref","unstructured":"U. Kastens, Ordered Attribute Grammars, Acta Inf. 13 (3) (1980)","DOI":"10.1007\/BF00288644"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB14","unstructured":"B.W. Kernigham, D.M. Ritche, The C Programming (ANSI C) Language, second ed., Prentice Hall, Englewood Cliffs, New Jersey"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB15","doi-asserted-by":"crossref","unstructured":"H.K.N. Leung, H.K. Reghbati, Comments on program slicing. IEEE Trans. on Software Eng. 13 (12) (1987)","DOI":"10.1109\/TSE.1987.233147"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB16","doi-asserted-by":"crossref","unstructured":"Panos E. Livadas, S. Croll, System dependence graph construction for recursive programs, Proceedings of the Seventeenth International Computer Software and Applications Conference, November 93, pp. 414\u2013420","DOI":"10.1109\/CMPSAC.1993.404249"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB17","first-page":"100","article-title":"A new algorithm for the calculation of transitive dependences","volume":"6","author":"Livadas Panos","year":"1994","journal-title":"Journal of Software Maintenance"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB18","unstructured":"J.R. Lyle, M. Weiser, Experiments in slicing-based debugging aids, in: E. Soloway, S. Iyengar (Eds.), Empirical Studies of Programmers, Ablex Publishing Corporation, Norwood, New Jersey, 1986"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB19","unstructured":"J.R. Lyle, M. Weiser, Automatic program bug location by program slicing, in: Proceedings of the Second International Conference on Computers and Applications, June 1987"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB20","doi-asserted-by":"crossref","unstructured":"K.J. Ottenstein, L.M. Ottenstein, The program dependence graph in a software development environment, in: Proceedings of the ACM SIGSOFT\/SIPLAN Software Engineering Symposium on Practical Software Development Environments (Pittsburgh, 23\u201325 April 1984). ACM SIGPLAN Notices 19, 5 May 1984","DOI":"10.1145\/800020.808263"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB21","unstructured":"G. Parikh, Handbook of Software Maintenance, Wiley-Interscience, New York, 1986"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB22","unstructured":"T. Reps, W. Yang, The Semantics of Program Slicing, TR-777, Computer Sciences Department, University of Wiconsin, Madison, June 1988"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB23","doi-asserted-by":"crossref","unstructured":"T. Reps, T. Bricker, Illustrating Interference in Interfering Versions of Programs, TR-827, Computer Sciences Department, University of Wisconsin, Madison, March 1989","DOI":"10.1145\/72910.73347"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB24","unstructured":"T. Reps, S. Horwitz, M. Sagiv, G. Rosay, Speeding Up Slicing"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB25","unstructured":"M. Weiser, Program slicing, in: Proceedings of the Fifth International Conference on Software Engineering, San Diego, CA, March 1981"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB26","doi-asserted-by":"crossref","unstructured":"M. Weiser, Programmers Use Slices When Debugging, CACM July 1982","DOI":"10.1145\/358557.358577"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB27","doi-asserted-by":"crossref","unstructured":"M. Weiser, Program slicing, IEEE Transactions on Software Engineering, July 1984","DOI":"10.1109\/TSE.1984.5010248"},{"key":"10.1016\/S0020-0255(99)00030-4_BIB28","unstructured":"W. Yang, S. Horwitz, T. Reps, Detecting Program Components With Equivalent Behaviors, TR-840, Computer Sciences Department, University of Wisconsin, Madison, June 1989"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025599000304?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025599000304?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T15:18:46Z","timestamp":1733498326000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025599000304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":28,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0020025599000304"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(99)00030-4","relation":{},"ISSN":["0020-0255"],"issn-type":[{"type":"print","value":"0020-0255"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}