Sciweavers

265 search results - page 48 / 53
» Logical Queries over Views: Decidability and Expressiveness
Sort
View
82
Voted
VMCAI
2004
Springer
15 years 3 months ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
LICS
2009
IEEE
15 years 4 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp
KR
2000
Springer
15 years 1 months ago
Significant Inferences : Preliminary Report
We explore the possibility of a logic where a conclusion substantially improves over its premise(s): Specifically, we intend to rule out inference steps such that the premise conv...
Philippe Besnard, Torsten Schaub
ICTAC
2010
Springer
14 years 8 months ago
Mechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
J. Gregory Malecha, Greg Morrisett
ICDE
2003
IEEE
119views Database» more  ICDE 2003»
15 years 11 months ago
Implementing P3P Using Database Technology
Platform for Privacy Preferences (P3P) is the most significant effort currently underway to enable web users to gain control over their private information. P3P provides mechanism...
Rakesh Agrawal, Jerry Kiernan, Ramakrishnan Srikan...