{"id":"https://openalex.org/W1991680915","doi":"https://doi.org/10.1093/comjnl/bxh121","title":"Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas","display_name":"Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas","publication_year":2005,"publication_date":"2005-07-22","ids":{"openalex":"https://openalex.org/W1991680915","doi":"https://doi.org/10.1093/comjnl/bxh121","mag":"1991680915"},"language":"en","primary_location":{"id":"doi:10.1093/comjnl/bxh121","is_oa":true,"landing_page_url":"https://doi.org/10.1093/comjnl/bxh121","pdf_url":"https://academic.oup.com/comjnl/article-pdf/48/6/737/1025718/bxh121.pdf","source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://academic.oup.com/comjnl/article-pdf/48/6/737/1025718/bxh121.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5105935151","display_name":"Sebastian Danicic","orcid":null},"institutions":[{"id":"https://openalex.org/I55521800","display_name":"Goldsmiths University of London","ror":"https://ror.org/01khx4a30","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I55521800"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Sebastian Danicic","raw_affiliation_strings":["Department of Computing, Goldsmiths College, University of London, New Cross, London SE14 6NW, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computing, Goldsmiths College, University of London, New Cross, London SE14 6NW, UK","institution_ids":["https://openalex.org/I55521800"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107482433","display_name":"Chris Fox","orcid":"https://orcid.org/0000-0003-1931-2058"},"institutions":[{"id":"https://openalex.org/I110002522","display_name":"University of Essex","ror":"https://ror.org/02nkf1q06","country_code":"GB","type":"education","lineage":["https://openalex.org/I110002522"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Chris Fox","raw_affiliation_strings":["Department of computer science, University of Essex, Colchester CO4 3SQ, UK"],"affiliations":[{"raw_affiliation_string":"Department of computer science, University of Essex, Colchester CO4 3SQ, UK","institution_ids":["https://openalex.org/I110002522"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000019783","display_name":"Mark Harman","orcid":"https://orcid.org/0000-0002-5864-4488"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mark Harman","raw_affiliation_strings":["Dept. of Computer Science, King's College London, Strand, London WC2R 2LS, UK"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, King's College London, Strand, London WC2R 2LS, UK","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009644797","display_name":"Robert M. Hierons","orcid":"https://orcid.org/0000-0002-4771-1446"},"institutions":[{"id":"https://openalex.org/I59433898","display_name":"Brunel University of London","ror":"https://ror.org/00dn4t376","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I59433898"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Rob Hierons","raw_affiliation_strings":["School of Information Systems, Computing and Mathematics, Brunel University, Uxbridge, Middlesex, UB8 3PH, UK.#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Information Systems, Computing and Mathematics, Brunel University, Uxbridge, Middlesex, UB8 3PH, UK.#TAB#","institution_ids":["https://openalex.org/I59433898"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049189804","display_name":"John Howroyd","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"John Howroyd","raw_affiliation_strings":["@UK PLC, 5 Jupiter House, Calleva Park, Aldermaston, Berkshire RG7 8NN, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"@UK PLC, 5 Jupiter House, Calleva Park, Aldermaston, Berkshire RG7 8NN, UK#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041703995","display_name":"Michael R. Laurence","orcid":null},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Michael R. Laurence","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, Peach Street, Liverpool L69 3BX, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, Peach Street, Liverpool L69 3BX, UK#TAB#","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5105935151"],"corresponding_institution_ids":["https://openalex.org/I55521800"],"apc_list":{"value":2635,"currency":"GBP","value_usd":3232},"apc_paid":null,"fwci":1.1147,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.79398335,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"48","issue":"6","first_page":"737","last_page":"748"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11241","display_name":"Advanced Malware Detection Techniques","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/program-slicing","display_name":"Program slicing","score":0.9593673348426819},{"id":"https://openalex.org/keywords/dataflow","display_name":"Dataflow","score":0.9003505706787109},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8420714735984802},{"id":"https://openalex.org/keywords/slicing","display_name":"Slicing","score":0.7808411121368408},{"id":"https://openalex.org/keywords/debugging","display_name":"Debugging","score":0.7206716537475586},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6277138590812683},{"id":"https://openalex.org/keywords/statement","display_name":"Statement (logic)","score":0.5609745383262634},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5521025061607361},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.5376905202865601},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.5316375494003296},{"id":"https://openalex.org/keywords/dataflow-architecture","display_name":"Dataflow architecture","score":0.4655950963497162},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.4468650221824646},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4405108690261841},{"id":"https://openalex.org/keywords/static-analysis","display_name":"Static analysis","score":0.4363774061203003},{"id":"https://openalex.org/keywords/reverse-engineering","display_name":"Reverse engineering","score":0.41371607780456543}],"concepts":[{"id":"https://openalex.org/C91071405","wikidata":"https://www.wikidata.org/wiki/Q1413145","display_name":"Program slicing","level":3,"score":0.9593673348426819},{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.9003505706787109},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8420714735984802},{"id":"https://openalex.org/C2776190703","wikidata":"https://www.wikidata.org/wiki/Q488148","display_name":"Slicing","level":2,"score":0.7808411121368408},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.7206716537475586},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6277138590812683},{"id":"https://openalex.org/C2777026412","wikidata":"https://www.wikidata.org/wiki/Q2684591","display_name":"Statement (logic)","level":2,"score":0.5609745383262634},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5521025061607361},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.5376905202865601},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.5316375494003296},{"id":"https://openalex.org/C176727019","wikidata":"https://www.wikidata.org/wiki/Q1172415","display_name":"Dataflow architecture","level":3,"score":0.4655950963497162},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.4468650221824646},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4405108690261841},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.4363774061203003},{"id":"https://openalex.org/C207850805","wikidata":"https://www.wikidata.org/wiki/Q269608","display_name":"Reverse engineering","level":2,"score":0.41371607780456543},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1093/comjnl/bxh121","is_oa":true,"landing_page_url":"https://doi.org/10.1093/comjnl/bxh121","pdf_url":"https://academic.oup.com/comjnl/article-pdf/48/6/737/1025718/bxh121.pdf","source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.101.5393","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.5393","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://comjnl.oxfordjournals.org/cgi/reprint/48/6/737.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.62.9134","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.9134","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.kcl.ac.uk/staff/mark/cj-minslice.ps","raw_type":"text"},{"id":"pmh:oai:bura.brunel.ac.uk:2438/336","is_oa":false,"landing_page_url":"http://bura.brunel.ac.uk/handle/2438/336","pdf_url":null,"source":{"id":"https://openalex.org/S4306401473","display_name":"Brunel University Research Archive (BURA) (Brunel University London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I59433898","host_organization_name":"Brunel University of London","host_organization_lineage":["https://openalex.org/I59433898"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Research Paper"},{"id":"pmh:oai:bura.brunel.ac.uk:2438/6258","is_oa":false,"landing_page_url":"http://comjnl.oxfordjournals.org/content/48/6/737.abstract","pdf_url":null,"source":{"id":"https://openalex.org/S4306401473","display_name":"Brunel University Research Archive (BURA) (Brunel University London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I59433898","host_organization_name":"Brunel University of London","host_organization_lineage":["https://openalex.org/I59433898"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:1302192","is_oa":false,"landing_page_url":"http://discovery.ucl.ac.uk/1302192/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"   COMPUT J , 48  (6)   737 - 748.   (2005)      ","raw_type":"Article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/ad674872-0d68-4331-bd96-52b162a896c3","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/ad674872-0d68-4331-bd96-52b162a896c3","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Danicic , S , Fox , C , Harman , M , Hierons , R , Howroyd , J & Laurence , M 2005 , ' Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas ' , COMPUTER JOURNAL , vol. 48 , no. 6 , pp. 737 - 748 . https://doi.org/10.1093/comjnl/bxh121","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1093/comjnl/bxh121","is_oa":true,"landing_page_url":"https://doi.org/10.1093/comjnl/bxh121","pdf_url":"https://academic.oup.com/comjnl/article-pdf/48/6/737/1025718/bxh121.pdf","source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1991680915.pdf","grobid_xml":"https://content.openalex.org/works/W1991680915.grobid-xml"},"referenced_works_count":73,"referenced_works":["https://openalex.org/W2611787","https://openalex.org/W43378443","https://openalex.org/W53653091","https://openalex.org/W303139982","https://openalex.org/W1506151672","https://openalex.org/W1512687743","https://openalex.org/W1528125755","https://openalex.org/W1533386851","https://openalex.org/W1546381996","https://openalex.org/W1562775174","https://openalex.org/W1572219859","https://openalex.org/W1579433101","https://openalex.org/W1793637191","https://openalex.org/W1964060567","https://openalex.org/W1966403183","https://openalex.org/W1966640665","https://openalex.org/W1975807602","https://openalex.org/W1984248430","https://openalex.org/W1984846967","https://openalex.org/W1988503504","https://openalex.org/W1990220002","https://openalex.org/W1994195424","https://openalex.org/W1996791333","https://openalex.org/W1997880406","https://openalex.org/W1999384668","https://openalex.org/W2002102852","https://openalex.org/W2005835674","https://openalex.org/W2006802414","https://openalex.org/W2010927194","https://openalex.org/W2012131382","https://openalex.org/W2023049754","https://openalex.org/W2043057243","https://openalex.org/W2044529811","https://openalex.org/W2056038097","https://openalex.org/W2056368582","https://openalex.org/W2057992103","https://openalex.org/W2064625489","https://openalex.org/W2064885277","https://openalex.org/W2073971651","https://openalex.org/W2085674537","https://openalex.org/W2088017390","https://openalex.org/W2092483417","https://openalex.org/W2094944943","https://openalex.org/W2097347001","https://openalex.org/W2101182391","https://openalex.org/W2108320473","https://openalex.org/W2110066339","https://openalex.org/W2122749276","https://openalex.org/W2124228276","https://openalex.org/W2126875022","https://openalex.org/W2127280681","https://openalex.org/W2128029896","https://openalex.org/W2135926579","https://openalex.org/W2137126136","https://openalex.org/W2138008044","https://openalex.org/W2139805637","https://openalex.org/W2141716727","https://openalex.org/W2142993980","https://openalex.org/W2143177356","https://openalex.org/W2144344516","https://openalex.org/W2145268645","https://openalex.org/W2147088720","https://openalex.org/W2147140044","https://openalex.org/W2156820168","https://openalex.org/W2162046779","https://openalex.org/W2162310108","https://openalex.org/W2293624369","https://openalex.org/W4230478309","https://openalex.org/W4239086365","https://openalex.org/W4241211222","https://openalex.org/W4247632680","https://openalex.org/W4251543700","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2564598376","https://openalex.org/W1484403103","https://openalex.org/W2584408851","https://openalex.org/W2115158825","https://openalex.org/W2101960124","https://openalex.org/W4377693460","https://openalex.org/W2783505431","https://openalex.org/W2521947294","https://openalex.org/W2140468016","https://openalex.org/W3011938067"],"abstract_inverted_index":{"Program":[0],"slicing":[1,61,76],"is":[2,39,46],"an":[3],"automated":[4],"source":[5],"code":[6],"extraction":[7],"technique":[8],"that":[9,48,74],"has":[10,62],"been":[11],"applied":[12],"to":[13],"a":[14],"number":[15],"of":[16,36,58],"problems":[17],"including":[18],"testing,":[19],"debugging,":[20],"maintenance,":[21],"reverse":[22],"engineering,":[23],"program":[24,28],"comprehension,":[25],"reuse":[26],"and":[27,94],"integration.":[29],"In":[30],"all":[31],"these":[32],"applications":[33],"the":[34,37,41,43,56],"size":[35],"slice":[38],"crucial;":[40],"smaller":[42],"better.":[44],"It":[45],"known":[47],"statement":[49],"minimal":[50,60,80],"slices":[51,82],"are":[52,92],"not":[53],"computable,":[54],"but":[55],"question":[57],"dataflow":[59,79],"remained":[63],"open":[64],"since":[65],"Weiser":[66],"posed":[67],"it":[68],"in":[69],"1979.":[70],"This":[71],"paper":[72],"proves":[73],"static":[75],"algorithms":[77],"produce":[78],"end":[81],"for":[83],"programs":[84],"which":[85,91],"can":[86],"be":[87],"represented":[88],"as":[89],"schemas":[90],"free":[93],"liberal.":[95],"1.":[96]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}