Sciweavers

1061 search results - page 126 / 213
» Dependently Sorted Logic
Sort
View
POPL
1995
ACM
15 years 9 months ago
Parametric Program Slicing
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...
John Field, G. Ramalingam, Frank Tip
PSSS
2003
15 years 7 months ago
Inferencing and Truth Maintenance in RDF Schema
Contrary to earlier reports in literature, exhaustive forward inferencing is a feasible approach for practical RDF. It is sufficiently fast and the increase in necessary storage s...
Jeen Broekstra, Arjohn Kampman
ENTCS
2008
92views more  ENTCS 2008»
15 years 6 months ago
Redundancy Elimination for LF
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
Jason Reed
PERVASIVE
2006
Springer
15 years 6 months ago
Scalability in a Secure Distributed Proof System
Abstract. A logic-based language is often adopted in systems for pervasive computing, because it provides a convenient way to define rules that change the behavior of the systems d...
Kazuhiro Minami, David Kotz
TOPLAS
2002
98views more  TOPLAS 2002»
15 years 5 months ago
Data abstraction and information hiding
traction and information hiding K. RUSTAN M. LEINO and GREG NELSON Compaq Systems Research Center er describes an approach for verifying programs in the presence of data abstractio...
K. Rustan M. Leino, Greg Nelson