Reachability for dynamic parametric processes

Anca Muscholl, Helmut Seidl, Igor Walukiewicz

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

6 Zitate (Scopus)

Abstract

In a dynamic parametric process every subprocess may spawn arbitrarily many, identical child processes, that may communicate either over global variables, or over local variables that are shared with their parent. We show that reachability for dynamic parametric processes is decidable under mild assumptions. These assumptions are e.g. met if individual processes are realized by pushdown systems, or even higher-order pushdown systems. We also provide algorithms for subclasses of pushdown dynamic parametric processes, with complexity ranging between NP and DEXPTIME.

OriginalspracheEnglisch
TitelVerification, Model Checking, and Abstract Interpretation - 18th International Conference, VMCAI 2017, Proceedings
Redakteure/-innenAhmed Bouajjani, David Monniaux
Herausgeber (Verlag)Springer Verlag
Seiten424-441
Seitenumfang18
ISBN (Print)9783319522333
DOIs
PublikationsstatusVeröffentlicht - 2017
Veranstaltung18th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2017 - Paris, Frankreich
Dauer: 15 Jan. 201717 Jan. 2017

Publikationsreihe

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Band10145 LNCS
ISSN (Print)0302-9743
ISSN (elektronisch)1611-3349

Konferenz

Konferenz18th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2017
Land/GebietFrankreich
OrtParis
Zeitraum15/01/1717/01/17

Fingerprint

Untersuchen Sie die Forschungsthemen von „Reachability for dynamic parametric processes“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren