59
Voted
VMCAI
2005
Springer
15 years 2 months ago
2005
Springer
59
Voted
VMCAI
2005
Springer
15 years 2 months ago
2005
Springer
65
Voted
VMCAI
2005
Springer
15 years 2 months ago
2005
Springer
47
Voted
VMCAI
2005
Springer
15 years 2 months ago
2005
Springer
We present a technique to prove termination of multipath polynomial programs, an expressive class of loops that enables practical traction and analysis. The technique is based on ļ...
VMCAI
2005
Springer
15 years 2 months ago
2005
Springer
A Herbrand equality between expressions in a program is an equality which holds relative to the Herbrand interpretation of operators. We show that the problem of checking validity ...
58
Voted
VMCAI
2005
Springer
15 years 2 months ago
2005
Springer
78
Voted
VMCAI
2005
Springer
15 years 2 months ago
2005
Springer
Interval computations, stochastic arithmetic, automatic diļ¬erentiation, etc.: much work is currently done to estimate and to improve the numerical accuracy of programs but few c...
44
Voted
VMCAI
2005
Springer
15 years 2 months ago
2005
Springer
85
Voted
VMCAI
2005
Springer
15 years 2 months ago
2005
Springer
Bounded model checking (BMC) is an automatic veriļ¬cation method that is based on a ļ¬nite unfolding of the systemās transition relation. BMC has been successfully applied, in ...