1746 search results - page 162 / 350 » A Constructive Semantics for ALC |
175
click to vote
CSFW
1997
IEEE
15 years 10 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
175
Voted
ILP
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
165
click to vote
APLAS
2007
ACM
15 years 10 months ago
2007
ACM
Abstract. We present a formal framework for syntax directed probabilistic program analysis. Our focus is on probabilistic pointer analysis. We show how to obtain probabilistic poin...
189
click to vote
DBKDA
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract--With the growing computer networks, accessible data is becoming increasing distributed. Understanding and integrating remote and unfamiliar data sources are important dat...
156
click to vote
ICDE
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we propose a simple and flexible execution model that (i) supports a wide spectrum of alternative optimization and execution strategies and their mixtures, (ii) pro...