Sciweavers

CADE
2015
Springer
9 years 11 months ago
A Formalisation of Finite Automata Using Hereditarily Finite Sets
Abstract. Hereditarily finite (HF) set theory provides a standard universe of sets, but with no infinite sets. Its utility is demonstrated through a formalisation of the theory o...
Lawrence C. Paulson
CADE
2015
Springer
9 years 11 months ago
KeYmaera X: An Axiomatic Tactical Theorem Prover for Hybrid Systems
KeYmaera X is a theorem prover for differential dynamic logic (dL), a logic for specifying and verifying properties of hybrid systems. Reasoning about complicated hybrid systems mo...
Nathan Fulton, Stefan Mitsch, Jan-David Quesel, Ma...
CADE
2015
Springer
9 years 11 months ago
Proving Correctness of a KRK Chess Endgame Strategy by Using Isabelle/HOL and Z3
Abstract. We describe an executable specification and a total correctness proof of a King and Rook vs King (KRK) chess endgame strategy within the proof assistant Isabelle/HOL. Th...
Filip Maric, Predrag Janicic, Marko Malikovic
CADE
2015
Springer
9 years 11 months ago
The Lean Theorem Prover (System Description)
Lean is a new open source theorem prover being developed at Microsoft Research and Carnegie Mellon University, with a small trusted kernel based on dependent type theory. It aims t...
Leonardo Mendonça de Moura, Soonho Kong, Je...
CADE
2015
Springer
9 years 11 months ago
Automating Leibniz's Theory of Concepts
Our computational metaphysics group describes its use of automated reasoning tools to study Leibniz’s theory of concepts. We start with a reconstruction of Leibniz’s theory wi...
Jesse Alama, Paul E. Oppenheimer, Edward N. Zalta