446 search results - page 35 / 90 » A Theorem Prover for a Computational Logic |
86
Voted
SAS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We specify an information flow analysis for a simple imperative language, using a Hoare-like logic. The logic facilitates static checking of a larger class of programs t...
CADE
2010
Springer
14 years 10 months ago
2010
Springer
This system description provides an overview of the MUNCH reasoner for sets and multisets. MUNCH takes as the input a formula in a logic that supports expressions about sets, multi...
118
click to vote
ESOP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
106
click to vote
CADE
2012
Springer
13 years 2 days ago
2012
Springer
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
104
Voted
ICFP
2012
ACM
13 years 2 days ago
2012
ACM
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...