Sciweavers

903 search results - page 14 / 181
» Completeness Results for Memory Logics
Sort
View
SEFM
2009
IEEE
14 years 2 months ago
Adjusted Verification Rules for Loops Are More Complete and Give Better Diagnostics for Less
—Increasingly, tools and their underlying theories are able to cope with “real code” written as part of industrial grade applications almost as is. It has been our experience...
Patrice Chalin
TARK
2005
Springer
14 years 28 days ago
First-order classical modal logic: applications in logics of knowledge and probability
The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighb...
Horacio L. Arló-Costa, Eric Pacuit
DATE
1997
IEEE
75views Hardware» more  DATE 1997»
13 years 11 months ago
Using constraint logic programming in memory synthesis for general purpose computers
In modern computer systems the performance is dominated by the memory performance. Currently, there is neither a systematic design methodology nor a tool for the design of memory ...
Renate Beckmann, Jürgen Herrmann
ICCSA
2004
Springer
14 years 25 days ago
Semantic Completeness in Sub-ontology Extraction Using Distributed Methods
The use of ontologies lies at the very heart of the newly emerging era of Semantic Web. They provide a shared conceptualization of some domain that may be communicated between peop...
Mehul Bhatt, Carlo Wouters, Andrew Flahive, J. Wen...
IDEAS
1997
IEEE
110views Database» more  IDEAS 1997»
13 years 11 months ago
Accommodating Logical Logging under Fuzzy Checkpointing in Main Memory Databases
This paper presents a simple and effective method to reduce the size of log data for recovery in main memory databases. Fuzzy checkpointing is known to be very efficient in main ...
Seung-Kyoon Woo, Myoung-Ho Kim, Yoon-Joon Lee