Sciweavers

713 search results - page 4 / 143
» Model Checking and Transitive-Closure Logic
Sort
View
CAV
2008
Springer
96views Hardware» more  CAV 2008»
13 years 9 months ago
Implied Set Closure and Its Application to Memory Consistency Verification
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
Surender Baswana, Shashank K. Mehta, Vishal Powar
VMCAI
2010
Springer
14 years 4 months ago
Shape Analysis with Reference Set Relations
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
Mark Marron, Rupak Majumdar, Darko Stefanovic, Dee...
CONCUR
2006
Springer
13 years 11 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
IDEAS
2009
IEEE
232views Database» more  IDEAS 2009»
14 years 2 months ago
RDFKB: efficient support for RDF inference queries and knowledge management
RDFKB (Resource Description Framework Knowledge Base) is a relational database system for RDF datasets which supports inference and knowledge management. Significant research has ...
James P. McGlothlin, Latifur R. Khan
WWW
2003
ACM
14 years 8 months ago
On labeling schemes for the semantic web
This paper focuses on the optimization of the navigation through voluminous subsumption hierarchies of topics employed by Portal Catalogs like Netscape Open Directory (ODP). We ad...
Vassilis Christophides, Dimitris Plexousakis, Mich...