923 search results - page 82 / 185 » Proving the value of formal methods |
156
click to vote
SAS
2004
Springer
15 years 11 months ago
2004
Springer
Program generation is among the most promising techniques in the effort to increase the automation of programming tasks. In this paper, we discuss the potential impact and resear...
159
click to vote
SAS
2004
Springer
15 years 11 months ago
2004
Springer
Array-Range Analysis computes at compile time the range of possible index values for each array-index expression in a program. This information can be used to detect potential out-...
149
click to vote
FORMATS
2010
Springer
15 years 4 months ago
2010
Springer
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respec...
143
click to vote
LREC
2008
15 years 7 months ago
2008
This paper deals with the treatment of constructed neologisms in a machine translation system. It focuses on a particular issue in Romance languages: relational adjectives and the...
192
click to vote
TYPES
1998
Springer
15 years 10 months ago
1998
Springer
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...