<> <http://www.w3.org/2000/01/rdf-schema#comment> "The repository administrator has not yet configured an RDF license."^^<http://www.w3.org/2001/XMLSchema#string> .
<> <http://xmlns.com/foaf/0.1/primaryTopic> <https://discovery.ucl.ac.uk/id/eprint/1388948> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/AcademicArticle> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Article> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/dc/terms/title> "Efficient Identification of Linchpin Vertices in Dependence Clusters"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/ontology/bibo/abstract> "Several authors have found evidence of large dependence clusters in the source code of a diverse range of systems, domains, and programming languages. This raises the question of how we might efficiently locate the fragments of code that give rise to large dependence clusters. We introduce an algorithm for the identification of linchpin vertices, which hold together large dependence clusters, and prove correctness properties for the algorithm’s primary innovations. We also report the results of an empirical study concerning the reduction in analysis time that our algorithm yields over its predecessor using a collection of 38 programs containing almost half a million lines of code. Our empirical findings indicate improvements of almost two orders of magnitude, making it possible to process larger programs for which it would have previously been impractical."^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/dc/terms/date> "2013-07" .
<https://discovery.ucl.ac.uk/id/document/50951> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Document> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/ontology/bibo/volume> "35" .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/ontology/bibo/issue> "2" .
<https://discovery.ucl.ac.uk/id/publication/ext-01640925> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Collection> .
<https://discovery.ucl.ac.uk/id/publication/ext-01640925> <http://xmlns.com/foaf/0.1/name> "ACM Transactions on Programming Languages and Systems"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/dc/terms/isPartOf> <https://discovery.ucl.ac.uk/id/publication/ext-01640925> .
<https://discovery.ucl.ac.uk/id/publication/ext-01640925> <http://www.w3.org/2002/07/owl#sameAs> <urn:issn:01640925> .
<https://discovery.ucl.ac.uk/id/publication/ext-01640925> <http://purl.org/ontology/bibo/issn> "01640925" .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/ontology/bibo/status> <http://purl.org/ontology/bibo/status/published> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-0daf79f5afa9d7868bf6e1948c22bc01> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/1388948#authors> .
<https://discovery.ucl.ac.uk/id/eprint/1388948#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_1> <https://discovery.ucl.ac.uk/id/person/ext-0daf79f5afa9d7868bf6e1948c22bc01> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-e70416bca0fa942df506ee3af16eea6b> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/1388948#authors> .
<https://discovery.ucl.ac.uk/id/eprint/1388948#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_2> <https://discovery.ucl.ac.uk/id/person/ext-e70416bca0fa942df506ee3af16eea6b> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-52222e81db90395603516977e1390187> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/1388948#authors> .
<https://discovery.ucl.ac.uk/id/eprint/1388948#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_3> <https://discovery.ucl.ac.uk/id/person/ext-52222e81db90395603516977e1390187> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-49c07952ef9a7f23850a09442466b5e5> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/1388948#authors> .
<https://discovery.ucl.ac.uk/id/eprint/1388948#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_4> <https://discovery.ucl.ac.uk/id/person/ext-49c07952ef9a7f23850a09442466b5e5> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-22406da71482db2e14eb4ad20abbea96> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/1388948#authors> .
<https://discovery.ucl.ac.uk/id/eprint/1388948#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_5> <https://discovery.ucl.ac.uk/id/person/ext-22406da71482db2e14eb4ad20abbea96> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-d6b74d6c46dcf99255d846b5d2ba02bf> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/1388948#authors> .
<https://discovery.ucl.ac.uk/id/eprint/1388948#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_6> <https://discovery.ucl.ac.uk/id/person/ext-d6b74d6c46dcf99255d846b5d2ba02bf> .
<https://discovery.ucl.ac.uk/id/person/ext-e70416bca0fa942df506ee3af16eea6b> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-e70416bca0fa942df506ee3af16eea6b> <http://xmlns.com/foaf/0.1/givenName> "N"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-e70416bca0fa942df506ee3af16eea6b> <http://xmlns.com/foaf/0.1/familyName> "Gold"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-e70416bca0fa942df506ee3af16eea6b> <http://xmlns.com/foaf/0.1/name> "N Gold"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-0daf79f5afa9d7868bf6e1948c22bc01> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-0daf79f5afa9d7868bf6e1948c22bc01> <http://xmlns.com/foaf/0.1/givenName> "D"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-0daf79f5afa9d7868bf6e1948c22bc01> <http://xmlns.com/foaf/0.1/familyName> "Binkley"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-0daf79f5afa9d7868bf6e1948c22bc01> <http://xmlns.com/foaf/0.1/name> "D Binkley"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-49c07952ef9a7f23850a09442466b5e5> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-49c07952ef9a7f23850a09442466b5e5> <http://xmlns.com/foaf/0.1/givenName> "S"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-49c07952ef9a7f23850a09442466b5e5> <http://xmlns.com/foaf/0.1/familyName> "Islam"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-49c07952ef9a7f23850a09442466b5e5> <http://xmlns.com/foaf/0.1/name> "S Islam"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-22406da71482db2e14eb4ad20abbea96> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-22406da71482db2e14eb4ad20abbea96> <http://xmlns.com/foaf/0.1/givenName> "J"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-22406da71482db2e14eb4ad20abbea96> <http://xmlns.com/foaf/0.1/familyName> "Krinke"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-22406da71482db2e14eb4ad20abbea96> <http://xmlns.com/foaf/0.1/name> "J Krinke"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-52222e81db90395603516977e1390187> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-52222e81db90395603516977e1390187> <http://xmlns.com/foaf/0.1/givenName> "M"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-52222e81db90395603516977e1390187> <http://xmlns.com/foaf/0.1/familyName> "Harman"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-52222e81db90395603516977e1390187> <http://xmlns.com/foaf/0.1/name> "M Harman"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-d6b74d6c46dcf99255d846b5d2ba02bf> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-d6b74d6c46dcf99255d846b5d2ba02bf> <http://xmlns.com/foaf/0.1/givenName> "Z"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-d6b74d6c46dcf99255d846b5d2ba02bf> <http://xmlns.com/foaf/0.1/familyName> "Li"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-d6b74d6c46dcf99255d846b5d2ba02bf> <http://xmlns.com/foaf/0.1/name> "Z Li"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/EPrint> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/ArticleEPrint> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://purl.org/dc/terms/isPartOf> <https://discovery.ucl.ac.uk/id/repository> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/50951> .
<https://discovery.ucl.ac.uk/id/document/50951> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/50951> <http://www.w3.org/2000/01/rdf-schema#label> "Efficient Identification of Linchpin Vertices in Dependence Clusters (PDF)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/50951> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/1388948/1/toplas13.pdf> .
<https://discovery.ucl.ac.uk/id/document/50951> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/1388948/1/toplas13.pdf> .
<https://discovery.ucl.ac.uk/id/eprint/1388948/1/toplas13.pdf> <http://www.w3.org/2000/01/rdf-schema#label> "toplas13.pdf"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/117875> .
<https://discovery.ucl.ac.uk/id/document/117875> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/117875> <http://www.w3.org/2000/01/rdf-schema#label> "Efficient Identification of Linchpin Vertices in Dependence Clusters (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/117875> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/50951> .
<https://discovery.ucl.ac.uk/id/document/117875> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/50951> .
<https://discovery.ucl.ac.uk/id/document/117875> <http://eprints.org/relation/isIndexCodesVersionOf> <https://discovery.ucl.ac.uk/id/document/50951> .
<https://discovery.ucl.ac.uk/id/document/117875> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/1388948/2/indexcodes.txt> .
<https://discovery.ucl.ac.uk/id/document/117875> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/1388948/2/indexcodes.txt> .
<https://discovery.ucl.ac.uk/id/eprint/1388948/2/indexcodes.txt> <http://www.w3.org/2000/01/rdf-schema#label> "indexcodes.txt"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1388948> <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://discovery.ucl.ac.uk/id/eprint/1388948/> .
<https://discovery.ucl.ac.uk/id/eprint/1388948/> <http://purl.org/dc/elements/1.1/title> "HTML Summary of #1388948 \n\nEfficient Identification of Linchpin Vertices in Dependence Clusters\n\n" .
<https://discovery.ucl.ac.uk/id/eprint/1388948/> <http://purl.org/dc/elements/1.1/format> "text/html" .
<https://discovery.ucl.ac.uk/id/eprint/1388948/> <http://xmlns.com/foaf/0.1/primaryTopic> <https://discovery.ucl.ac.uk/id/eprint/1388948> .