2006 Formal Methods in Computer Aided Design最新文献

Formal Analysis and Verification of an OFDM Modem Design using HOL 基于HOL的OFDM调制解调器设计的形式化分析与验证

2006 Formal Methods in Computer Aided Design Pub Date : 2006-11-12 DOI: 10.1109/FMCAD.2006.14

A. M. Abdullah, Behzad Akbarpour, S. Tahar

引用次数: 6

Model Checking Data-Dependent Real-Time Properties of the European Train Control System 欧洲列车控制系统数据相关实时性的模型检验

2006 Formal Methods in Computer Aided Design Pub Date : 2006-11-12 DOI: 10.1109/FMCAD.2006.21

Johannes Faber, R. Meyer

引用次数: 30

Thorough Checking Revisited 重新进行彻底检查

2006 Formal Methods in Computer Aided Design Pub Date : 2006-11-12 DOI: 10.1109/FMCAD.2006.33

S. Nejati, M. Bobaru, M. Chechik

引用次数: 5

Assume-Guarantee Reasoning for Deadlock 死锁的假设保证推理

2006 Formal Methods in Computer Aided Design Pub Date : 2006-11-12 DOI: 10.1109/FMCAD.2006.8

S. Chaki, Nishant Sinha

引用次数: 18

Automatic Generation of Schedulings for Improving the Test Coverage of Systems-on-a-Chip 提高片上系统测试覆盖率的调度自动生成

2006 Formal Methods in Computer Aided Design Pub Date : 2006-11-12 DOI: 10.1109/FMCAD.2006.10

C. Helmstetter, F. Maraninchi, L. Maillet-Contoz, M. Moy

{"title":"Automatic Generation of Schedulings for Improving the Test Coverage of Systems-on-a-Chip","authors":"C. Helmstetter, F. Maraninchi, L. Maillet-Contoz, M. Moy","doi":"10.1109/FMCAD.2006.10","DOIUrl":"https://doi.org/10.1109/FMCAD.2006.10","url":null,"abstract":"SystemC is becoming a de-facto standard for the early simulation of systems-on-a-chip (SoCs). It is a parallel language with a scheduler. Testing a SoC written in SystemC implies that we execute it, for some well chosen data. We are bound to use a particular deterministic implementation of the scheduler, whose specification is non-deterministic. Consequently, we may fail to discover bugs that would have appeared using another valid implementation of the scheduler. Current methods for testings SoCs concentrate on the generation of the inputs, and do not address this problem at all. We assume that the selection of relevant data is already done, and we generate several schedulings allowed by the scheduler specification. We use dynamic partial-order reduction techniques to avoid the generation of two schedulings that have the same effect on the system's behavior. Exploring alternative schedulings during testing is a way of guaranteeing that the SoC description, and in particular the embedded software, is scheduler-independent, hence more robust. The technique extends to the exploration of other non-fully specified aspects of SoC descriptions, like timing","PeriodicalId":400704,"journal":{"name":"2006 Formal Methods in Computer Aided Design","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128652357","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}

引用次数: 59

An Integration of HOL and ACL2 HOL和ACL2的集成

2006 Formal Methods in Computer Aided Design Pub Date : 2006-11-12 DOI: 10.1109/FMCAD.2006.6

M. Gordon, James Reynolds, W. Hunt, Matt Kaufmann

引用次数: 25

An Improved Distance Heuristic Function for Directed Software Model Checking 一种用于有向软件模型检验的改进距离启发式函数

2006 Formal Methods in Computer Aided Design Pub Date : 2006-11-12 DOI: 10.1109/FMCAD.2006.5

Neha Rungta, Eric Mercer

引用次数: 10

Symmetry Reduction for STE Model Checking STE模型检验的对称性约简

2006 Formal Methods in Computer Aided Design Pub Date : 2006-11-12 DOI: 10.1109/FMCAD.2006.31

A. Darbari

引用次数: 5

Simulation Bounds for Equivalence Verification of Arithmetic Datapaths with Finite Word-Length Operands 有限字长操作数算术数据路径等价性验证的模拟边界

2006 Formal Methods in Computer Aided Design Pub Date : 2006-11-12 DOI: 10.1109/FMCAD.2006.30

N. Shekhar, P. Kalla, Brandon Meredith, Florian Enescu

{"title":"Simulation Bounds for Equivalence Verification of Arithmetic Datapaths with Finite Word-Length Operands","authors":"N. Shekhar, P. Kalla, Brandon Meredith, Florian Enescu","doi":"10.1109/FMCAD.2006.30","DOIUrl":"https://doi.org/10.1109/FMCAD.2006.30","url":null,"abstract":"This paper addresses simulation-based verification of high-level descriptions of arithmetic datapaths. Instances of such designs are commonly found in DSP for audio, video and multimedia applications, where the word-lengths of input/output bit-vectors are fixed according to the desired precision. Initial descriptions of such systems are usually specified as Matlab/C code. These are then automatically translated into behavioural/RTL descriptions (HDL) for subsequent hardware synthesis. In order to verify that the initial Matlab/C model is bit-true equivalent to the translated RTL, how many simulation vectors need to be applied? This paper explores results from number theory and commutative algebra to show that exhaustive simulation is not necessary for testing their equivalence. In particular, we derive an upper bound on the number of simulation vectors required to prove equivalence or identify bugs. These vectors cannot be arbitrarily generated; we determine exactly those vectors that need to be simulated. Extensive experiments are performed within practical CAD settings to demonstrate the validity and applicability of these results","PeriodicalId":400704,"journal":{"name":"2006 Formal Methods in Computer Aided Design","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133335190","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}

引用次数: 2

Advanced Unbounded Model Checking Based on AIGs, BDD Sweeping, And Quantifier Scheduling 基于AIGs、BDD扫描和量词调度的高级无界模型检查

2006 Formal Methods in Computer Aided Design Pub Date : 2006-11-12 DOI: 10.1109/FMCAD.2006.4

Florian Pigorsch, Christoph Scholl, Stefan Disch

引用次数: 29