Sciweavers

118 search results - page 16 / 24
» Focused Inductive Theorem Proving
Sort
View
MLQ
2007
90views more  MLQ 2007»
13 years 7 months ago
Kripke submodels and universal sentences
We define two notions for intuitionistic predicate logic: that of a submodel of a Kripke model, and that of a universal sentence. We then prove a corresponding preservation theor...
Ben Ellison, Jonathan Fleischmann, Dan McGinn, Wim...
MICAI
2000
Springer
13 years 11 months ago
Searching for a Solution to Program Verification=Equation Solving in CCS
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
Raul Monroy, Alan Bundy, Ian Green
ICFEM
2004
Springer
14 years 28 days ago
Verifying a File System Implementation
Abstract. We present a correctness proof for a basic file system implementation. This implementation contains key elements of standard Unix file systems such as inodes and fixed...
Konstantine Arkoudas, Karen Zee, Viktor Kuncak, Ma...
STACS
2010
Springer
14 years 20 days ago
Decidability of the Interval Temporal Logic ABB over the Natural Numbers
In this paper, we focus our attention on the interval temporal logic of the Allen’s relations “meets”, “begins”, and “begun by” (ABB for short), interpreted over natu...
Angelo Montanari, Pietro Sala, Guido Sciavicco
CORR
2007
Springer
141views Education» more  CORR 2007»
13 years 7 months ago
Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...
Stéphane Le Roux