Sciweavers

18 search results - page 3 / 4
» Formalised Inductive Reasoning in the Logic of Bunched Impli...
Sort
View
TARK
1998
Springer
13 years 9 months ago
Hypothetical Knowledge and Counterfactual Reasoning
: Salmetintroduced a notion of hypothetical knowledge and showed how it could be used to capture the type of counterfactual reasoning necessary to force the backwards induction sol...
Joseph Y. Halpern
POPL
2010
ACM
14 years 2 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...
BIRTHDAY
2010
Springer
13 years 5 months ago
Dynamic Rippling, Middle-Out Reasoning and Lemma Discovery
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...
Moa Johansson, Lucas Dixon, Alan Bundy
PPDP
2009
Springer
13 years 12 months ago
Reasoning with hypothetical judgments and open terms in hybrid
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
Amy P. Felty, Alberto Momigliano
CADE
2010
Springer
13 years 6 months ago
Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...
Brigitte Pientka, Joshua Dunfield