Sciweavers

Share
50 search results - page 4 / 10
» Dynamic Search-Space Pruning Techniques in Path Sensitizatio...
Sort
View
IDEAS
2006
IEEE
152views Database» more  IDEAS 2006»
10 years 10 months ago
Querying Encrypted XML Documents
This paper proposes techniques to query encrypted XML documents. Such a problem predominantly occurs in “Database as a Service” (DAS) architectures, where a client may outsour...
Ravi Chandra Jammalamadaka, Sharad Mehrotra
ICLP
2010
Springer
10 years 8 months ago
Dynamic Magic Sets for Disjunctive Datalog Programs
Abstract. Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negati...
Mario Alviano
SIGSOFT
2003
ACM
11 years 5 months ago
Consistency techniques for interprocedural test data generation
This paper presents a novel approach for automated test data generation of imperative programs containing integer, boolean and/or float variables. It extends our previous work to ...
Nguyen Tran Sy, Yves Deville
DAC
1999
ACM
10 years 8 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther
JCM
2007
131views more  JCM 2007»
10 years 4 months ago
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
Fadi A. Aloul, Bashar Al Rawi, Mokhtar Aboelaze
books