Sciweavers

903 search results - page 86 / 181
» Completeness Results for Memory Logics
Sort
View
CORR
2010
Springer
165views Education» more  CORR 2010»
13 years 9 months ago
Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
Rajeev Goré, Linda Postniece, Alwen Tiu
PLDI
2009
ACM
14 years 3 months ago
GC assertions: using the garbage collector to check heap properties
This paper introduces GC assertions, a system interface that programmers can use to check for errors, such as data structure invariant violations, and to diagnose performance prob...
Edward Aftandilian, Samuel Z. Guyer
APLAS
2006
ACM
14 years 2 months ago
A Pushdown Machine for Recursive XML Processing
XML transformations are most naturally defined as recursive functions on trees. Their direct implementation, however, causes inefficient memory usage because the input XML tree is...
Keisuke Nakano, Shin-Cheng Mu
VLSISP
2008
239views more  VLSISP 2008»
13 years 8 months ago
An Embedded Real-Time Surveillance System: Implementation and Evaluation
This paper presents the design of an embedded automated digital video surveillance system with real-time performance. Hardware accelerators for video segmentation, morphological op...
Fredrik Kristensen, Hugo Hedberg, Hongtu Jiang, Pe...
AI
2008
Springer
13 years 9 months ago
Expressive probabilistic description logics
The work in this paper is directed towards sophisticated formalisms for reasoning under probabilistic uncertainty in ontologies in the Semantic Web. Ontologies play a central role...
Thomas Lukasiewicz