Regular Model Checking Using Inference of Regular Languages

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F05%3APU66853" target="_blank" >RIV/00216305:26230/05:PU66853 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Regular Model Checking Using Inference of Regular Languages

Original language description

Regular model checking is a method for verifying infinite-state systems based on coding their configurations as words over a finite alphabet, sets of configurations as finite automata, and transitions as finite transducers. We introduce a new general approach to regular model checking based on inference of regular languages. The method builds upon the observation that for infinite-state systems whose behaviour can be modelled using length-preserving transducers,&nbsp; there is a finite computation for obtaining all reachable&nbsp; configurations up to a certain length n.<br> These configurations are a (positive) sample of the reachable configurations of the given system, whereas~all other words up to length n are a negative sample. Then, methods of inference of regular languages can be used to generalise the sample to the full reachability set (or an overapproximation of it). We have implemented our method in a prototype tool which shows that our approach is competitive on a number of

Czech name

Regulární model checking založený na učení jazyků

Czech description

článek presentuje originální přístup k implemetaci regulárního model checkingu, což je generická metoda pro verifikaci nekonečně stavových a parametrických systémů. Navržená metoda je založena na učení regulárních jazyků ze vzorků. Metoda byla experimentálně ověřena a vykazuje velmi pěkné výkonnostní charakteristiky. Co je ale ještě více zajímavé, je to, že tato metoda zaručuje konečnost výpočtu ve všech případech, kdy zkoumaný systém ma regulární stavový prostor.

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

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

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2005

Confidentiality

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

Name of the periodical

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE

ISSN

1571-0661

e-ISSN

—

Volume of the periodical

138

Issue of the periodical within the volume

3

Country of publishing house

US - UNITED STATES

Number of pages

16

Pages from-to

21-36

UT code for WoS article

—

EID of the result in the Scopus database

—