نتایج جستجو برای: mechanized

تعداد نتایج: 2131  

2004
Takashi Mitsuishi Yasunari Shidama

This paper describes optimization of the Takagi-Sugeno fuzzy model. To prove the existence of optimal control, we apply compactness of a set of membership functions in L space and continuity of approximate reasoning and show the existence of a pair of membership functions which minimize the quadratic performance function.

Journal: :Molecular biology and evolution 1989
J A Cavender

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...

2005
EDWIN M. LERNER EDWARD L. TATUM

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 ...

2010
Joe Hurd

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...

2007
Zaynah Dargaye Xavier Leroy

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 ...

Journal: :Theoretical Computer Science 1979

2007
Ludovic Henrio Florian Kammüller

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...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید