summaryrefslogtreecommitdiff
path: root/support/w2latex/EXEMPLES/DOgurevich.rtf
blob: 2e9043812ed4a37bfa454dcc0b9406ff46abee0f (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
{\rtf1\mac\deff2 {\fonttbl{\f0\fswiss Chicago;}{\f2\froman New York;}{\f3\fswiss Geneva;}{\f4\fmodern Monaco;}{\f6\fdecor London;}{\f8\fdecor San Francisco;}{\f11\fnil Cairo;}{\f12\fnil Los Angeles;}{\f13\fnil Zapf Dingbats;}{\f14\fnil Bookman;}
{\f16\fnil Palatino;}{\f18\fnil Zapf Chancery;}{\f20\froman Times;}{\f21\fswiss Helvetica;}{\f22\fmodern Courier;}{\f23\ftech Symbol;}{\f24\fnil Mobile;}{\f33\fnil Avant Garde;}{\f34\fnil New Century Schlbk;}{\f101\fnil Wartburg;}{\f118\fnil Warwick S;}
{\f128\fnil Moscow;}{\f129\fnil Russian;}{\f135\fnil MATH-BES;}{\f140\fnil Lovell;}{\f149\fnil Detroit;}{\f171\fnil XB Futura ExtraBold;}{\f176\fnil H Futura Heavy;}{\f201\fnil ¡Math;}{\f512\fnil Alexandrie;}{\f2500\fnil Konstanz;}}
{\colortbl\red0\green0\blue0;\red0\green0\blue255;\red0\green255\blue255;\red0\green255\blue0;\red255\green0\blue255;\red255\green0\blue0;\red255\green255\blue0;\red255\green255\blue255;}{\stylesheet{\sbasedon222\snext0 Normal;}}{\info{\title 
DOgurevich.rtf}{\author Centre International de Rencontres Mathematiques}}\paperw11880\paperh16820\margl1701\margr1701\margt1417\margb1417\deftab709\widowctrl\ftnbj\makebackup \sectd \linemod0\linex0\headery1077\footery1077\cols1\colsx709\endnhere 
\pard\plain \qc\sl360 {\b\f16 Evolving Algebras\par 
\par 
Yuri Gurevich , University of Michigan\par 
}\pard \sl360 {\f16 \par 
\par 
}\pard \sl360 {\f16 The main goal of the evolving algebra method is to provide succint and executable formal specifications for algorithms. Here the term algorithm is taken in a broad sense including programming lang
uages, architectures, distibuted and real-time protocols, etc... Such specifications may be used for designing algorithms ; for testing, verifying and proving various properties of algorithms ; for documenting, maintaining, understanding and teaching algor
ithms. The EA project started as an attempt to improve on Turing's thesis. Computation models and specification methods seem to be world apart. The EA project may be seen as an attempt to bridge the gap. The EA thesis says, rougly speaking, that every algo
rithm can be viewed as an evolving algebra. The EA computation model has been used to prove a linear-time hierarchy theorem, but for the most part evolving algebra are used for specification and related purposes. In the talk, we plan to motivate and explai
n basic evolving algebras, argue for the EA thesis, state the linear-time hierarchy theorem and illustrate the uses of evolving algebras as specification tool.\par 
}\pard \par 
}