{"id":"https://openalex.org/W1985602478","doi":"https://doi.org/10.1109/saci.2014.6840074","title":"A data flow graph generation method starting from c description by handling loop nest hierarchy","display_name":"A data flow graph generation method starting from c description by handling loop nest hierarchy","publication_year":2014,"publication_date":"2014-05-01","ids":{"openalex":"https://openalex.org/W1985602478","doi":"https://doi.org/10.1109/saci.2014.6840074","mag":"1985602478"},"language":"en","primary_location":{"id":"doi:10.1109/saci.2014.6840074","is_oa":false,"landing_page_url":"https://doi.org/10.1109/saci.2014.6840074","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE 9th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI)","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/A5033477246","display_name":"P\u00e9ter Arat\u00f3","orcid":"https://orcid.org/0000-0003-2627-0511"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Peter Arato","raw_affiliation_strings":["Department of Control Engineering and Information Technology, Budapest University of Technology and Economics, Budapest, Hungary","Department of Control Engineering and Information Technology, Budapest University of Technology and Economics, Hungary 1117"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Control Engineering and Information Technology, Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]},{"raw_affiliation_string":"Department of Control Engineering and Information Technology, Budapest University of Technology and Economics, Hungary 1117","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043700686","display_name":"Gergely Suba","orcid":null},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Gergely Suba","raw_affiliation_strings":["Department of Control Engineering and Information Technology, Budapest University of Technology and Economics, Budapest, Hungary","Department of Control Engineering and Information Technology, Budapest University of Technology and Economics, Hungary 1117"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Control Engineering and Information Technology, Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]},{"raw_affiliation_string":"Department of Control Engineering and Information Technology, Budapest University of Technology and Economics, Hungary 1117","institution_ids":["https://openalex.org/I29770179"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I29770179"],"apc_list":null,"apc_paid":null,"fwci":0.6302,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.68022165,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9998999834060669,"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.9998999834060669,"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/T10054","display_name":"Parallel Computing and Optimization 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/T10829","display_name":"Interconnection Networks and Systems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.8266713619232178},{"id":"https://openalex.org/keywords/graph-rewriting","display_name":"Graph rewriting","score":0.6388698220252991},{"id":"https://openalex.org/keywords/data-flow-analysis","display_name":"Data-flow analysis","score":0.6304576396942139},{"id":"https://openalex.org/keywords/data-flow-diagram","display_name":"Data flow diagram","score":0.6265941858291626},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.6127987504005432},{"id":"https://openalex.org/keywords/control-flow-graph","display_name":"Control flow graph","score":0.596206545829773},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5879812240600586},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5785300135612488},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.565041184425354},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.544148325920105},{"id":"https://openalex.org/keywords/loop-fusion","display_name":"Loop fusion","score":0.5104962587356567},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.46101701259613037},{"id":"https://openalex.org/keywords/loop-fission","display_name":"Loop fission","score":0.4466995298862457},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.4251912236213684},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.34623491764068604},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.13166791200637817},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.12209412455558777},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11511412262916565}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8266713619232178},{"id":"https://openalex.org/C558772884","wikidata":"https://www.wikidata.org/wiki/Q1508564","display_name":"Graph rewriting","level":3,"score":0.6388698220252991},{"id":"https://openalex.org/C88468194","wikidata":"https://www.wikidata.org/wiki/Q1172416","display_name":"Data-flow analysis","level":3,"score":0.6304576396942139},{"id":"https://openalex.org/C489000","wikidata":"https://www.wikidata.org/wiki/Q747385","display_name":"Data flow diagram","level":2,"score":0.6265941858291626},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.6127987504005432},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.596206545829773},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5879812240600586},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5785300135612488},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.565041184425354},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.544148325920105},{"id":"https://openalex.org/C82653869","wikidata":"https://www.wikidata.org/wiki/Q6675821","display_name":"Loop fusion","level":3,"score":0.5104962587356567},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.46101701259613037},{"id":"https://openalex.org/C134718785","wikidata":"https://www.wikidata.org/wiki/Q6675821","display_name":"Loop fission","level":3,"score":0.4466995298862457},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.4251912236213684},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.34623491764068604},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.13166791200637817},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.12209412455558777},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11511412262916565},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/saci.2014.6840074","is_oa":false,"landing_page_url":"https://doi.org/10.1109/saci.2014.6840074","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE 9th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321994","display_name":"Hungarian Scientific Research Fund","ror":"https://ror.org/00v349e63"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W42313609","https://openalex.org/W107748845","https://openalex.org/W1982205631","https://openalex.org/W2075468582","https://openalex.org/W2121001627","https://openalex.org/W2147961213","https://openalex.org/W2166075056","https://openalex.org/W2169736898","https://openalex.org/W2483950540"],"related_works":["https://openalex.org/W2074495974","https://openalex.org/W2040522199","https://openalex.org/W1602571691","https://openalex.org/W154155438","https://openalex.org/W1532159642","https://openalex.org/W2342605656","https://openalex.org/W2114948246","https://openalex.org/W1508919682","https://openalex.org/W2109246102","https://openalex.org/W1985602478"],"abstract_inverted_index":{"The":[0,34,89,127],"system-level":[1],"synthesis":[2,39,71],"of":[3,13,37,46,51,74,96,130],"complex":[4],"hardware":[5],"or":[6],"multiprocessing":[7],"systems":[8],"starts":[9],"from":[10,93,112],"some":[11,44],"kind":[12,45],"a":[14,20,58,104,116,136],"task":[15],"description":[16],"formalized":[17],"usually":[18],"in":[19,68,77],"high-level":[21],"programming":[22],"language.":[23],"For":[24],"this":[25],"purpose,":[26],"the":[27,38,52,69,75,83,94,110,113,124,131],"C":[28],"language":[29],"is":[30,65,81],"used":[31],"very":[32],"often.":[33],"further":[35],"steps":[36,129],"procedure":[40],"are":[41,133],"based":[42],"on":[43],"data":[47,118],"flow":[48,119],"graph":[49,59,120],"representation":[50,60,121],"task.":[53],"Therefore,":[54],"transforming":[55],"C-code":[56,84,114],"into":[57,115],"(as":[61],"systematic":[62],"as":[63],"possible)":[64],"crucial":[66],"step":[67],"whole":[70],"procedure.":[72],"One":[73],"difficulty":[76,95],"formalizing":[78],"transformation":[79,111],"algorithm":[80],"that":[82],"may":[85],"contain":[86],"nested":[87,125],"loops.":[88,126],"existing":[90],"solutions":[91],"suffer":[92],"handling":[97,123],"such":[98],"loop":[99],"nest":[100],"hierarchy.":[101],"We":[102],"present":[103],"method,":[105],"which":[106],"can":[107],"solve":[108],"systematically":[109],"multi-rate":[117],"by":[122,135],"main":[128],"method":[132],"illustrated":[134],"simple":[137],"example.":[138]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}