A complete refinement procedure for regular separability of context-free languages

DOI10.1016/j.tcs.2016.01.026zbMath1338.68147arXiv1411.5131OpenAlexW1528946883WikidataQ57664979 ScholiaQ57664979MaRDI QIDQ264992

Peter Schachte, Harald Søndergaard, Peter J. Stuckey, Graeme Gange, Jorge A. Navas

Publication date: 1 April 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.5131

zbMATH Keywords

separabilitycontext-free languagesabstraction refinementregular approximation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Uses Software

• MAGIC
• ALGOL 60
• StrSolve

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generic approach to the static analysis of concurrent programs with procedures
• HTML Validation of Context-Free Languages
• Analyzing Context-Free Grammars Using an Incremental SAT Solver
• Visibly pushdown languages
• On the Decidability of Grammar Problems
• Horn clauses as an intermediate representation for program analysis and transformation
• Nested interpolants
• Unbounded Model-Checking with Interpolation for Regular Language Constraints
• XML Validation for Context-Free Grammars
• Complexity of pattern-based verification for multithreaded programs
• Bounded Algol-Like Languages
• On Decompositions of Regular Events
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: A complete refinement procedure for regular separability of context-free languages