{"title":"Protocol merging: a VHDL-based method for clock cycle minimizing and protocol preserving scheduling of IO-operations","authors":"W. Ecker, M. Glesner, Andreas Vombach","doi":"10.5555/198174.198342","DOIUrl":"https://doi.org/10.5555/198174.198342","url":null,"abstract":"This paper presents a new algorithm for clock cycle minimizing and protocol preserving scheduling of input and output operations. The algorithm relies on the possibility to overlap protocols at di erent ports in time without changing the behavior. It merges the operations required for complete protocols and allows thus for a compact schedule of a set of correlated protocols. Both, input and scheduled output for subsequent High-Leveland RT-Synthesis use VHDL for description.","PeriodicalId":377366,"journal":{"name":"European Design Automation Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116112392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
C. Bayol, B. Soulas, D. Borrione, Fulvio Corno, P. Prinetto
{"title":"A process algebra interpretation of a verification oriented overlanguage of VHDL","authors":"C. Bayol, B. Soulas, D. Borrione, Fulvio Corno, P. Prinetto","doi":"10.1145/198174.198314","DOIUrl":"https://doi.org/10.1145/198174.198314","url":null,"abstract":"The VOVHDL language was defined as a verification oriented VHDL-based language in order to obtain a VHDL simulable specification at system level and to be able to verify this specification in a process algebra approach. The paper presents a formal semantic model for VOVHDL in terms of parallel composition of labelled transition systems, and its implementation with the EVAL CCS-based verification tool.","PeriodicalId":377366,"journal":{"name":"European Design Automation Conference","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116125498","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Formal verification of behavioral VHDL specifications: a case study","authors":"F. Nicoli, L. Pierre","doi":"10.5555/198174.198328","DOIUrl":"https://doi.org/10.5555/198174.198328","url":null,"abstract":"This paper addresses the problem of formally verifying VlIDL descriptiotrs. More I)ri:cisc:ly, wc cheek the correctness of a VHDL nrchiieclnrc w.r.t. another archilectlrre of the sa.me enthy. Both of them are translated into recursive funct.ional forms. and t.he proof of their equivalence is realized by means of the Boyer-Moore theorem prover. Our methodology is illustrated by a significa.nt. example Ihat. has been proposed by THOMSON. This benchmark prescnt.s interesting characteristics and it.s proof is not obvious.","PeriodicalId":377366,"journal":{"name":"European Design Automation Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128382790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Static analysis for VHDL model evaluation","authors":"Mario Stefanoni","doi":"10.5555/198174.198333","DOIUrl":"https://doi.org/10.5555/198174.198333","url":null,"abstract":"Automated VHDL some analysis may be a valuable approach to develop. measure and compare moakls managed by high-level design tools. Moreover. VHDL co& should be developed accorfiing to some well-founded guidelines and in a measurable way to improve the quality of the overall design prmess. This paper aims to dexribe in a detailed way a part of SAVE prototype exploring the areas of complexity analysis and simulation effliency analysis starring from the VHDL system description.","PeriodicalId":377366,"journal":{"name":"European Design Automation Conference","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122835267","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An experimental analysis of the effectiveness of the circular self-test path technique","authors":"P. Prinetto, Fulvio Corno, M. Reorda","doi":"10.1145/198174.198254","DOIUrl":"https://doi.org/10.1145/198174.198254","url":null,"abstract":"The paper analyzes the effectiveness of the Circular Self-Test Path technique from an experimental point of view. Several fault simulation experiments have been performed on the ISCAS89 benchmark set as well as on a set of real circuits: in contrast to the theoretical analysis proposed in [PKKa92], a very high Fault Coverage has been attained with a limited number of clock cycles, provided that the circuit does not enter a loop. This danger can not be avoided even if clever strategies for Flip-Flops ordering, aimed at reducing the functional adjacency, are adopted; the effects of carefully choosing the initial state are investigated and an approach based on Formal Verification techniques is proposed.","PeriodicalId":377366,"journal":{"name":"European Design Automation Conference","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123468574","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Computing binary decision diagrams for VHDL data types","authors":"R. Herrmann, Hergen Pargmann","doi":"10.5555/198174.198332","DOIUrl":"https://doi.org/10.5555/198174.198332","url":null,"abstract":"In this paper we present the translation of VHDL data types into a BDD representation. We describe a computation method which has been applied to the complete set of nite VHDL data types. This includes the encoding of VHDL variables in a set of binary variables and the construction of a total variable order. We are using this technique to build symbolic transition systems and during symbolic model checking for VHDL to translate propositions into BDDs.","PeriodicalId":377366,"journal":{"name":"European Design Automation Conference","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121422402","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Algorithms for a switch module routing problem","authors":"Shashidhar Thakur, D. F. Wong, S. Muthukrishnan","doi":"10.5555/198174.198259","DOIUrl":"https://doi.org/10.5555/198174.198259","url":null,"abstract":"We consider a awitch module routing problem /or aymmelric array FPGAs. The work is motivated by two applications. The firaf ia that of efficiently evaluating awitch module designs [a]. The second ia that of evaluating the routability of global routing patha for a placement on this architecture. Only an approzimate algorithm was previously known jar this problem. In thin paper, we present an optimal algorithm for the problem based on integer linear programming. Ezperimental rerulta conaistently show that our algorithm is very efficient jor practical sized switch modules. We further improve this technique, by doing some pre-processing on the given switch module. We also idenlijy interesting special cases of the problem which can be solved optimally in polynomial time.","PeriodicalId":377366,"journal":{"name":"European Design Automation Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114193406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A prototyping environment for control-oriented HW/SW systems using state-charts, activity-charts and FPGA's","authors":"K. Buchenrieder, C. Veith","doi":"10.5555/198174.198210","DOIUrl":"https://doi.org/10.5555/198174.198210","url":null,"abstract":"A method for quickly designing and implementing HW/SW systems is described. The method is based on the model of a flexible target architecture consisting of a dedicated controller that interacts with one or more pro cessing elements. From a Statemate ™ specification, the dedicated controller is extracted, and mapped onto a Xilinx™ FPGA. The software part of the specification is translated to C code. The C routines are modified by a set of tools to provide the interface between the software part and the hardware part of the system. A sample application illustrates the feasibility of the approach.","PeriodicalId":377366,"journal":{"name":"European Design Automation Conference","volume":"668 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122966324","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Gate-level timing verification using waveform narrowing","authors":"Jindrich Zejda, E. Cerny","doi":"10.5555/198174.198287","DOIUrl":"https://doi.org/10.5555/198174.198287","url":null,"abstract":"We present a novel gate-level timing verification method that determines if a combinational circuit satisfies a maximal or a minimal required propagation delay. It is based on computing the greatest fixpoint over a set of equations derived from the gate forward and partial inverse functions, and their interconnections, in the domain of sets of (abstract) waveforms. False negative results can be obtained, however, these can be refined by limited case analysis (based on the analysis of reconvergent fanout). The resolution method is independent of the circuit delay model used, transition or floating mode; only the initial set of waveforms on the primary inputs distinguishes them. The method can accommodate interval gate delays, separate rise and fall transition delays, and component delay correlation.","PeriodicalId":377366,"journal":{"name":"European Design Automation Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123146735","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Graph based analysis of FPGA routing","authors":"Yu-Liang Wu, M. Marek-Sadowska","doi":"10.1109/EURDAC.1993.410623","DOIUrl":"https://doi.org/10.1109/EURDAC.1993.410623","url":null,"abstract":"The experimental results of FPGA (field programmable gate array) routing suggest that there are difficulties in mapping global routing to a predictable detailed routing for array type architectures. The authors develop a graph theoretical formulation of this mapping problem and show that it is NP-complete for both multi-pin net lists and two-pin net lists for the Xilinx-like routing model. They present two changes in the routing architecture such that each of them yields a predictable mapping of global routing to the optimal detailed routing. The results suggest a novel approach to array type FPGA routing. >","PeriodicalId":377366,"journal":{"name":"European Design Automation Conference","volume":"84 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131726531","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}