{"id":"https://openalex.org/W2101577148","doi":"https://doi.org/10.1109/lics.2002.1029814","title":"Tree-like counterexamples in model checking","display_name":"Tree-like counterexamples in model checking","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2101577148","doi":"https://doi.org/10.1109/lics.2002.1029814","mag":"2101577148"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2002.1029814","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2002.1029814","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 17th Annual IEEE Symposium on Logic in Computer Science","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/A5110048758","display_name":"E. M. Clarke","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"E. Clarke","raw_affiliation_strings":["School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA","[Sch. of Comput. Sci., Carnegie, Mellon Univ., Pittsburgh, PA, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"[Sch. of Comput. Sci., Carnegie, Mellon Univ., Pittsburgh, PA, USA]","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088826068","display_name":"Somesh Jha","orcid":"https://orcid.org/0000-0001-5877-0436"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Jha","raw_affiliation_strings":["Department of Computer Sciences, University of Wisconsin, Madison, WI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Wisconsin, Madison, WI, USA","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110048758"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":9.8197,"has_fulltext":false,"cited_by_count":141,"citation_normalized_percentile":{"value":0.9850587,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"19","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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/T11549","display_name":"Synthetic Organic Chemistry Methods","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/1605","display_name":"Organic Chemistry"},"field":{"id":"https://openalex.org/fields/16","display_name":"Chemistry"},"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.9878000020980835,"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/counterexample","display_name":"Counterexample","score":0.9686026573181152},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6077570915222168},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5961016416549683},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5714637041091919},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5338830351829529},{"id":"https://openalex.org/keywords/debugging","display_name":"Debugging","score":0.5075472593307495},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4969976246356964},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.4422890245914459},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.42479971051216125},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36153557896614075},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3277847170829773},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.31355607509613037},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2277543544769287},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12691527605056763}],"concepts":[{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.9686026573181152},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6077570915222168},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5961016416549683},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5714637041091919},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5338830351829529},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.5075472593307495},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4969976246356964},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.4422890245914459},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.42479971051216125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36153557896614075},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3277847170829773},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.31355607509613037},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2277543544769287},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12691527605056763},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lics.2002.1029814","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2002.1029814","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 17th Annual IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.60.8915","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.8915","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~emc/papers/Conference%20Papers/Tree-like%20Counterexamples%20in%20Model%20Checking.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7200000286102295,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1482286370","https://openalex.org/W1503170978","https://openalex.org/W1512512905","https://openalex.org/W1529461858","https://openalex.org/W1605593319","https://openalex.org/W1612453857","https://openalex.org/W1755189310","https://openalex.org/W1816620374","https://openalex.org/W1969404042","https://openalex.org/W1973652588","https://openalex.org/W1990609140","https://openalex.org/W2061438988","https://openalex.org/W2080267935","https://openalex.org/W2080593426","https://openalex.org/W2100112273","https://openalex.org/W2112535338","https://openalex.org/W2156751710","https://openalex.org/W2158395308","https://openalex.org/W2340735175","https://openalex.org/W2913459036","https://openalex.org/W3148855524","https://openalex.org/W4237532111","https://openalex.org/W4250884204","https://openalex.org/W4300021588","https://openalex.org/W6628962589","https://openalex.org/W6631459037","https://openalex.org/W6637713663","https://openalex.org/W6683354071","https://openalex.org/W6684644128","https://openalex.org/W6793064532"],"related_works":["https://openalex.org/W1551070491","https://openalex.org/W2103740034","https://openalex.org/W2095002986","https://openalex.org/W2753745283","https://openalex.org/W14017695","https://openalex.org/W2234073770","https://openalex.org/W2063465696","https://openalex.org/W2203774400","https://openalex.org/W2471765219","https://openalex.org/W2350953867"],"abstract_inverted_index":{"Counter":[0],"examples":[1],"for":[2,53,132],"specification":[3],"violations":[4],"provide":[5],"engineers":[6],"with":[7,92],"important":[8],"debugging":[9],"information.":[10],"Although":[11],"counterexamples":[12,91,105,131,139],"are":[13,28],"considered":[14],"one":[15],"of":[16,20,67,77,85,103,112,163],"the":[17,24,64,75,101,142,158],"main":[18,59],"advantages":[19],"model":[21,26],"checking,":[22],"state-of":[23],"art":[25],"checkers":[27],"restricted":[29],"to":[30,108,128,153],"relatively":[31],"simple":[32,94],"counterexamples,":[33],"and":[34,79,161],"surprisingly":[35],"little":[36],"research":[37],"effort":[38],"has":[39,57],"been":[40],"put":[41],"into":[42],"counterexamples.":[43,54,69,165],"In":[44],"this":[45,71],"paper,":[46],"we":[47,73,140],"introduce":[48],"a":[49,82,93,109],"new":[50,125],"general":[51,65],"framework":[52],"The":[55],"paper":[56],"three":[58],"contributions:":[60],"(i)":[61],"We":[62,98,123],"determine":[63],"form":[66],"ACTL":[68,89,133],"To":[70],"end,":[72],"investigate":[74],"notion":[76],"counterexample":[78],"show":[80,99],"that":[81,100],"large":[83],"class":[84],"temporal":[86,120],"logics":[87],"beyond":[88],"admits":[90],"tree-like":[95,104,130,138,164],"transition":[96],"relation.":[97],"existence":[102],"is":[106],"related":[107],"universal":[110],"fragment":[111],"extended":[113],"branching":[114],"time":[115],"logic":[116],"based":[117],"on":[118,137],"w-regular":[119],"operators.":[121],"(ii)":[122],"present":[124],"symbolic":[126],"algorithms":[127],"generate":[129],"specifications.":[134],"(iii)":[135],"Based":[136],"extend":[141],"abstraction":[143],"refinement":[144],"methodology":[145],"developed":[146],"recently":[147],"by":[148],"Clarke":[149],"et":[150],"al.":[151],"(CAV'2000)":[152],"full":[154],"ACTL.":[155],"This":[156],"demonstrates":[157],"conceptual":[159],"simplicity":[160],"elegance":[162]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}