Linear invariants, discovered by Lake, promise to provide a versatile way of inferring phylogenies on the basis of nucleic acid sequences (the method that he called "evolutionary parsimony"). A semigroup of Markov transition matrices embodies the assumptions underlying the method, and alternative semigroups exist. The set of all linear invariants may be derived from the semigroup by using an al...

Editorial Board within it 'DONALD J. HUGHES H. BURR STEINBACH tracts a 1 KONRAD B. KRAUSKOPP WILLIAM L. STRAUS, JR. try. Besic EDWIN M. LERNER EDWARD L. TATUM a strong Editorial Staff SARAH S. DEES, LUCILLE GUINARD, NANCY S. tion to it HAMILTON, WILLIAM HASKELL, OLIVER W. HEATtration s] WOLE, YUKIE KOZAI, JUDITH B. LEVIN, ELLEN with its s E. MURPHY, BETHSABE PEDERSEN, MADELINE SCHNEIDER. NANCY ...

When evaluating logic solvers, it is essential to take into account the application domain in which they will operate. For example, a logic solver for reasoning about programs could be applied either inside a compiler to justify the validity of optimizing transformations, or in an IDE plugin to help developers find bugs in their programs. Despite the similarity of the domain, these two applicat...

Transformation to continuation-passing style (CPS) is often performed by optimizing compilers for functional programming languages. As part of the development and proof of correctness of a compiler for the mini-ML functional language, we have mechanically verified the correctness of two CPS transformations for a call-by-value λ-calculus with n-ary functions, recursive functions, data types and ...

A specification language used in the context of an effective theorem prover can provide novel features that enhance precision and expressiveness. In particular, typechecking for the language can exploit the services of the theorem prover. We describe a feature called “predicate subtyping” that uses this capability and illustrate its utility as mechanized in PVS. Keywords—Formal methods, specifi...

In this paper we present a formalization of Abadi’s and Cardelli’s theory of objects in the interactive theorem prover Isabelle/HOL. Our motivation is to build a mechanized HOL-framework for the analysis of a functional calculus for distributed objects. In particular, we present (a) a formal model of objects and its operational semantics based on de Bruijn indices (b) a parallel reduction relat...

I use mechanized verification to examine several firstand higher-order formalizations of Anselm’s Ontological Argument against the charge of begging the question. I propose three different criteria for a premise to beg the question in fully formal proofs and find that one or another applies to all the formalizations examined. My purpose is to demonstrate that mechanized verification provides an...