Sciweavers

903 search results - page 18 / 181
» Completeness Results for Memory Logics
Sort
View
SEMWEB
2009
Springer
14 years 2 months ago
Axiomatic First-Order Probability
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...
Kathryn B. Laskey
CASES
2003
ACM
14 years 22 days ago
Frequent loop detection using efficient non-intrusive on-chip hardware
Dynamic software optimization methods are becoming increasingly popular for improving software performance and power. The first step in dynamic optimization consists of detecting ...
Ann Gordon-Ross, Frank Vahid
IWMM
1998
Springer
117views Hardware» more  IWMM 1998»
13 years 11 months ago
Guaranteeing Non-Disruptiveness and Real-Time Deadlines in an Incremental Garbage Collector
For Garbage Collection (GC) to be a generally accepted means of memory management it is required to prove its efficiency. This paper presents a scheme that guarantees that an incr...
Fridtjof Siebert
AML
2006
49views more  AML 2006»
13 years 7 months ago
No Escape from Vardanyan's theorem
Vardanyan's Theorem states that the set of PA-valid principles of Quantified Modal Logic, QML, is complete 0 2. We generalize this result to a wide class of theories. The cru...
Albert Visser, Maartje de Jonge
FOSSACS
2008
Springer
13 years 9 months ago
A Modal Deconstruction of Access Control Logics
We present a translation from a logic of access control with a "says" operator to the classical modal logic S4. We prove that the translation is sound and complete. We al...
Deepak Garg, Martín Abadi