643 search results - page 100 / 129 » Semantic Determinism and Functional Logic Program Properties |
127
click to vote
SEBD
2007
15 years 3 months ago
2007
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large am...
103
Voted
SAS
2007
Springer
15 years 8 months ago
2007
Springer
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
112
click to vote
PLDI
2010
ACM
15 years 11 months ago
2010
ACM
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
CSL
2004
Springer
15 years 7 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper pr...