Configuration Dynamics Verification Using UPPAAL

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F13%3A00210799" target="_blank" >RIV/68407700:21340/13:00210799 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Configuration Dynamics Verification Using UPPAAL

Popis výsledku v původním jazyce

Software applications become more and more complicated, nowadays. The complexity of the internal dynamics of a modern software application can be hard to maintain. Software configuration is one of the areas where the internal dynamics can become very complicated because there usually exists a huge amount of states that the system can be in. Of course, implementation of configuration tools is a hard task, especially in imperative-style languages, since the programmer must take into consideration all special combinations of states and implement the appropriate behavior of the program for all of them. It is very easy to make a mistake or to omit a special condition in such a code. There are two ways to solve this problem. One is to use declarative programming which is suitable for these classes of problems~(but the programmer must be familiar with an unusual approach of this style of programming) or to use system verifiers to check whether the application behaves correctly under all circu

Název v anglickém jazyce

Configuration Dynamics Verification Using UPPAAL

Popis výsledku anglicky

Software applications become more and more complicated, nowadays. The complexity of the internal dynamics of a modern software application can be hard to maintain. Software configuration is one of the areas where the internal dynamics can become very complicated because there usually exists a huge amount of states that the system can be in. Of course, implementation of configuration tools is a hard task, especially in imperative-style languages, since the programmer must take into consideration all special combinations of states and implement the appropriate behavior of the program for all of them. It is very easy to make a mistake or to omit a special condition in such a code. There are two ways to solve this problem. One is to use declarative programming which is suitable for these classes of problems~(but the programmer must be familiar with an unusual approach of this style of programming) or to use system verifiers to check whether the application behaves correctly under all circu

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2013

Kód důvěrnosti údajů

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

Název statě ve sborníku

Doktorandské dny 2013

ISBN

978-80-01-05379-9

ISSN

—

e-ISSN

—

Počet stran výsledku

2

Strana od-do

31-32

Název nakladatele

Česká technika - nakladatelství ČVUT

Místo vydání

Praha

Místo konání akce

Praha

Datum konání akce

15. 11. 2013

Typ akce podle státní příslušnosti

CST - Celostátní akce

Kód UT WoS článku

—