Sciweavers

923 search results - page 121 / 185
» Proving the value of formal methods
Sort
View
DATE
2003
IEEE
116views Hardware» more  DATE 2003»
15 years 11 months ago
Statistical Timing Analysis Using Bounds
The growing impact of within-die process variation has created the need for statistical timing analysis, where gate delays are modeled as random variables. Statistical timing anal...
Aseem Agarwal, David Blaauw, Vladimir Zolotov, Sar...
AIIDE
2006
15 years 7 months ago
Incorporating Advice into Neuroevolution of Adaptive Agents
Neuroevolution is a promising learning method in tasks with extremely large state and action spaces and hidden states. Recent advances allow neuroevolution to take place in real t...
Chern Han Yong, Kenneth O. Stanley, Risto Miikkula...
DAC
2004
ACM
16 years 7 months ago
Quantum logic synthesis by symbolic reachability analysis
Reversible quantum logic plays an important role in quantum computing. In this paper, we propose an approach to optimally synthesize quantum circuits by symbolic reachability anal...
William N. N. Hung, Xiaoyu Song, Guowu Yang, Jin Y...
SAC
2009
ACM
16 years 1 months ago
Matching ThisType to subtyping
The notion of ThisType has been proposed to promote typesafe reuse of binary methods and recently extended to mutually recursive definitions. It is well-known, however, that This...
Chieri Saito, Atsushi Igarashi
KBSE
1998
IEEE
15 years 10 months ago
Planning Equational Verification in CCS
Most efforts to automate formal verification of communicating systems have centred around finite-state systems (FSSs). However, FSSs are incapable of modelling many practical comm...
Raul Monroy, Alan Bundy, Ian Green