{"id":"https://openalex.org/W1982406834","doi":"https://doi.org/10.1145/2593489.2593498","title":"Compiling polychronous programs into conditional partial orders for ASIP synthesis","display_name":"Compiling polychronous programs into conditional partial orders for ASIP synthesis","publication_year":2014,"publication_date":"2014-05-20","ids":{"openalex":"https://openalex.org/W1982406834","doi":"https://doi.org/10.1145/2593489.2593498","mag":"1982406834"},"language":"en","primary_location":{"id":"doi:10.1145/2593489.2593498","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2593489.2593498","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2nd FME Workshop on Formal Methods in Software Engineering","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/A5008338155","display_name":"Mahesh Nanjundappa","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mahesh Nanjundappa","raw_affiliation_strings":["Virginia Tech, USA","Virginia Tech, USA,"],"affiliations":[{"raw_affiliation_string":"Virginia Tech, USA","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"Virginia Tech, USA,","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021517996","display_name":"Sandeep K. Shukla","orcid":"https://orcid.org/0000-0001-5525-7426"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sandeep K. Shukla","raw_affiliation_strings":["Virginia Tech, USA","Virginia Tech, USA,"],"affiliations":[{"raw_affiliation_string":"Virginia Tech, USA","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"Virginia Tech, USA,","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008338155"],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06187956,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"38","last_page":"44"},"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/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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9984999895095825,"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/computer-science","display_name":"Computer science","score":0.8937700986862183},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5317296981811523},{"id":"https://openalex.org/keywords/control-flow","display_name":"Control flow","score":0.5288917422294617},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45350268483161926},{"id":"https://openalex.org/keywords/program-synthesis","display_name":"Program synthesis","score":0.44640234112739563},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.41403234004974365}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8937700986862183},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5317296981811523},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.5288917422294617},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45350268483161926},{"id":"https://openalex.org/C2776937632","wikidata":"https://www.wikidata.org/wiki/Q4117718","display_name":"Program synthesis","level":2,"score":0.44640234112739563},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.41403234004974365},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2593489.2593498","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2593489.2593498","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2nd FME Workshop on Formal Methods in Software Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1505815303","https://openalex.org/W1820309519","https://openalex.org/W1963984425","https://openalex.org/W2031381504","https://openalex.org/W2100500718","https://openalex.org/W2102175790","https://openalex.org/W2106800670","https://openalex.org/W2159627717","https://openalex.org/W2160249188"],"related_works":["https://openalex.org/W2384475851","https://openalex.org/W2000444236","https://openalex.org/W2353602216","https://openalex.org/W2367078749","https://openalex.org/W1602413278","https://openalex.org/W1528423264","https://openalex.org/W2595205408","https://openalex.org/W2139185130","https://openalex.org/W161484515","https://openalex.org/W2546056923"],"abstract_inverted_index":{"Synthesis":[0],"of":[1,22,151,184,199,215,290],"application":[2,98,249,282],"specific":[3,99,182,250,283],"hardware":[4,27,32,100,257],"which":[5,90],"minimizes":[6],"area":[7],"while":[8],"not":[9],"sacrificing":[10],"latency":[11],"or":[12],"clock":[13,191],"speed":[14],"is":[15,28,43,154,160,176],"a":[16,84,115,126,136,177,212],"much":[17],"researched":[18],"problem.":[19],"In":[20,235],"most":[21],"the":[23,26,41,46,72,93,181,259],"past":[24],"works,":[25],"described":[29,113],"structurally":[30],"in":[31,186],"description":[33],"languages":[34,188],"with":[35,83,196,206,211,230,268],"behaviors":[36,68,76,217],"attached":[37],"to":[38,49,80,220,227,245,255],"structures.":[39],"Since":[40,97],"structure":[42,171],"manually":[44],"decided,":[45],"architect":[47],"has":[48,163],"decide":[50],"whether":[51],"certain":[52,67],"components":[53,229],"can":[54,64,77,242],"be":[55,78,243],"reused":[56],"without":[57],"increasing":[58],"latency.":[59],"For":[60],"example,":[61],"if":[62],"one":[63],"prove":[65],"that":[66,155,218],"never":[69],"happen":[70],"at":[71],"same":[73],"time,":[74],"these":[75],"mapped":[79],"common":[81],"components,":[82],"simple":[85,231],"control":[86,170,291],"state":[87],"machine":[88],"determining":[89],"behavioral":[91],"mode":[92],"behavior":[94],"belongs":[95],"to.":[96],"are":[101,111,279],"used":[102,244],"as":[103,114,119,273],"co-processors":[104],"for":[105,140],"performance":[106],"boost,":[107],"and":[108,134,166,193,202,223,292],"such":[109,248],"computations":[110],"best":[112],"data-flow":[116,129],"computation":[117],"(such":[118],"signal":[120],"processing,":[121],"encryption":[122],"etc.,),":[123],"we":[124,238,278],"choose":[125],"high":[127],"level":[128],"oriented":[130],"formal":[131,164],"specification":[132,142,157],"language,":[133,143],"use":[135],"new":[137],"semantic":[138],"model":[139],"this":[141,236],"namely":[144,190],"conditional":[145,173,270],"partial":[146,174],"order":[147,175],"graphs.":[148],"The":[149],"advantage":[150],"our":[152,156],"approach":[153],"language":[158,261],"MRICDF":[159,241],"graphical,":[161],"polychronous,":[162],"semantics,":[165],"hence":[167],"synthesizing":[168,266,280],"its":[169],"into":[172],"natural":[178,213],"fit.":[179],"Additionally,":[180],"calculus":[183],"constraints":[185],"polychronous":[187,260],"--":[189],"calculus,":[192],"associated":[194],"analysis":[195],"Boolean":[197],"theory":[198],"prime":[200],"implicates,":[201],"constraint":[203],"satisfiability":[204],"checking":[205],"SMT":[207],"solvers":[208],"provide":[209],"us":[210,226],"way":[214],"discovering":[216],"belong":[219],"disjoint":[221],"modes,":[222],"thereby":[224],"allow":[225],"reuse":[228],"micro-instruction":[232],"set":[233,285],"synthesis.":[234],"paper,":[237],"show":[239],"how":[240],"formally":[246],"synthesize":[247,256],"instruction":[251,284],"processors.":[252],"Past":[253],"approaches":[254],"from":[258],"SIGNAL":[262],"were":[263],"focused":[264],"on":[265],"logic":[267],"hierarchical":[269],"dependency":[271],"graphs":[272],"internal":[274],"representation.":[275],"Unlike":[276],"those,":[277],"an":[281],"processor":[286],"by":[287],"automated":[288],"synthesis":[289],"scheduling":[293],"data-path.":[294]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}