3658 search results - page 103 / 732 » The logic of proofs, semantically |
106
Voted
FORMATS
2005
Springer
15 years 6 months ago
2005
Springer
This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that t...
83
Voted
BIRTHDAY
2005
Springer
15 years 6 months ago
2005
Springer
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
108
Voted
UTP
2010
14 years 11 months ago
2010
In this paper, we present various extensions of Isabelle/HOL by theories that are essential for several formal methods. First, we explain how we have developed an Isabelle/HOL theo...
203
click to vote
POPL
2007
ACM
16 years 1 months ago
2007
ACM
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
126
click to vote
TYPES
2004
Springer
15 years 6 months ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...