{"id":"https://openalex.org/W2170701417","doi":"https://doi.org/10.1109/memcod.2006.1695896","title":"Mixed symbolic representations for model checking software programs","display_name":"Mixed symbolic representations for model checking software programs","publication_year":2006,"publication_date":"2006-09-22","ids":{"openalex":"https://openalex.org/W2170701417","doi":"https://doi.org/10.1109/memcod.2006.1695896","mag":"2170701417"},"language":"en","primary_location":{"id":"doi:10.1109/memcod.2006.1695896","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2006.1695896","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fourth ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2006. MEMOCODE '06. Proceedings.","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/A5101995389","display_name":"Zijiang Yang","orcid":"https://orcid.org/0000-0001-7647-3718"},"institutions":[{"id":"https://openalex.org/I141649380","display_name":"Western Michigan University","ror":"https://ror.org/04j198w64","country_code":"US","type":"education","lineage":["https://openalex.org/I141649380"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zijiang Yang","raw_affiliation_strings":["Western Michigan University, Kalamazoo, MI, USA"],"affiliations":[{"raw_affiliation_string":"Western Michigan University, Kalamazoo, MI, USA","institution_ids":["https://openalex.org/I141649380"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100406890","display_name":"Chao Wang","orcid":"https://orcid.org/0000-0001-7398-1127"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chao Wang","raw_affiliation_strings":["NEC Laboratories of America, Inc., Princeton, NJ, USA"],"affiliations":[{"raw_affiliation_string":"NEC Laboratories of America, Inc., Princeton, NJ, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041231710","display_name":"Aarti Gupta","orcid":"https://orcid.org/0000-0001-6676-9400"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Gupta","raw_affiliation_strings":["NEC Laboratories of America, Inc., Princeton, NJ, USA"],"affiliations":[{"raw_affiliation_string":"NEC Laboratories of America, Inc., Princeton, NJ, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020028377","display_name":"Franjo Ivan\u010di\u0107","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"F. Ivancic","raw_affiliation_strings":["NEC Laboratories of America, Inc., Princeton, NJ, USA"],"affiliations":[{"raw_affiliation_string":"NEC Laboratories of America, Inc., Princeton, NJ, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101995389"],"corresponding_institution_ids":["https://openalex.org/I141649380"],"apc_list":null,"apc_paid":null,"fwci":3.3706,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.92586535,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"17","last_page":"26"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9991999864578247,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9984999895095825,"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/symbolic-trajectory-evaluation","display_name":"Symbolic trajectory evaluation","score":0.8267843127250671},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.7537459135055542},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7442381381988525},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.5719484686851501},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5559859871864319},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5357697606086731},{"id":"https://openalex.org/keywords/abstraction-model-checking","display_name":"Abstraction model checking","score":0.5199376344680786},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.5077413320541382},{"id":"https://openalex.org/keywords/symbolic-execution","display_name":"Symbolic execution","score":0.43307462334632874},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.42848819494247437},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.41839611530303955},{"id":"https://openalex.org/keywords/symbolic-data-analysis","display_name":"Symbolic data analysis","score":0.41263023018836975},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38629648089408875},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3097538352012634}],"concepts":[{"id":"https://openalex.org/C23123167","wikidata":"https://www.wikidata.org/wiki/Q7661193","display_name":"Symbolic trajectory evaluation","level":3,"score":0.8267843127250671},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.7537459135055542},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7442381381988525},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.5719484686851501},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5559859871864319},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5357697606086731},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.5199376344680786},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.5077413320541382},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.43307462334632874},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.42848819494247437},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.41839611530303955},{"id":"https://openalex.org/C65620979","wikidata":"https://www.wikidata.org/wiki/Q7661176","display_name":"Symbolic data analysis","level":2,"score":0.41263023018836975},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38629648089408875},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3097538352012634},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/memcod.2006.1695896","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2006.1695896","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fourth ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2006. MEMOCODE '06. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.98.2548","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.98.2548","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.wmich.edu/~zijiang/pub/Memocode06.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7699999809265137,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W240055707","https://openalex.org/W1499853177","https://openalex.org/W1502028089","https://openalex.org/W1503170978","https://openalex.org/W1533964197","https://openalex.org/W1553663883","https://openalex.org/W1554532808","https://openalex.org/W1606860058","https://openalex.org/W1691700263","https://openalex.org/W1787074469","https://openalex.org/W2017785995","https://openalex.org/W2028437460","https://openalex.org/W2046315901","https://openalex.org/W2054424606","https://openalex.org/W2057361103","https://openalex.org/W2062873592","https://openalex.org/W2080267935","https://openalex.org/W2109337044","https://openalex.org/W2117087357","https://openalex.org/W2129538349","https://openalex.org/W2143923161","https://openalex.org/W2153207819","https://openalex.org/W2160957305","https://openalex.org/W2163482209","https://openalex.org/W2171480813","https://openalex.org/W2340735175","https://openalex.org/W2913459036","https://openalex.org/W4213079124","https://openalex.org/W4231640108","https://openalex.org/W4243774091","https://openalex.org/W4255928847","https://openalex.org/W6629978691","https://openalex.org/W6633384678","https://openalex.org/W6635950276","https://openalex.org/W6637581219","https://openalex.org/W6638020115","https://openalex.org/W6677699145","https://openalex.org/W6679495168"],"related_works":["https://openalex.org/W2101264565","https://openalex.org/W2514597554","https://openalex.org/W3141167149","https://openalex.org/W345638404","https://openalex.org/W2147015581","https://openalex.org/W2144517099","https://openalex.org/W2044213223","https://openalex.org/W3194906003","https://openalex.org/W4245197793","https://openalex.org/W4254035807"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2],"efficient":[3],"symbolic":[4,15,44,60,91],"search":[5,61,92],"algorithm":[6,12,93],"for":[7,33],"software":[8,85],"model":[9,47,77,122],"checking.":[10],"The":[11,102],"combines":[13],"multiple":[14],"representations":[16,45],"to":[17,46,67,119],"efficiently":[18],"represent":[19],"the":[20,74,89],"transition":[21],"relation":[22],"and":[23,26,35,54,57,63,115,128],"reachable":[24],"states":[25],"uses":[27],"a":[28],"combination":[29],"of":[30,76,112],"decision":[31],"procedures":[32],"Boolean":[34],"integer":[36],"representations.":[37],"Our":[38,80],"main":[39],"contributions":[40],"include:":[41],"(1)":[42],"mixed":[43],"C":[48],"programs":[49,69,86],"with":[50],"rich":[51],"data":[52],"types":[53],"complex":[55],"expressions;":[56],"(2)":[58],"new":[59,90],"strategies":[62],"optimization":[64],"techniques":[65,104],"specific":[66],"sequential":[68,110],"that":[70,88],"can":[71,94],"significantly":[72],"improve":[73],"scalability":[75],"checking":[78,123],"algorithms.":[79],"controlled":[81],"experiments":[82],"on":[83,126],"real-world":[84],"show":[87],"achieve":[95],"several":[96],"orders-of-magnitude":[97],"improvements":[98],"over":[99],"existing":[100],"methods.":[101],"proposed":[103],"are":[105],"extremely":[106],"competitive":[107],"in":[108],"handling":[109],"models":[111],"non-trivial":[113],"sizes,":[114],"also":[116],"compare":[117],"favorably":[118],"popular":[120],"Boolean-level":[121],"algorithms":[124],"based":[125],"BDDs":[127],"SAT":[129]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
