Sciweavers

923 search results - page 108 / 185
» Proving the value of formal methods
Sort
View
CALCO
2007
Springer
88views Mathematics» more  CALCO 2007»
16 years 14 days ago
Datatypes in Memory
Besides functional correctness, specifications must describe other properties of permissible implementations. We want to use simple algebraic techniques to specify resource usage ...
David Aspinall, Piotr Hoffman
JSAC
2010
92views more  JSAC 2010»
15 years 4 months ago
Analysis of Nonlinear Transition Shift and Write Precompensation in Perpendicular Recording Systems
Abstract—In high density perpendicular magnetic recording channels, nonlinear transition shift (NLTS) is one of the distortions that can degrade the system performance. Write pre...
Zheng Wu, Paul H. Siegel, Jack K. Wolf, H. Neal Be...
SIAMNUM
2010
120views more  SIAMNUM 2010»
15 years 1 months ago
Well Conditioned Spherical Designs for Integration and Interpolation on the Two-Sphere
A set XN of N points on the unit sphere is a spherical t-design if the average value of any polynomial of degree at most t over XN is equal to the average value of the polynomial o...
Congpei An, Xiaojun Chen, Ian H. Sloan, Robert S. ...
GLVLSI
2006
IEEE
105views VLSI» more  GLVLSI 2006»
16 years 10 days ago
A practical approach for monitoring analog circuits
Formal methods have been advocated for the verification of digital design where correctness is proved mathematically. In contrast to digital designs, the verification of analog ...
Mohamed H. Zaki, Sofiène Tahar, Guy Bois
FM
2005
Springer
112views Formal Methods» more  FM 2005»
15 years 11 months ago
Dynamic Component Substitutability Analysis
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
Natasha Sharygina, Sagar Chaki, Edmund M. Clarke, ...