923 search results - page 69 / 185 » Proving the value of formal methods |
149
click to vote
LOPSTR
2004
Springer
15 years 11 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
169
click to vote
ECRTS
2007
IEEE
15 years 10 months ago
2007
IEEE
It is well known that the performance of computer controlled systems is heavily affected by delays and jitter occurring in the control loops, which are mainly caused by the interf...
157
click to vote
JSYML
2002
15 years 5 months ago
2002
Abstract. This paper develops the very basic notions of analysis in a weak secondorder theory of arithmetic BTFA whose provably total functions are the polynomial time computable f...
158
click to vote
FMCO
2007
Springer
16 years 9 days ago
2007
Springer
This paper describes the architecture of costa, an abstract interpretation based cost and termination analyzer for Java bytecode. The system receives as input a bytecode program, (...
150
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had...