Publication detail

Experience from Verifying in TVLA

ERLEBACH, P.

Original Title

Experience from Verifying in TVLA

Type

article in a collection out of WoS and Scopus

Language

English

Original Abstract

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.

Keywords

TVLA, InsertBST, formal verification, Bakery algorithm

Authors

ERLEBACH, P.

RIV year

2005

Released

11. 5. 2005

Publisher

Faculty of Electrical Engineering and Communication BUT

Location

Brno

ISBN

80-214-2890-2

Book

EEICT'05

Edition

volume 3

Pages from

648

Pages to

652

Pages count

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"
}