1894 search results - page 224 / 379 » A TLA Proof System |
161
click to vote
KBSE
2005
IEEE
15 years 10 months ago
2005
IEEE
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
143
click to vote
TPHOL
2005
IEEE
15 years 10 months ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
146
click to vote
PLDI
2003
ACM
15 years 9 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
163
click to vote
IJCAI
2003
15 years 5 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
130
click to vote
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
HMF is a conservative extension of Hindley-Milner type inference with first-class polymorphism. In contrast to other proposals, HML uses regular System F types and has a simple ty...