Tools and Algorithms for the Construction and Analysis of Systems: 4th International Conference, TACAS'98, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28 - April 4, 1998, Proceedings, כרך 4Bernhard Steffen Springer Science & Business Media, 18 במרץ 1998 - 455 עמודים ETAPS'99 is the second instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conferences. This year it comprises ve conferences (FOSSACS, FASE, ESOP, CC, TACAS), four satellite workshops (CMCS, AS, WAGA, CoFI), seven invited lectures, two invited tutorials, and six contributed tutorials. The events that comprise ETAPS address various aspects of the system - velopment process, including speci cation, design, implementation, analysis and improvement. The languages, methodologies and tools which support these - tivities are all well within its scope. Dieren t blends of theory and practice are represented, with an inclination towards theory with a practical motivation on one hand and soundly-based practice on the other. Many of the issues involved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive. |
תוכן
I | 1 |
II | 5 |
III | 20 |
IV | 36 |
V | 52 |
VI | 68 |
VII | 85 |
VIII | 102 |
XVII | 249 |
XVIII | 263 |
XIX | 281 |
XX | 298 |
XXI | 313 |
XXII | 330 |
XXIII | 345 |
XXIV | 358 |
IX | 118 |
X | 136 |
XI | 151 |
XII | 167 |
XIII | 184 |
XIV | 201 |
XV | 217 |
XVI | 232 |
XXV | 376 |
XXVI | 393 |
XXVII | 409 |
424 | |
439 | |
XXXI | |
מהדורות אחרות - הצג הכל
Tools and Algorithms for the Construction and Analysis of Systems: 4th ... <span dir=ltr>Bernhard Steffen</span> אין תצוגה מקדימה זמינה - 1998 |
Tools and Algorithms for the Construction and Analysis of Systems: 4th ... <span dir=ltr>Bernhard Steffen</span> אין תצוגה מקדימה זמינה - 1998 |
מונחים וביטויים נפוצים
abstract algorithm analysis application approach automata bisimulation bit-vectors boolean Büchi automaton checker clock compiler components Computer Science concurrent configuration constraints construction corresponding defined Definition denote E.M. Clarke efficient example execution finite formal formal verification formula function global graph IEEE implementation infinite initial input interface iteration LAFP Lemma literate programming LNCS logic programs loop M-net machines memory method model checking module MuForm node Notes in Computer OPEN/CÆSAR operations output partial order partial order reduction performed Petri nets Proc Programming Languages Promela proof protocol reachability reduction relay races represented requirements RLL programs ROBDD satisfies semantics sequence simulation space specification Springer-Verlag STATEMATE structure subset symbolic symmetries synchronous tamagotchi techniques temporal logic test automaton Theorem tool transition relation transition system translation UPPAAL v₁ validation variables verification
קטעים בולטים
עמוד 436 - P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program.