4036 search results - page 386 / 808 » Formal Methods |
157
click to vote
FMCAD
2009
Springer
16 years 1 months ago
2009
Springer
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...
174
click to vote
FMCAD
2009
Springer
16 years 1 months ago
2009
Springer
—Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checkin...
157
click to vote
FMCAD
2009
Springer
16 years 1 months ago
2009
Springer
Abstract—Several successful approaches to software verificabased on the construction and analysis of an abstract reachability tree (ART). The ART represents unwindings of the co...
201
click to vote
FMICS
2009
Springer
16 years 1 months ago
2009
Springer
Most modern safety-critical control programs, such as those embedded in fly-by-wire control systems, perform a lot of floating-point computations. The well-known pitfalls of IEEE...
179
click to vote
IFM
2009
Springer
16 years 1 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...