Sciweavers

61 search results - page 10 / 13
» Source-Level Proof Reconstruction for Interactive Theorem Pr...
Sort
View
93
Voted
CSL
2010
Springer
14 years 11 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
APSEC
2005
IEEE
15 years 3 months ago
Tool Support for Invariant Based Programming
— Invariant based programming is an approach to program construction where we provide the program pre- and postconditions as well as loop invariants before we construct the code ...
Ralph-Johan Back, Magnus Myreen
117
Voted
LICS
2012
IEEE
13 years 18 days ago
Logics of Dynamical Systems
—We study the logic of dynamical systems, that is, logics and proof principles for properties of dynamical systems. Dynamical systems are mathematical models describing how the s...
André Platzer
ENTCS
2006
122views more  ENTCS 2006»
14 years 10 months ago
Verification of Clock Synchronization Algorithms: Experiments on a Combination of Deductive Tools
We report on an experiment in combining Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study...
Damián Barsotti, Leonor Prensa Nieto, Alwen...
IFM
2004
Springer
15 years 3 months ago
Verifying Controlled Components
Recent work on combining CSP and B has provided ways of describing systems comprised of components described in both B (to express requirements on state) and CSP (to express intera...
Steve Schneider, Helen Treharne