4340 search results - page 469 / 868 » Formal Methods and Cryptography |
174
click to vote
SAS
2007
Springer
16 years 27 days ago
2007
Springer
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
155
click to vote
IUI
2005
ACM
16 years 10 days ago
2005
ACM
A new generation of intelligent applications can be enabled by broad-coverage knowledge repositories about everyday objects. We distill lessons in design of intelligent user inter...
154
click to vote
KCAP
2005
ACM
16 years 10 days ago
2005
ACM
In order to evaluate the performance of ontology matching algorithms it is necessary to confront them with test ontologies and to compare the results. The most prominent criteria ...
173
click to vote
ICFCA
2005
Springer
16 years 8 days ago
2005
Springer
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equiva...
184
click to vote
SAS
2005
Springer
16 years 7 days ago
2005
Springer
There are many source-level analyses or instrumentation tools that enforce various safety properties. In this paper we present an infrastructure that can be used to check independe...