923 search results - page 119 / 185 » Proving the value of formal methods |
164
click to vote
FORMATS
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
172
click to vote
FORMATS
2005
Springer
15 years 12 months ago
2005
Springer
Within hybrid systems theory, o-minimal automata are often considered on the border between decidability and undecidability. In such classes of hybrid automata, the constraint of h...
163
click to vote
IFL
2005
Springer
15 years 11 months ago
2005
Springer
Performance of generic array programs crucially relies on program specialization wrt. shape information. Traditionally, this is done in a rather adhoc fashion by propagating all sh...
169
click to vote
GCC
2003
Springer
15 years 11 months ago
2003
Springer
The availability is often used to measure how well a system can provide the service continuously. The measures of availability for a single computer and for multiple computers are ...
181
click to vote
AAAI
2010
15 years 7 months ago
2010
Ontology matching is the problem of determining correspondences between concepts, properties, and individuals of different heterogeneous ontologies. With this paper we present a n...