Model-checking structured context-free languages
type: Item
instance of: scholarly article
title: Model-checking structured context-free languages
zbMATH Open document ID: 1493.68207
DOI: 10.1007/978-3-030-81688-9_18
author: Michele Chiari
author: Dino Mandrioli
author: Matteo Pradella
publication date: 2022-03-25T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B44
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 7498189
zbMATH Keywords: linear temporal logic
zbMATH Keywords: operator-precedence languages
zbMATH Keywords: model checking
zbMATH Keywords: visibly pushdown languages
zbMATH Keywords: input-driven languages
describes a project that uses: SPIN
describes a project that uses: Java-MOP
describes a project that uses: VPAlib
describes a project that uses: BLAST
describes a project that uses: Bebop
describes a project that uses: OpenNWA
describes a project that uses: GitHub
MaRDI profile type: Publication
full work available at URL: 978-3-030-81688-9 18
OpenAlex ID: W3185983707
cites work: First-Order and Temporal Logics for Nested Words
cites work: Model Checking Procedural Programs
cites work: Tools and Algorithms for the Construction and Analysis of Systems
cites work: Visibly pushdown languages
cites work: Adding nesting structure to words
cites work: Q2753756
cites work: Reachability analysis of pushdown automata: Application to model-checking
cites work: Constrained properties, semilinear systems, and Petri nets
cites work: Q3384894
cites work: Visibly Linear Temporal Logic
cites work: Model checking the full modal mu-calculus for infinite sequential processes
cites work: Stack size analysis for interrupt-driven programs
cites work: Q5447361
cites work: Q3384888
cites work: Operator precedence temporal logic and model checking
cites work: Handbook of Model Checking
cites work: Operator precedence and the visibly pushdown property
cites work: Q2754086
cites work: Model checking LTL with regular valuations for pushdown systems
cites work: Q4223067
cites work: Syntactic Analysis and Operator Precedence
cites work: Analysis of Boolean Programs
cites work: Parsing Techniques
cites work: Q4198075
cites work: Q4426387
cites work: Predicate Abstraction for Program Verification
cites work: Q4804910
cites work: Q4428305
cites work: Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
cites work: Generalizing input-driven languages: theoretical and practical benefits
cites work: Star-freeness, first-order definability and aperiodicity of structured context-free languages
cites work: Parenthesis Grammars
cites work: Q3890112
cites work: Computer Aided Verification
cites work: Pushdown processes: Games and model-checking
description: scientific article; zbMATH DE number 7498189