Sciweavers

1941 search results - page 34 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
ICTAC
2010
Springer
14 years 12 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
CORR
2010
Springer
174views Education» more  CORR 2010»
15 years 2 months ago
Cut Elimination for a Logic with Induction and Co-induction
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
Alwen Tiu, Alberto Momigliano
AAAI
1994
15 years 3 months ago
Forming Beliefs about a Changing World
The situation calculus is a popular technique for reasoning about action and change. However, its restriction to a firstorder syntax and pure deductive reasoning makes it unsuitab...
Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, ...
FOSSACS
2005
Springer
15 years 7 months ago
A Simpler Proof Theory for Nominal Logic
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
James Cheney
FOSSACS
2008
Springer
15 years 3 months ago
What Else Is Decidable about Integer Arrays?
We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the first-order fragment and allows (1) Presburger constraints on existentially...
Peter Habermehl, Radu Iosif, Tomás Vojnar