{"id":"https://openalex.org/W2764173007","doi":"https://doi.org/10.1145/3133902","title":"Seam: provably safe local edits on graphs","display_name":"Seam: provably safe local edits on graphs","publication_year":2017,"publication_date":"2017-10-12","ids":{"openalex":"https://openalex.org/W2764173007","doi":"https://doi.org/10.1145/3133902","mag":"2764173007"},"language":"en","primary_location":{"id":"doi:10.1145/3133902","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3133902","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3133902&type=pdf","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=3133902&type=pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070875480","display_name":"Manolis Papadakis","orcid":"https://orcid.org/0009-0004-5099-9104"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Manolis Papadakis","raw_affiliation_strings":["Stanford University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034400503","display_name":"Gilbert Bernstein","orcid":"https://orcid.org/0000-0002-3016-1169"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gilbert Louis Bernstein","raw_affiliation_strings":["Stanford University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101769895","display_name":"Rahul Sharma","orcid":"https://orcid.org/0000-0001-7527-4653"},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rahul Sharma","raw_affiliation_strings":["Microsoft Research, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, India","institution_ids":["https://openalex.org/I4210124949"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087402475","display_name":"Alex Aiken","orcid":"https://orcid.org/0000-0002-3723-9555"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alex Aiken","raw_affiliation_strings":["Stanford University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018111215","display_name":"Pat Hanrahan","orcid":"https://orcid.org/0000-0002-3474-9752"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pat Hanrahan","raw_affiliation_strings":["Stanford University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17895726,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":"OOPSLA","first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9958999752998352,"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/computer-science","display_name":"Computer science","score":0.8974929451942444},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.8099969625473022},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.711125373840332},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6239713430404663},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.6233929991722107},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.583827018737793},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5087998509407043},{"id":"https://openalex.org/keywords/graphics","display_name":"Graphics","score":0.4526998996734619},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44478967785835266},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.438078910112381},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4339095652103424},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.4311378598213196},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.0923890769481659}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8974929451942444},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8099969625473022},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.711125373840332},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6239713430404663},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.6233929991722107},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.583827018737793},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5087998509407043},{"id":"https://openalex.org/C21442007","wikidata":"https://www.wikidata.org/wiki/Q1027879","display_name":"Graphics","level":2,"score":0.4526998996734619},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44478967785835266},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.438078910112381},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4339095652103424},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.4311378598213196},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0923890769481659},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3133902","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3133902","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3133902&type=pdf","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3133902","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3133902","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3133902&type=pdf","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Life below water","id":"https://metadata.un.org/sdg/14","score":0.4399999976158142}],"awards":[{"id":"https://openalex.org/G2336975011","display_name":null,"funder_award_id":"#DE-NA0002373","funder_id":"https://openalex.org/F4320332369","funder_display_name":"National Nuclear Security Administration"},{"id":"https://openalex.org/G4893514074","display_name":null,"funder_award_id":"DE-NA0002373-1","funder_id":"https://openalex.org/F4320332369","funder_display_name":"National Nuclear Security Administration"},{"id":"https://openalex.org/G6253966236","display_name":"Synthesis and Analysis of Heap Data Structures","funder_award_id":"1160904","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6915625271","display_name":"PREDICTIVE SIMULATIONS OF PARTICLE-LADEN TURBULENCE IN A RADIATION ENVIRONMENT","funder_award_id":"DENA0002373","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320332369","display_name":"National Nuclear Security Administration","ror":"https://ror.org/03sk1we31"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2764173007.pdf","grobid_xml":"https://content.openalex.org/works/W2764173007.grobid-xml"},"referenced_works_count":52,"referenced_works":["https://openalex.org/W57047380","https://openalex.org/W100246148","https://openalex.org/W180405853","https://openalex.org/W1490688156","https://openalex.org/W1504504841","https://openalex.org/W1510471799","https://openalex.org/W1549008998","https://openalex.org/W1555471913","https://openalex.org/W1566995037","https://openalex.org/W1569403765","https://openalex.org/W1578097867","https://openalex.org/W1580779595","https://openalex.org/W1581816844","https://openalex.org/W1902364372","https://openalex.org/W1966900315","https://openalex.org/W1979619055","https://openalex.org/W1981404401","https://openalex.org/W1994808961","https://openalex.org/W2003948257","https://openalex.org/W2013108521","https://openalex.org/W2013892605","https://openalex.org/W2015897252","https://openalex.org/W2018236969","https://openalex.org/W2023035194","https://openalex.org/W2028308254","https://openalex.org/W2051420955","https://openalex.org/W2059469850","https://openalex.org/W2067464091","https://openalex.org/W2086210210","https://openalex.org/W2098095758","https://openalex.org/W2098575846","https://openalex.org/W2100444372","https://openalex.org/W2130210899","https://openalex.org/W2132598718","https://openalex.org/W2135381699","https://openalex.org/W2140611647","https://openalex.org/W2147832077","https://openalex.org/W2153185479","https://openalex.org/W2154985136","https://openalex.org/W2167814583","https://openalex.org/W2170577595","https://openalex.org/W2204104912","https://openalex.org/W2407292968","https://openalex.org/W2536203406","https://openalex.org/W2911450990","https://openalex.org/W2912166712","https://openalex.org/W3015951847","https://openalex.org/W3137133090","https://openalex.org/W4214807841","https://openalex.org/W4233077045","https://openalex.org/W4245234767","https://openalex.org/W4254561751"],"related_works":["https://openalex.org/W2117548279","https://openalex.org/W2070252991","https://openalex.org/W2807449856","https://openalex.org/W2941201715","https://openalex.org/W2025727968","https://openalex.org/W2810367355","https://openalex.org/W2131919998","https://openalex.org/W4298162803","https://openalex.org/W2798810563","https://openalex.org/W2964307043"],"abstract_inverted_index":{"Algorithms":[0],"that":[1,82,94,158],"create":[2],"and":[3,25,80,99,103,120,146,178],"mutate":[4],"graph":[5],"data":[6,36,72,78,83],"structures":[7],"are":[8],"challenging":[9],"to":[10,33,58,70,124,184],"implement":[11],"correctly.":[12],"However,":[13],"verifying":[14],"even":[15],"basic":[16],"properties":[17],"of":[18,41,108,117,127,134,154],"low-level":[19,160],"implementations,":[20],"such":[21,34,81],"as":[22],"referential":[23],"integrity":[24,84],"memory":[26],"safety,":[27],"remains":[28],"non-trivial.":[29],"Furthermore,":[30],"any":[31],"extension":[32],"a":[35,54,64,76,91,125,131,155,175],"structure":[37],"multiplies":[38],"the":[39,46,109,114],"complexity":[40],"its":[42,122],"implementation,":[43],"while":[44],"compounding":[45],"challenges":[47],"in":[48,143],"reasoning":[49],"about":[50],"correctness.":[51],"We":[52,61,89,112,149,170],"take":[53],"language":[55,65],"design":[56],"approach":[57],"this":[59],"problem.":[60],"propose":[62],"Seam,":[63],"for":[66],"expressing":[67],"local":[68],"edits":[69],"graph-like":[71],"structures,":[73],"based":[74],"on":[75,174],"relational":[77],"model,":[79],"can":[85,163],"be":[86,165],"verified":[87],"automatically.":[88],"present":[90],"verification":[92,115,135],"method":[93],"leverages":[95],"an":[96],"SMT":[97,110],"solver,":[98],"prove":[100],"it":[101],"sound":[102],"precise":[104],"(complete":[105],"modulo":[106],"termination":[107],"solver).":[111],"evaluate":[113,171],"capabilities":[116],"Seam":[118,156],"empirically,":[119],"demonstrate":[121,179],"applicability":[123],"variety":[126],"examples,":[128],"most":[129],"notably":[130],"new":[132],"class":[133],"tasks":[136],"derived":[137],"from":[138],"geometric":[139],"remeshing":[140],"operations":[141],"used":[142],"scientific":[144],"simulation":[145],"computer":[147],"graphics.":[148],"describe":[150],"our":[151,172],"prototype":[152],"implementation":[153],"compiler":[157,173],"generates":[159],"code,":[161],"which":[162],"then":[164],"integrated":[166],"into":[167],"larger":[168],"applications.":[169],"sample":[176],"application,":[177],"competitive":[180],"execution":[181],"time,":[182],"compared":[183],"hand-written":[185],"implementations.":[186]},"counts_by_year":[],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}
