Sciweavers

4192 search results - page 429 / 839
» Probabilistic Logic Programming
Sort
View
161
Voted
FUIN
2010
106views more  FUIN 2010»
15 years 2 months ago
Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity
Abstract. Developing a good formalism and an efficient decision procedure for the instance checking problem is desirable for practical application of description logics. The data c...
Linh Anh Nguyen
139
Voted
APLAS
2007
ACM
15 years 9 months ago
More Typed Assembly Languages for Confidentiality
We propose a series of type systems for the information-flow security of assembly code. These systems extend previous work TALC with some timing annotations and associated judgment...
Dachuan Yu
USS
2004
15 years 6 months ago
Fixing Races for Fun and Profit: How to Use access(2)
It is well known that it is insecure to use the access(2) system call in a setuid program to test for the ability of the program's executor to access a file before opening sa...
Drew Dean, Alan J. Hu
SAS
2004
Springer
134views Formal Methods» more  SAS 2004»
15 years 10 months ago
Towards Declarative Programming for Web Services
ness Refinement in Abstract Symbolic Trajectory Evaluation . . . . 38 Mila Dalla Preda Constraint-Based Linear-Relations Analysis . . . . . . . . . . . . . . . . . . . . . . . . ....
Sheila A. McIlraith
ICALP
1994
Springer
15 years 9 months ago
Simple Fast Parallel Hashing
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
Joseph Gil, Yossi Matias