Muutke küpsiste eelistusi

E-raamat: Provably Correct Systems

Edited by , Edited by , Edited by
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 110,53 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

As computers increasingly control the systems and services we depend upon within our daily lives like transport, communications, and the media, ensuring these systems function correctly is of utmost importance. This book consists of twelve chapters and one historical account that were presented at a workshop in London in 2015, marking the 25th anniversary of the European ESPRIT Basic Research project "ProCoS" (Provably Correct Systems). The ProCoS I and II projects pioneered and accelerated the automation of verification techniques, resulting in a wide range of applications within many trades and sectors such as aerospace, electronics, communications, and retail.The following topics are covered:A historical account of the ProCoS projectHybrid SystemsCorrectness of Concurrent AlgorithmsInterfaces and LinkingAutomatic VerificationRun-time Assertions CheckingFormal and Semi-Formal Methods Provably Correct Systems provides researchers, designers and engineers with a comple

te overview of the ProCoS initiative, past and present, and explores current developments and perspectives within the field.

Foreword.- Preface.- Part I: Historic Account.- ProCoS: How It All Began - As Seen from Denmark.- Part II: Hybrid Systems .- Constraint-Solving Techniques for the Analysis of Probabilistic Hybrid Systems.- MARS: A Tool chain for Modelling, Analysis and Verification of Hybrid Systems.- Part III: Correctness of Concurrent Algorithms .- A Proof Method for Linearizability on TSO Architectures.- Part IV: Interfaces and Linking .- Linking Discrete and Continuous Models, Applied to Traffic Manoeuvres.- Towards Interface-Driven Design of Evolving Component-Based Architectures.- Part V: Automatic Verification .- Computing Verified Machine Address Bounds during Symbolic Exploration of Code.- Engineering a Formal, Executable x86 ISA Simulator for Software Verification.- Advances in Connection-Based Automated Theorem Proving.- Part VI: Run-Time Assertion Checking .- Run-Time Deadlock Detection.- In-Circuit Assertions and Exceptions for Reconfigurable Hardware Design.- Part VII: Formal and Sem

i-Formal Methods.- From ProCoS to Space and Mental Models - a Survey of Combing Formal and Semi-Formal Methods.- Part VIII: Web-Supported Communities in Science .- Provably Correct Systems: Community, Connections and Citations.
Part I Historic Account
ProCoS: How It All Began -- as Seen from Denmark
3(6)
Dines Bjørner
Part II Hybrid Systems
Constraint-Solving Techniques for the Analysis of Stochastic Hybrid Systems
9(30)
Martin Franzle
Yang Gao
Sebastian Gerwinn
MARS: A Toolchain for Modelling, Analysis and Verification of Hybrid Systems
39(22)
Mingshuai Chen
Xiao Han
Tao Tang
Shilling Wang
Mengfei Yang
Naijun Zhan
Hengjun Zhao
Liang Zou
Part III Correctness of Concurrent Algorithms
A Proof Method for Linearizability on TSO Architectures
61(34)
John Derrick
Graeme Smith
Lindsay Groves
Brijesh Dongol
Part IV Interfaces and Linking
Linking Discrete and Continuous Models, Applied to Traffic Manoeuvrers
95(26)
Ernst-Rudiger Olderog
Anders P. Ravn
Rafael Wisniewski
Towards Interface-Driven Design of Evolving Component-Based Architectures
121(30)
Xin Chen
Zhiming Liu
Part V Automatic Verification
Computing Verified Machine Address Bounds During Symbolic Exploration of Code
151(22)
J. Strother Moore
Engineering a Formal, Executable x86 ISA Simulator for Software Verification
173(38)
Shilpi Goel
Warren A. Hunt Jr.
Matt Kaufmann
Advances in Connection-Based Automated Theorem Proving
211(34)
Jens Otten
Wolfgang Bibel
Part VI Run-Time Assertion Checking
Run-Time Deadlock Detection
245(20)
Frank S. de Boer
Stijn de Gouw
In-Circuit Assertions and Exceptions for Reconfigurable Hardware Design
265(20)
Tim Todman
Wayne Luk
Part VII Formal and Semi-formal Methods
From ProCoS to Space and Mental Models---A Survey of Combining Formal and Semi-formal Methods
285(28)
Bettina Buth
Part VIII Web-Supported Communities in Science
Provably Correct Systems: Community, Connections, and Citations
313
Jonathan P. Bowen