Sciweavers

1269 search results - page 40 / 254
» Pi-Calculus in Logical Form
Sort
View
POPL
2010
ACM
14 years 7 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
APAL
2004
78views more  APAL 2004»
13 years 9 months ago
Ternary relations and relevant semantics
Modus ponens provides the central theme. There are laws, of the form A C. A logic (or other theory) L collects such laws. Any datum A (or theory T incorporating such data) provid...
Robert K. Meyer
JAR
2010
95views more  JAR 2010»
13 years 4 months ago
Equivariant Unification
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...
James Cheney
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 10 months ago
Modular difference logic is hard
In connection with machine arithmetic, we are interested in systems of constraints of the form x + k y + k . Over integers, the satisfiability problem for such systems is polynomi...
Nikolaj Bjørner, Andreas Blass, Yuri Gurevi...
DLOG
2001
13 years 11 months ago
Preserving Modularity in XML Encoding of Description Logics
Description logics have been designed and studied in a modular way. This has allowed a methodic approach to complexity evaluation. We present a way to preserve this modularity in ...
Jérôme Euzenat