Sciweavers

1274 search results - page 103 / 255
» New Proofs for
Sort
View
STACS
2001
Springer
14 years 2 months ago
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
Victor L. Selivanov
TPHOL
1999
IEEE
14 years 2 months ago
A Machine-Checked Theory of Floating Point Arithmetic
Abstract. Intel is applying formal verification to various pieces of mathematical software used in Merced, the first implementation of the new IA-64 architecture. This paper discus...
John Harrison
CAV
1998
Springer
130views Hardware» more  CAV 1998»
14 years 2 months ago
On Checking Model Checkers
It has become good practice to expect authors of new model checking algorithms to provide not only rigorous evidence of the algorithms correctness, but also evidence of their pract...
Gerard J. Holzmann
ITP
2010
137views Mathematics» more  ITP 2010»
14 years 2 months ago
Importing HOL Light into Coq
Abstract. We present a new scheme to translate mathematical developments from HOL Light to Coq, where they can be re-used and rechecked. By relying on a carefully chosen embedding ...
Chantal Keller, Benjamin Werner
ICALP
1997
Springer
14 years 1 months ago
Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, tha...
Olaf Burkart, Bernhard Steffen