{"id":"https://openalex.org/W2116752800","doi":"https://doi.org/10.1145/1146238.1146256","title":"Using model checking with symbolic execution to verify parallel numerical programs","display_name":"Using model checking with symbolic execution to verify parallel numerical programs","publication_year":2006,"publication_date":"2006-07-21","ids":{"openalex":"https://openalex.org/W2116752800","doi":"https://doi.org/10.1145/1146238.1146256","mag":"2116752800"},"language":"en","primary_location":{"id":"doi:10.1145/1146238.1146256","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1146238.1146256","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 international symposium on Software testing and analysis","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021789649","display_name":"Stephen F. Siegel","orcid":"https://orcid.org/0000-0001-9359-3332"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Stephen F. Siegel","raw_affiliation_strings":["University of Massachusetts, Amherst, MA"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts, Amherst, MA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013875710","display_name":"Anastasia Mironova","orcid":null},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anastasia Mironova","raw_affiliation_strings":["University of Utah, Salt Lake City, UT","University of Utah; Salt Lake City; UT"],"affiliations":[{"raw_affiliation_string":"University of Utah, Salt Lake City, UT","institution_ids":["https://openalex.org/I223532165"]},{"raw_affiliation_string":"University of Utah; Salt Lake City; UT","institution_ids":["https://openalex.org/I223532165"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109931927","display_name":"George S. Avrunin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"George S. Avrunin","raw_affiliation_strings":["University of Massachusetts"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111987936","display_name":"Lori A. Clarke","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lori A. Clarke","raw_affiliation_strings":["University of Massachusetts"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5021789649"],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":null,"apc_paid":null,"fwci":9.0999,"has_fulltext":false,"cited_by_count":65,"citation_normalized_percentile":{"value":0.98403714,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"3385","issue":null,"first_page":"157","last_page":"168"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9998999834060669,"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/T10142","display_name":"Formal Methods in Verification","score":0.9976000189781189,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.859124481678009},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8518099784851074},{"id":"https://openalex.org/keywords/symbolic-trajectory-evaluation","display_name":"Symbolic trajectory evaluation","score":0.7342965006828308},{"id":"https://openalex.org/keywords/symbolic-execution","display_name":"Symbolic execution","score":0.6380693912506104},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6185862421989441},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6172062158584595},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.567563533782959},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5574157238006592},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5138171315193176},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.4580084979534149},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.41006168723106384},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38092130422592163},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.13886719942092896},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.0845138430595398},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07688626646995544}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.859124481678009},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8518099784851074},{"id":"https://openalex.org/C23123167","wikidata":"https://www.wikidata.org/wiki/Q7661193","display_name":"Symbolic trajectory evaluation","level":3,"score":0.7342965006828308},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.6380693912506104},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6185862421989441},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6172062158584595},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.567563533782959},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5574157238006592},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5138171315193176},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.4580084979534149},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.41006168723106384},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38092130422592163},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.13886719942092896},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0845138430595398},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07688626646995544},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1146238.1146256","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1146238.1146256","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 international symposium on Software testing and analysis","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.329.2383","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.329.2383","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://laser.cs.umass.edu/techreports/06-ISSTA.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.587.6403","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.587.6403","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://laser.cs.umass.edu/techreports/05-15.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.85.2237","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.2237","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://laser.cs.umass.edu/techreports/07-33.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320308633","display_name":"Computing Research Association","ror":"https://ror.org/00agrkd75"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W54779658","https://openalex.org/W1494546726","https://openalex.org/W1495012123","https://openalex.org/W1510543252","https://openalex.org/W1539432158","https://openalex.org/W1541824250","https://openalex.org/W1547234535","https://openalex.org/W1552108359","https://openalex.org/W1579638562","https://openalex.org/W1720848645","https://openalex.org/W1848189967","https://openalex.org/W2070485163","https://openalex.org/W2087252615","https://openalex.org/W2089139117","https://openalex.org/W2094382938","https://openalex.org/W2103772961","https://openalex.org/W2109276114","https://openalex.org/W2112579501","https://openalex.org/W2162543097","https://openalex.org/W2164592820","https://openalex.org/W2169004268","https://openalex.org/W2204310803","https://openalex.org/W2611698539","https://openalex.org/W2979730858","https://openalex.org/W4239953946","https://openalex.org/W4246466186","https://openalex.org/W4285719527","https://openalex.org/W4299963825","https://openalex.org/W6632383594"],"related_works":["https://openalex.org/W1785234853","https://openalex.org/W4390481443","https://openalex.org/W2365988016","https://openalex.org/W1959575449","https://openalex.org/W1483297389","https://openalex.org/W1547517160","https://openalex.org/W3098557859","https://openalex.org/W1583869287","https://openalex.org/W1593793497","https://openalex.org/W1575138043"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,25],"method":[3,22],"to":[4,33,46,54],"verify":[5],"the":[6,29,36,39,56,59],"correctness":[7],"of":[8,28,58],"parallel":[9,40],"programs":[10],"that":[11,24],"perform":[12],"complex":[13],"numerical":[14],"computations,":[15],"including":[16],"computations":[17],"involving":[18],"floating-point":[19],"arithmetic.":[20],"The":[21,42],"requires":[23],"sequential":[26],"version":[27],"program":[30],"be":[31],"provided,":[32],"serve":[34],"as":[35],"specification":[37],"for":[38],"one.":[41],"key":[43],"idea":[44],"is":[45],"use":[47],"model":[48],"checking,":[49],"together":[50],"with":[51],"symbolic":[52],"execution,":[53],"establish":[55],"equivalence":[57],"two":[60],"programs.":[61]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}