32 search results - page 5 / 7 » Tractable Reasoning in a Fragment of Separation Logic |
PODS
2010
ACM
13 years 6 months ago
2010
ACM
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
CSL
2010
Springer
13 years 7 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
CSL
2007
Springer
14 years 14 days ago
2007
Springer
A game semantics of the (−−∗, →)-fragment of the logic of bunched implications, BI, is presented. To date, categorical models of BI have been restricted to two kinds: funct...
CSL
2009
Springer
13 years 10 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
POPL
2012
ACM
12 years 1 months ago
2012
ACM
JavaScript has become the most widely used language for clientside web programming. The dynamic nature of JavaScript makes understanding its code notoriously difficult, leading t...