Sciweavers

1024 search results - page 38 / 205
» Value complete, column complete, predicate complete
Sort
View
FSTTCS
2004
Springer
15 years 3 months ago
A Decidable Fragment of Separation Logic
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
CP
2005
Springer
14 years 12 months ago
A Linear-Logic Semantics for Constraint Handling Rules
One of the attractive features of the Constraint Handling Rules (CHR) programming language is its declarative semantics where rules are read as formulae in first-order predicate l...
Hariolf Betz, Thom W. Frühwirth
CADE
2010
Springer
14 years 11 months ago
Classical Logic with Partial Functions
Abstract. We introduce a semantics for classical logic with partial functions. We believe that the semantics is natural. When a formula contains a subterm in which a function is ap...
Hans de Nivelle
MSCS
2006
89views more  MSCS 2006»
14 years 9 months ago
Quantum weakest preconditions
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between ...
Ellie D'Hondt, Prakash Panangaden
JLP
1998
147views more  JLP 1998»
14 years 9 months ago
Automated Reasoning with a Constraint-Based Metainterpreter
Using constraint logic techniques, it is made possible to use a wellknown metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which prov...
Henning Christiansen