{"id":"https://openalex.org/W2099074223","doi":"https://doi.org/10.1109/memcod.2005.1487897","title":"Verification of parameterized hierarchical state machines using action language verifier","display_name":"Verification of parameterized hierarchical state machines using action language verifier","publication_year":2005,"publication_date":"2005-07-27","ids":{"openalex":"https://openalex.org/W2099074223","doi":"https://doi.org/10.1109/memcod.2005.1487897","mag":"2099074223"},"language":"en","primary_location":{"id":"doi:10.1109/memcod.2005.1487897","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2005.1487897","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2005. MEMOCODE '05.","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/A5051741973","display_name":"Tuba Yavuz-Kahveci","orcid":null},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"T. Yavuz-Kahveci","raw_affiliation_strings":["CISE Department, University of Florida, Gainesville, FL, USA"],"affiliations":[{"raw_affiliation_string":"CISE Department, University of Florida, Gainesville, FL, USA","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039991493","display_name":"Tevfik Bultan","orcid":"https://orcid.org/0000-0003-2993-1215"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T. Bultan","raw_affiliation_strings":["Department of Computer Science, University of California, Santa Barbara, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051741973"],"corresponding_institution_ids":["https://openalex.org/I33213144"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.17081014,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"3","issue":null,"first_page":"79","last_page":"88"},"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.9977999925613403,"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.9965000152587891,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8517727851867676},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7394123077392578},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7010617256164551},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6874127984046936},{"id":"https://openalex.org/keywords/symbolic-trajectory-evaluation","display_name":"Symbolic trajectory evaluation","score":0.5723183155059814},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5588393807411194},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.5425390005111694},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5407322645187378},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5366716980934143},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.5313934087753296},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5126994848251343},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4157290756702423},{"id":"https://openalex.org/keywords/abstract-state-machines","display_name":"Abstract state machines","score":0.41286951303482056},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3267298936843872}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8517727851867676},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7394123077392578},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7010617256164551},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6874127984046936},{"id":"https://openalex.org/C23123167","wikidata":"https://www.wikidata.org/wiki/Q7661193","display_name":"Symbolic trajectory evaluation","level":3,"score":0.5723183155059814},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5588393807411194},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.5425390005111694},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5407322645187378},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5366716980934143},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.5313934087753296},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5126994848251343},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4157290756702423},{"id":"https://openalex.org/C145243422","wikidata":"https://www.wikidata.org/wiki/Q333385","display_name":"Abstract state machines","level":3,"score":0.41286951303482056},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3267298936843872}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/memcod.2005.1487897","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2005.1487897","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2005. MEMOCODE '05.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.128.5774","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.5774","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucsb.edu/~bultan/publications/memocode05.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W203949653","https://openalex.org/W1484869147","https://openalex.org/W1501640954","https://openalex.org/W1508873117","https://openalex.org/W1578141429","https://openalex.org/W1605302571","https://openalex.org/W1813383841","https://openalex.org/W1837934228","https://openalex.org/W1977882104","https://openalex.org/W1995151557","https://openalex.org/W1997268799","https://openalex.org/W2000489506","https://openalex.org/W2054424606","https://openalex.org/W2074070820","https://openalex.org/W2096161423","https://openalex.org/W2099529102","https://openalex.org/W2112338943","https://openalex.org/W2142504844","https://openalex.org/W2143923161","https://openalex.org/W2147880466","https://openalex.org/W2149932816","https://openalex.org/W2151056896","https://openalex.org/W2167671438","https://openalex.org/W4231639797","https://openalex.org/W4235527454","https://openalex.org/W6681870916"],"related_works":["https://openalex.org/W2098353690","https://openalex.org/W4251237796","https://openalex.org/W2371707945","https://openalex.org/W2348641362","https://openalex.org/W113732979","https://openalex.org/W2401075618","https://openalex.org/W2154046960","https://openalex.org/W2122355433","https://openalex.org/W1483297389","https://openalex.org/W2906490231"],"abstract_inverted_index":{"Action":[0],"language":[1],"verifier":[2],"(ALV)":[3],"is":[4],"an":[5,124],"infinite-state":[6],"symbolic":[7],"model":[8],"checker.":[9],"ALV":[10,54],"can":[11,24],"verify":[12,130],"(or":[13],"falsify,":[14],"by":[15,73],"generating":[16],"counter-examples)":[17],"temporal":[18],"logic":[19,32],"properties":[20,133],"of":[21,30,58,79,93,99,123,134],"systems":[22],"that":[23],"be":[25],"modeled":[26],"using":[27,108,137],"a":[28],"combination":[29],"Boolean":[31],"and":[33,40,45,82,85,121,129],"linear":[34],"arithmetic":[35],"expressions":[36],"on":[37],"Boolean,":[38],"enumerated":[39],"(possibly":[41],"unbounded)":[42],"integer":[43,47,106],"variables":[44,107],"parameterized":[46,59,86,101],"constants.":[48],"In":[49],"this":[50,135],"paper,":[51],"we":[52],"apply":[53,114],"to":[55,105,118],"the":[56,66,90,97,100,109,115,119],"verification":[57],"hierarchical":[60,70],"state":[61,71],"machine":[62],"specifications.":[63],"We":[64,88,113],"extend":[65],"standard":[67],"notation":[68],"for":[69,76],"machines":[72],"introducing":[74],"primitives":[75],"explicit":[77],"specification":[78,120,136],"asynchronous":[80],"processes":[81,102],"their":[83],"finite":[84],"instantiations.":[87],"define":[89],"formal":[91],"semantics":[92],"these":[94],"primitives,":[95],"where":[96],"states":[98],"are":[103],"mapped":[104],"counting":[110],"abstraction":[111],"technique.":[112],"presented":[116],"approach":[117],"analysis":[122],"airport":[125],"ground":[126],"traffic":[127],"controller":[128],"several":[131],"correctness":[132],"ALV.":[138]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}