452 search results - page 32 / 91 » Incremental formal design verification |
87
Voted
DATE
2000
IEEE
15 years 2 months ago
2000
IEEE
The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification. SAT has bee...
IFM
2009
Springer
15 years 4 months ago
2009
Springer
Object-orientation supports code reuse and incremental programming. Multiple inheritance increases the power of code reuse, but complicates the binding of method calls and thereby ...
CAISE
2010
Springer
14 years 10 months ago
2010
Springer
For enterprises it has become crucial to check compliance of their business processes with certain rules such as medical guidelines or financial regulations. When automating compli...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Synchronous languages rely on formal methods to ease the development of applications in an efficient and reusable way. Formal methods have been advocated as a means of increasing t...
SAC
2006
ACM
14 years 9 months ago
2006
ACM
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...