System-on-a-chip (SoC) designs have gained immense popularity as they provide designers with the ability of integrating all components (called IPs) of an application-specific computer system onto a single chip. However, one of the main bottlenecks of the SoC design cycle is the validation of complex designs. As system size grows, validation time increases beyond manageable limits. It is desirable that design inconsistences are found and fixed early in the design process, as validation overheads are significantly higher after IPs are integrated. This thesis presents a range of techniques for the automatic verification and design of SoCs that aim to reduce post-integration validation costs. Firstly, local module checking algorithm, a practical implementation of module checking, is presented. This technique allows for the comprehensive verification of IPs such that they guarantee the satisfaction of critical specifications regardless of the SoC they are used in. Local module checking is shown to be able to validate IPs in much lesser time on average than global module checking, and can help in handling many important validation tasks much before the integration stage. Next, a number of protocol conversion techniques that assist in the composition of IPs with incompatible protocols is presented. The inconsistencies between IP protocols, called mismatches, are bridged by the automatic generation of some extra glue-logic, called a converter. Converters generated by the proposed techniques can handle control, datawidth and clock mismatches between multiple IPs in a unified manner. These approaches ensure that the integration of IPs is correct-by-construction, such that the final system is guaranteed to satisfy key specifications without the need for further validation. Finally, a technique for automatic IP reuse using forced simulation is presented, which involves automatically generating an adaptor that guides an IP such that it satisfies desired specifications. The proposed technique can generate adaptors in many cases where existing IP techniques fail. As it is guaranteed that reused IPs satisfy desired specifications, post-integration validation costs are significantly reduced. For each proposed technique, a comprehensive set of results is presented that highlights the significance of the solution. It is noted that the proposed approaches can help automate SoC design and achieve significant savings in post-integration validation costs.
[1]
Bin Wang,et al.
Formal verification of embedded SoC
,
2001,
ASICON 2001. 2001 4th International Conference on ASIC Proceedings (Cat. No.01TH8549).
[2]
Luca Benini,et al.
Component selection and matching for IP-based design
,
2001,
Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001.
[3]
Mike P. Papazoglou,et al.
Web Component: A Substrate for Web Service Reuse and Composition
,
2002,
CAiSE.
[4]
Samik Basu,et al.
Local Module Checking for CTL Specifications
,
2007,
Electron. Notes Theor. Comput. Sci..
[5]
Zoran A. Salcic,et al.
Multi-clock Soc design using protocol conversion
,
2009,
2009 Design, Automation & Test in Europe Conference & Exhibition.
[6]
Samik Basu,et al.
A Module Checking Based Converter Synthesis Approach for SoCs
,
2008,
21st International Conference on VLSI Design (VLSID 2008).
[7]
Roopak Sinha,et al.
Adaptive Verification using Forced Simulation
,
2005,
FESCA@ETAPS.
[8]
Wenfa Zhan,et al.
Reuse issues in SoC verification platform
,
2004,
8th International Conference on Computer Supported Cooperative Work in Design.
[9]
Pierre Wodey,et al.
LOTOS code generation for model checking of STBus based SoC: the STBus interconnection
,
2003,
First ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2003. MEMOCODE '03. Proceedings..
[10]
Chong-Min Kyung,et al.
Current status and challenges of SoC verification for embedded systems market
,
2003,
IEEE International [Systems-on-Chip] SOC Conference, 2003. Proceedings..
[11]
Moshe Y. Vardi.
Verification of Concurrent Programs: The Automata-Theoretic Framework
,
1991,
Ann. Pure Appl. Log..
[12]
Samik Basu,et al.
A Model Checking Approach to Protocol Conversion
,
2008,
Electron. Notes Theor. Comput. Sci..
[13]
Moshe Y. Vardi.
On the complexity of modular model checking
,
1995,
Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.