{"paper":{"title":"Iterable Forward Reachability Analysis of Monitor-DPNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.PL"],"primary_cat":"cs.LO","authors_text":"Benedikt Nordhoff (Westf\\\"alische Wilhelms-Universit\\\"at M\\\"unster, Germany), Markus M\\\"uller-Olm (Westf\\\"alische Wilhelms-Universit\\\"at M\\\"unster, Peter Lammich (Technische Universit\\\"at M\\\"unchen","submitted_at":"2013-09-20T01:46:11Z","abstract_excerpt":"There is a close connection between data-flow analysis and model checking as observed and studied in the nineties by Steffen and Schmidt.  This indicates that automata-based analysis techniques developed in the realm of infinite-state model checking can be applied as data-flow analyzers that interpret complex control structures, which motivates the development of such analysis techniques for ever more complex models.  One approach proposed by Esparza and Knoop is based on computation of predecessor or successor sets for sets of automata configurations.  Our goal is to adapt and exploit this ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5150","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}