10435 search results - page 1972 / 2087 » Computational Biology and Language |
174
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
180
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
172
click to vote
SEMWEB
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Ontology classification--the computation of subsumption hierarchies for classes and properties--is one of the most important tasks for OWL reasoners. Based on the algorit...
206
click to vote
SOCIALCOM
2010
15 years 4 months ago
2010
Text data pertaining to socio-technical networks often are analyzed separately from relational data, or are reduced to the fact and strength of the flow of information between node...
202
click to vote
TAP
2010
Springer
15 years 4 months ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...