Sciweavers

632 search results - page 77 / 127
» Combining programming with theorem proving
Sort
View
MCMASTER
1993
14 years 12 hour ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
ICALP
2009
Springer
14 years 8 months ago
Decidability of Conjugacy of Tree-Shifts of Finite Type
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...
Nathalie Aubrun, Marie-Pierre Béal
WWW
2010
ACM
14 years 2 months ago
Debugging standard document formats
We present a tool for helping XML schema designers to obtain a high quality level for their specifications. The tool allows one to analyze relations between classes of XML docume...
Nabil Layaïda, Pierre Genevès
ACL2
2006
ACM
14 years 1 months ago
Phylogenetic trees in ACL2
Biologists studying the evolutionary relationships between organisms use software packages to solve the computational problems they encounter. Several of these problems involve th...
Warren A. Hunt Jr., Serita M. Nelesen
GI
2004
Springer
14 years 1 months ago
A Formal Correctness Proof for Code Generation from SSA Form in Isabelle/HOL
Abstract: Optimizations in compilers are the most error-prone phases in the compilation process. Since correct compilers are a vital precondition for software correctness, it is ne...
Jan Olaf Blech, Sabine Glesner