Weighted Dynamic Pushdown Networks

Wenner, Alexander

doi:10.4230/DROPS.MEMICS.2009.2344

Document

Weighted Dynamic Pushdown Networks

Author Alexander Wenner

Part of: Volume: Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) (MEMICS 2009)
Part of: Series: Open Access Series in Informatics (OASIcs)
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
Publication Date: 2009-12-15

PDF

File

PDF

DROPS.MEMICS.2009.2344.pdf

Filesize: 432 kB
8 pages

Document Identifiers

DOI: 10.4230/DROPS.MEMICS.2009.2344
URN: urn:nbn:de:0030-drops-23440

Subject Classification

Keywords

Program analysis
recursive procedures
dynamic process creation
dataflow analysis

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

We develop a generic framework for the analysis of programs with recursive procedures and dynamic process creation. To this end we combine the approach of weighted pushdown systems (WPDS) with the model of dynamic pushdown networks (DPN). Weighted dynamic pushdown networks (WDPN) describe processes running in parallel. Each process may perform pushdown actions and spawn new processes. Transitions are labelled by weights to carry additional information. We derive a method to determine meet-over-all-paths values for the paths from a starting configuration to a regular set of configurations of a WDPN.

Cite As Get BibTex

Alexander Wenner. Weighted Dynamic Pushdown Networks. In Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). Open Access Series in Informatics (OASIcs), Volume 13, pp. 114-121, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009) https://doi.org/10.4230/DROPS.MEMICS.2009.2344

Author Details

Alexander Wenner

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail