Detail publikace

Experience from Verifying in TVLA

ERLEBACH, P.

Originální název

Experience from Verifying in TVLA

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

This paper aims at analysis of capabilities of the TVLA verification tool. There are used InsertBST procedure, which inserts a new node to the binary sorted tree, and Bakery algorithm, which is one of the most famous mutual exclusion algorithms, as examined examples.

Klíčová slova

TVLA, InsertBST, formal verification, Bakery algorithm

Autoři

ERLEBACH, P.

Rok RIV

2005

Vydáno

11. 5. 2005

Nakladatel

Faculty of Electrical Engineering and Communication BUT

Místo

Brno

ISBN

80-214-2890-2

Kniha

EEICT'05

Edice

volume 3

Strany od

648

Strany do

652

Strany počet

5

BibTex

@inproceedings{BUT17968,
  author="Pavel {Erlebach}",
  title="Experience from Verifying in TVLA",
  booktitle="EEICT'05",
  year="2005",
  series="volume 3",
  pages="648--652",
  publisher="Faculty of Electrical Engineering and Communication BUT",
  address="Brno",
  isbn="80-214-2890-2"
}