Pattern-based Verification for Trees

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F07%3APU70913" target="_blank" >RIV/00216305:26230/07:PU70913 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Pattern-based Verification for Trees

Original language description

Pattern-based verification trying to abstract away the concrete number of repeated memory structures is one of the approaches that have recently been proposed for verification of programs using dynamic data structures linked with pointers. It proved to be very efficient and promising on extended linear data structures. In this paper, we overview some possibilities how to extend this approach to programs over tree structures.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2007

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Computer Aided Systems Theory

ISBN

978-3-540-75866-2

ISSN

—

e-ISSN

—

Number of pages

9

Pages from-to

—

Publisher name

Springer Verlag

Place of publication

Berlin

Event location

Las Palmas, Gran Canaria

Event date

Feb 12, 2007

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—