{"id":"https://openalex.org/W2120150877","doi":"https://doi.org/10.1109/rttas.2004.1317295","title":"Incremental satisfiability counting for real-time systems","display_name":"Incremental satisfiability counting for real-time systems","publication_year":2004,"publication_date":"2004-11-13","ids":{"openalex":"https://openalex.org/W2120150877","doi":"https://doi.org/10.1109/rttas.2004.1317295","mag":"2120150877"},"language":"en","primary_location":{"id":"doi:10.1109/rttas.2004.1317295","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rttas.2004.1317295","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","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/A5055377327","display_name":"\u015etefan Andrei","orcid":"https://orcid.org/0000-0002-0216-1380"},"institutions":[{"id":"https://openalex.org/I138164181","display_name":"Alexandru Ioan Cuza University","ror":"https://ror.org/022kvet57","country_code":"RO","type":"education","lineage":["https://openalex.org/I138164181"]},{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["RO","SG"],"is_corresponding":true,"raw_author_name":"S. Andrei","raw_affiliation_strings":["Faculty of Computer Science, Alexandru Ioan Cuza\uc2a0University, Iasi, Romania","Singapore-MIT Alliance, CS Programme, National University of Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Alexandru Ioan Cuza\uc2a0University, Iasi, Romania","institution_ids":["https://openalex.org/I138164181"]},{"raw_affiliation_string":"Singapore-MIT Alliance, CS Programme, National University of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108375143","display_name":"W.-N. Chin","orcid":null},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Wei-Ngan Chin","raw_affiliation_strings":["School of Computing, National University of Singapore, Singapore","National University of Singapore"],"affiliations":[{"raw_affiliation_string":"School of Computing, National University of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]},{"raw_affiliation_string":"National University of Singapore","institution_ids":["https://openalex.org/I165932596"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055377327"],"corresponding_institution_ids":["https://openalex.org/I138164181","https://openalex.org/I165932596"],"apc_list":null,"apc_paid":null,"fwci":3.4542,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.92523566,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"10","issue":null,"first_page":"482","last_page":"489"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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/T10142","display_name":"Formal Methods in Verification","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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9994000196456909,"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.9961000084877014,"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/satisfiability","display_name":"Satisfiability","score":0.8942667245864868},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6762710809707642},{"id":"https://openalex.org/keywords/assertion","display_name":"Assertion","score":0.5448586344718933},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5259071588516235},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5121316909790039},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4857914447784424},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.44805997610092163},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.4466196298599243},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.44202297925949097},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43891412019729614},{"id":"https://openalex.org/keywords/propositional-formula","display_name":"Propositional formula","score":0.4356473386287689},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2957172989845276},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.2122381031513214},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12027636170387268}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.8942667245864868},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6762710809707642},{"id":"https://openalex.org/C40422974","wikidata":"https://www.wikidata.org/wiki/Q741248","display_name":"Assertion","level":2,"score":0.5448586344718933},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5259071588516235},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5121316909790039},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4857914447784424},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.44805997610092163},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.4466196298599243},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.44202297925949097},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43891412019729614},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.4356473386287689},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2957172989845276},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.2122381031513214},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12027636170387268},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.0},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/rttas.2004.1317295","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rttas.2004.1317295","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","raw_type":"proceedings-article"},{"id":"pmh:oai:scholarbank.nus.edu.sg:10635/41484","is_oa":false,"landing_page_url":"http://scholarbank.nus.edu.sg/handle/10635/41484","pdf_url":null,"source":{"id":"https://openalex.org/S7407052290","display_name":"National University of Singapore","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus","raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1501731334","https://openalex.org/W1508190831","https://openalex.org/W1517173520","https://openalex.org/W1565010992","https://openalex.org/W1565099081","https://openalex.org/W1590315663","https://openalex.org/W1787074469","https://openalex.org/W1964821516","https://openalex.org/W2024148935","https://openalex.org/W2038995301","https://openalex.org/W2050917944","https://openalex.org/W2054554282","https://openalex.org/W2056359803","https://openalex.org/W2057361103","https://openalex.org/W2061438988","https://openalex.org/W2080267935","https://openalex.org/W2110123236","https://openalex.org/W2112364980","https://openalex.org/W2117189826","https://openalex.org/W2120150877","https://openalex.org/W2152426072","https://openalex.org/W2496279393","https://openalex.org/W3121841464","https://openalex.org/W4241233758","https://openalex.org/W4300021588","https://openalex.org/W6630494159","https://openalex.org/W6633958117","https://openalex.org/W6638020115"],"related_works":["https://openalex.org/W2480084299","https://openalex.org/W3107131366","https://openalex.org/W2014111643","https://openalex.org/W3136261533","https://openalex.org/W2235115558","https://openalex.org/W3120153087","https://openalex.org/W1608133301","https://openalex.org/W3128448798","https://openalex.org/W4248235708","https://openalex.org/W2153390672"],"abstract_inverted_index":{"Testing":[0],"constraints":[1,26],"for":[2,89,109],"real-time":[3],"systems":[4],"are":[5,64,74,102],"usually":[6],"verified":[7],"through":[8],"the":[9,22,32,110],"satisfiability":[10,136],"of":[11,24,34,38,112],"propositional":[12],"formulae.":[13],"In":[14],"this":[15,82,130],"paper,":[16],"we":[17,84,132],"propose":[18,85],"an":[19,68,86],"alternative":[20],"where":[21,71],"verification":[23],"timing":[25],"can":[27,43,138],"be":[28,139],"done":[29],"by":[30],"counting":[31,90,137],"number":[33,42],"truth":[35],"assignments":[36],"instead":[37],"Boolean":[39],"satisfiability.":[40,91],"This":[41,107],"also":[44],"tell":[45],"us":[46],"how":[47,134],"\"far":[48],"away\"":[49],"a":[50,78,142],"given":[51],"specification":[52,150],"is":[53,96,151],"from":[54],"satisfying":[55],"its":[56,149],"safety":[57,62],"assertion.":[58],"Furthermore,":[59],"specifications":[60],"and":[61],"assertions":[63],"often":[65],"modified":[66],"in":[67],"incremental":[69,87,94,135],"fashion,":[70],"problematic":[72],"bugs":[73],"fixed":[75],"one":[76],"at":[77],"time.":[79],"To":[80,128],"support":[81],"development,":[83],"algorithm":[88,95],"Our":[92],"proposed":[93],"optimal":[97],"as":[98,115],"no":[99],"unnecessary":[100],"nodes":[101],"created":[103],"during":[104],"each":[105],"counting.":[106],"works":[108],"class":[111],"expressions,":[113],"known":[114],"path":[116],"RTL":[117],"([F.":[118],"Jahanian":[119],"et":[120,125],"al.":[121,126],"(1987),":[122],"F.":[123],"Wang":[124],"(1994)]).":[127],"illustrate":[129],"application,":[131],"show":[133],"applied":[140],"to":[141],"well-known":[143],"rail-road":[144],"crossing":[145],"example,":[146],"particularly":[147],"when":[148],"still":[152],"being":[153],"refined.":[154]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}