|
Showing 1 - 7 of
7 matches in All Departments
This Festschrift, dedicated to Bengt Jonsson on the occasion of his
60th birthday, contains papers written by many of his friends and
collaborators.Bengt has made major contributions covering a wide
range of topics including verification and learning. His works on
verification, in finite state systems, learning, testing,
probabilistic systems, timed systems, and distributed systems
reflect both the diversity and the depth of his research. Besides
being an excellent scientist, Bengt is also a leader who has
greatly influenced the careers of both his students and his
colleagues. His main focus throughout his career has been in the
area of formal methods, and the research papers dedicated to him in
this volume address related topics, particularly related to model
checking, temporal logic, and automata learning.
HIS BOOK CONTAINS a most comprehensive text that presents
syntax-directed and compositional methods for the formal veri?- T
cation of programs. The approach is not language-bounded in the
sense that it covers a large variety of programming models and
features that appear in most modern programming languages. It
covers the classes of - quential and parallel, deterministic and
non-deterministic, distributed and object-oriented programs. For
each of the classes it presents the various c- teria of correctness
that are relevant for these classes, such as interference freedom,
deadlock freedom, and appropriate notions of liveness for parallel
programs. Also, special proof rules appropriate for each class of
programs are presented. In spite of this diversity due to the rich
program classes cons- ered, there exist a uniform underlying theory
of veri?cation which is synt- oriented and promotes compositional
approaches to veri?cation, leading to scalability of the methods.
The text strikes the proper balance between mathematical rigor and
- dactic introduction of increasingly complex rules in an
incremental manner, adequately supported by state-of-the-art
examples. As a result it can serve as a textbook for a variety of
courses on di?erent levels and varying durations. It can also serve
as a reference book for researchers in the theory of veri?- tion,
in particular since it contains much material that never before
appeared in book form. This is specially true for the treatment of
object-oriented p- grams which is entirely novel and is strikingly
elegant.
HIS BOOK CONTAINS a most comprehensive text that presents
syntax-directed and compositional methods for the formal veri?- T
cation of programs. The approach is not language-bounded in the
sense that it covers a large variety of programming models and
features that appear in most modern programming languages. It
covers the classes of - quential and parallel, deterministic and
non-deterministic, distributed and object-oriented programs. For
each of the classes it presents the various c- teria of correctness
that are relevant for these classes, such as interference freedom,
deadlock freedom, and appropriate notions of liveness for parallel
programs. Also, special proof rules appropriate for each class of
programs are presented. In spite of this diversity due to the rich
program classes cons- ered, there exist a uniform underlying theory
of veri?cation which is synt- oriented and promotes compositional
approaches to veri?cation, leading to scalability of the methods.
The text strikes the proper balance between mathematical rigor and
- dactic introduction of increasingly complex rules in an
incremental manner, adequately supported by state-of-the-art
examples. As a result it can serve as a textbook for a variety of
courses on di?erent levels and varying durations. It can also serve
as a reference book for researchers in the theory of veri?- tion,
in particular since it contains much material that never before
appeared in book form. This is specially true for the treatment of
object-oriented p- grams which is entirely novel and is strikingly
elegant.
This book constitutes the refereed proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, FTRTFT 2002, held in Oldenburg, Germany, in September 2002.The 17 revised full papers presented together with 2 invited tutorials and 6 invited papers were carefully reviewed and selected from 39 submissions. The papers are organized in topical sections on synthesis and scheduling, timed automata, bounded model checking, verification and conformance testing, and UML models and model checking.
Computers are gaining more and more control over systems that we
use or rely on in our daily lives, privately as well as
professionally. In safety-critical applications, as well as in
others, it is of paramount importance that systems controled by a
computer or computing systems themselves reliably behave in
accordance with the specification and requirements, in other words:
here correctness of the system, of its software and hardware is
crucial. In order to cope with this callenge, software engineers
and computer scientists need to understand the foundations of
programming, how different formal theories are linked together, how
compilers correctly translate high-level programs into machine
code, and why transformations performed are justifiable. This book
presents 17 mutually reviewed invited papers organized in sections
on methodology, programming, automation, compilation, and
application.
Dieses Buch bietet als erstes Lehrbuch eine systematische
Einf}hrung in die Programmverifikation. Sequentielle, parallele und
verteilte Programme werdenin einheitlicher Weise behandelt. In den
einzelnen Kapiteln des Buches werden deterministische und
nichtdeterministische Programme, Programme mit gemeinsamen
Variablen und verteilte Programme mit Kommunikation
}berBotschaftenaustausch behandelt. F}r jede dieser Programmklassen
werden eine operationelle Semantik, Syntax-gerichtete
Verifikationsregeln mitsamt Korrektheitsbeweis und ein gr- eres
Verifikationsbeispiel vorgestellt. Insbesondere werden Programme
zur L-sung der klassischen Probleme Erzeuger-Verbraucher,
wechselweiser Ausschlu und verteilte Terminierung diskutiert und
verifiziert. Eine Besonderheit desBuches ist die einheitliche
Behandlung von Fairne -Annahmen und die Benutzung von
Programmtransformationen. Das Buch eignet sich f}r ein- oder
zweisemestrige Vorlesungen }ber Programmverifikation. Die Kapitel
sind einheitlich strukturiert und enthalten eine Reihe von
]bungsaufgaben und bibliographischen Hinweisen. Das Buch f}hrt auch
an aktuelle Themen der Forschung heran.
Real-time systems need to react to certain input stimuli within
given time bounds. For example, an airbag in a car has to unfold
within 300 milliseconds in a crash. There are many embedded
safety-critical applications and each requires real-time
specification techniques. This text introduces three of these
techniques, based on logic and automata: duration calculus, timed
automata, and PLC-automata. The techniques are brought together to
form a seamless design flow, from real-time requirements specified
in the duration calculus; via designs specified by PLC-automata;
and into source code for hardware platforms of embedded systems.
The syntax, semantics, and proof methods of the specification
techniques are introduced; their most important properties are
established; and real-life examples illustrate their use. Detailed
case studies and exercises conclude each chapter. Ideal for
students of real-time systems or embedded systems, this text will
also be of great interest to researchers and professionals in
transportation and automation.
|
You may like...
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
|