About: Counterexample Analysis in Abstract Regular Tree Model Checking of Complex Dynamic Data Structures     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • We focus in details on the use of abstract regular tree model checking (ARTMC) within a successful method for verification of programs with dynamic data structures. The method is based on a use of a set of transducers to describe the behaviour of the verified system. But the ARTMC method was originally developed for systems of one transducer only and its generalization to several ones was supposed to be straightforward. Although this straightforward generalization (used in a prototype  implementation) works well in a number of examples, the counterexample analysis is in general unreliable and can cause infinite looping of the tool as we demonstrate on a simple example containing an erroneous pointer manipulation. Therefore we propose a new  algorithm used for a counterexample analysis and we prove its correctness.
  • We focus in details on the use of abstract regular tree model checking (ARTMC) within a successful method for verification of programs with dynamic data structures. The method is based on a use of a set of transducers to describe the behaviour of the verified system. But the ARTMC method was originally developed for systems of one transducer only and its generalization to several ones was supposed to be straightforward. Although this straightforward generalization (used in a prototype  implementation) works well in a number of examples, the counterexample analysis is in general unreliable and can cause infinite looping of the tool as we demonstrate on a simple example containing an erroneous pointer manipulation. Therefore we propose a new  algorithm used for a counterexample analysis and we prove its correctness. (en)
  • Článek studuje použití abstraktního regulárního model checkingu, uvnitř úspěšné metody pro verifikace programů se složitými datovými strukturami, a to zejména analýza protipříkladů.<br> (cs)
Title
  • Counterexample Analysis in Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
  • Analýza protipříkladů v abstraktním regulárním model checkingu pro složité dynamické datové struktury (cs)
  • Counterexample Analysis in Abstract Regular Tree Model Checking of Complex Dynamic Data Structures (en)
skos:prefLabel
  • Counterexample Analysis in Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
  • Analýza protipříkladů v abstraktním regulárním model checkingu pro složité dynamické datové struktury (cs)
  • Counterexample Analysis in Abstract Regular Tree Model Checking of Complex Dynamic Data Structures (en)
skos:notation
  • RIV/00216305:26230/07:PU70921!RIV08-MSM-26230___
http://linked.open.../vavai/riv/strany
  • 59-66
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GD102/05/H050), Z(MSM0021630528)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 415189
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26230/07:PU70921
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Formal verification, Regular tree model checking, shape analysis, <br> (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [5016F15BF99A]
http://linked.open...v/mistoKonaniAkce
  • Znojmo
http://linked.open...i/riv/mistoVydani
  • Znojmo
http://linked.open...i/riv/nazevZdroje
  • Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007)
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Holík, Lukáš
  • Rogalewicz, Adam
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Neuveden
https://schema.org/isbn
  • 978-80-7355-077-6
http://localhost/t...ganizacniJednotka
  • 26230
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 41 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software