4719 search results - page 382 / 944 » Newtonian program analysis |
169
Voted
TFM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Teaching formal methods is a challenging task for several reasons. First, both the state-of-the-art knowledge and the tools are rapidly evolving. Second, there are no com...
161
click to vote
FM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
182
click to vote
CC
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
198
click to vote
ECML
2007
Springer
16 years 26 days ago
2007
Springer
Many data mining techniques are these days in use for ontology learning – text mining, Web mining, graph mining, link analysis, relational data mining, and so on. In the current ...
156
click to vote
MKM
2007
Springer
16 years 25 days ago
2007
Springer
Formal concept analysis (FCA) comprises a set of powerful algorithms which can be used for data analysis and manipulation, and a set of visualisation tools which enable the discove...