Sciweavers

844 search results - page 116 / 169
» Safraless Decision Procedures
Sort
View
DLOG
2011
13 years 7 days ago
Dependencies to Optimize Ontology Based Data Access
Query answering in Ontology Based Data Access (OBDA) exploits the knowledge of an ontology’s TBox to deal with incompleteness of the ABox (or data source). Current query-answerin...
Mariano Rodriguez-Muro, Diego Calvanese
CONCUR
2011
Springer
12 years 8 months ago
Reasoning about Threads with Bounded Lock Chains
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
Vineet Kahlon
CORR
2012
Springer
212views Education» more  CORR 2012»
12 years 4 months ago
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdot...
EUROSEC
2009
ACM
14 years 3 months ago
QuanTM: a quantitative trust management system
Quantitative Trust Management (QTM) provides a dynamic interpretation of authorization policies for access control decisions based on upon evolving reputations of the entities inv...
Andrew G. West, Adam J. Aviv, Jian Chang, Vinayak ...
ICSR
2009
Springer
14 years 3 months ago
Reuse of Architectural Knowledge in SPL Development
Abstract. Software Product Lines (SPL) promote reuse within an application domain in an organized fashion. Preimplemented software components are arranged according to a product li...
Pedro O. Rossel, Daniel Perovich, M. Cecilia Basta...