Pushdown module checking
type: Item
instance of: scholarly article
title: Pushdown module checking
zbMATH Open document ID: 1209.68312
author: Laura Bozzelli
author: Aniello Murano
author: Adriano Peron
published in: Formal Methods in System Design
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 5703914
zbMATH Keywords: module checking
zbMATH Keywords: pushdown systems
zbMATH Keywords: branching temporal logics
zbMATH Keywords: tree automata
MaRDI profile type: Publication
full work available at URL: s10703-010-0093-x
OpenAlex ID: W2092229972
cites work: Pushdown Module Checking with Imperfect Information
cites work: Verification, Model Checking, and Abstract Interpretation
cites work: Pushdown Module Checking
cites work: Two-Way Tree Automata Solving Pushdown Games
cites work: Alternation
cites work: “Sometimes” and “not never” revisited
cites work: Model checking LTL with regular valuations for pushdown systems
cites work: Enriched MU-Calculi Module Checking
cites work: Q3777424
cites work: Buy one, get one free!!!
cites work: Q4536596
cites work: An automata-theoretic approach to branching-time model checking
cites work: Module checking
cites work: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
cites work: Alternating finite automata on \(\omega\)-words
cites work: The theory of ends, pushdown automata, and second-order logic
cites work: Q4219045
cites work: Automata-theoretic techniques for modal logics of programs
cites work: Monadic second-order logic on tree-like structures
DOI: 10.1007/S10703-010-0093-X
description: scientific article; zbMATH DE number 5703914