{"id":"https://openalex.org/W2165304220","doi":"https://doi.org/10.1109/isqed.2004.1283659","title":"Automated formal verification of scheduling process using finite state machines with datapath (FSMD)","display_name":"Automated formal verification of scheduling process using finite state machines with datapath (FSMD)","publication_year":2004,"publication_date":"2004-05-06","ids":{"openalex":"https://openalex.org/W2165304220","doi":"https://doi.org/10.1109/isqed.2004.1283659","mag":"2165304220"},"language":"en","primary_location":{"id":"doi:10.1109/isqed.2004.1283659","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isqed.2004.1283659","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SCS 2003. International Symposium on Signals, Circuits and Systems. Proceedings (Cat. No.03EX720)","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/A5100774710","display_name":"Young Sik Kim","orcid":"https://orcid.org/0000-0003-4114-4935"},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Youngsik Kim","raw_affiliation_strings":["Electrical Engineering and Computer Science Syracuse University Syracuse, New York, 13244, USA"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Syracuse University Syracuse, New York, 13244, USA","institution_ids":["https://openalex.org/I70983195"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006098267","display_name":"S. Kopuri","orcid":null},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Kopuri","raw_affiliation_strings":["Electrical Engineering and Computer Science Syracuse University Syracuse, New York, 13244, USA"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Syracuse University Syracuse, New York, 13244, USA","institution_ids":["https://openalex.org/I70983195"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081492188","display_name":"Najme Mansouri","orcid":"https://orcid.org/0000-0002-1928-5566"},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"N. Mansouri","raw_affiliation_strings":["Electrical Engineering and Computer Science Syracuse University Syracuse, New York, 13244, USA"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Syracuse University Syracuse, New York, 13244, USA","institution_ids":["https://openalex.org/I70983195"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100774710"],"corresponding_institution_ids":["https://openalex.org/I70983195"],"apc_list":null,"apc_paid":null,"fwci":0.5293,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.68372832,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"110","last_page":"115"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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/T10933","display_name":"Real-Time Systems Scheduling","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/datapath","display_name":"Datapath","score":0.7753180265426636},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7532435655593872},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7399413585662842},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.6893523931503296},{"id":"https://openalex.org/keywords/high-level-synthesis","display_name":"High-level synthesis","score":0.6861542463302612},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.6474835276603699},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5114959478378296},{"id":"https://openalex.org/keywords/formal-specification","display_name":"Formal specification","score":0.48631057143211365},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4828405976295471},{"id":"https://openalex.org/keywords/formal-methods","display_name":"Formal methods","score":0.4800192415714264},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.473989874124527},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.45723801851272583},{"id":"https://openalex.org/keywords/data-flow-analysis","display_name":"Data-flow analysis","score":0.45272377133369446},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.44563132524490356},{"id":"https://openalex.org/keywords/process-calculus","display_name":"Process calculus","score":0.4354253113269806},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41029149293899536},{"id":"https://openalex.org/keywords/data-flow-diagram","display_name":"Data flow diagram","score":0.291420042514801},{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.2874760627746582},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.23436182737350464},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.21343833208084106},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15092280507087708},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.11581581830978394},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.11051717400550842},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.10613170266151428}],"concepts":[{"id":"https://openalex.org/C2781198647","wikidata":"https://www.wikidata.org/wiki/Q1633673","display_name":"Datapath","level":2,"score":0.7753180265426636},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7532435655593872},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7399413585662842},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.6893523931503296},{"id":"https://openalex.org/C58013763","wikidata":"https://www.wikidata.org/wiki/Q5754574","display_name":"High-level synthesis","level":3,"score":0.6861542463302612},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.6474835276603699},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5114959478378296},{"id":"https://openalex.org/C116253237","wikidata":"https://www.wikidata.org/wiki/Q1437424","display_name":"Formal specification","level":2,"score":0.48631057143211365},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4828405976295471},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.4800192415714264},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.473989874124527},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.45723801851272583},{"id":"https://openalex.org/C88468194","wikidata":"https://www.wikidata.org/wiki/Q1172416","display_name":"Data-flow analysis","level":3,"score":0.45272377133369446},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.44563132524490356},{"id":"https://openalex.org/C161771561","wikidata":"https://www.wikidata.org/wiki/Q1970286","display_name":"Process calculus","level":2,"score":0.4354253113269806},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41029149293899536},{"id":"https://openalex.org/C489000","wikidata":"https://www.wikidata.org/wiki/Q747385","display_name":"Data flow diagram","level":2,"score":0.291420042514801},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.2874760627746582},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.23436182737350464},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.21343833208084106},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15092280507087708},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.11581581830978394},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.11051717400550842},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.10613170266151428}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isqed.2004.1283659","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isqed.2004.1283659","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SCS 2003. International Symposium on Signals, Circuits and Systems. Proceedings (Cat. No.03EX720)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.496.5565","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.496.5565","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.york.ac.uk/rts/docs/SIGDA-Compendium-1994-2004/papers/2004/isqed04/pdffiles/p110.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":11,"referenced_works":["https://openalex.org/W1543281322","https://openalex.org/W1582385421","https://openalex.org/W1583809610","https://openalex.org/W2026880718","https://openalex.org/W2104511190","https://openalex.org/W2123972661","https://openalex.org/W2140735019","https://openalex.org/W2171318521","https://openalex.org/W4234537939","https://openalex.org/W4234848736","https://openalex.org/W4240835585"],"related_works":["https://openalex.org/W2166021916","https://openalex.org/W1994884893","https://openalex.org/W1839177134","https://openalex.org/W2004001588","https://openalex.org/W2135482679","https://openalex.org/W2084005807","https://openalex.org/W2137686989","https://openalex.org/W2375695813","https://openalex.org/W1990026810","https://openalex.org/W1903431847"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,36,87],"methodology":[4,37],"for":[5],"the":[6,30,45,49,57,76,95,101],"formal":[7],"veri-fication":[8],"of":[9,16,32,59,80,92,94],"scheduling":[10],"during":[11],"High-Level":[12],"Synthesis(HLS).":[13],"A":[14],"notion":[15],"functional":[17,42],"equivalence":[18,43,68],"between":[19,44],"two":[20],"Finite":[21],"State":[22],"Machines":[23],"with":[24,86],"Datapath":[25],"(FSMDs)":[26],"is":[27,56,61,97],"defined,":[28],"on":[29],"basis":[31],"which":[33],"we":[34],"propose":[35],"to":[38],"verify":[39],"scheduling.":[40],"The":[41,67,90],"behavioral":[46],"specifi-cation":[47,78],"and":[48,73],"scheduled":[50],"Control-Data":[51],"Flow":[52],"Graph":[53],"(CDFG)-":[54],"that":[55],"result":[58],"scheduling-":[60],"established":[62],"using":[63],"their":[64],"FSMD":[65],"models.":[66],"conditions":[69],"are":[70],"mathemati-cally":[71],"modeled":[72],"implemented":[74],"in":[75],"higher-order":[77],"language":[79],"theorem":[81],"proving":[82],"environment":[83],"PVS[11],":[84],"integrated":[85],"HLS":[88],"tool.":[89],"proof":[91,103],"correctness":[93],"design":[96],"subsequently":[98],"verified":[99],"by":[100],"PVS":[102],"checker.":[104],"1":[105]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}