Analyzing Context-Free Grammars Using an Incremental SAT Solver

Authors:
Roland Axelsson;Keijo Heljanko;Martin Lange
Affiliations:
Institut für Informatik, Ludwig-Maximilians-Universität, München, Germany;Department of Information and Computer Science, Helsinki University of Technology (TKK), Finland;Institut für Informatik, Ludwig-Maximilians-Universität, München, Germany
Venue:
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Year:
2008

Citing 6
Cited 8

Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
LR-regular grammars-an extension of LR(k) grammars

Journal of Computer and System Sciences
Decomposing global grammar constraints

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Analyzing ambiguity of context-free grammars

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Conservative ambiguity detection in context-free grammars

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Solving string constraints lazily

Proceedings of the IEEE/ACM international conference on Automated software engineering
Faster ambiguity detection by grammar filtering

Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications
Tracking down the origins of ambiguity in context-free grammars

ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Symbolic automata constraint solving

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
SugarJ: library-based syntactic language extensibility

Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Ambiguity detection: scaling to scannerless

SLE'11 Proceedings of the 4th international conference on Software Language Engineering
HAMPI: A solver for word equations over strings, regular expressions, and context-free grammars

ACM Transactions on Software Engineering and Methodology (TOSEM)
Unbounded model-checking with interpolation for regular language constraints

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider bounded versions of undecidable problems about context-free languages which restrict the domain of words to some finite length: inclusion, intersection, universality, equivalence, and ambiguity. These are in (co)-NP and thus solvable by a reduction to the (un-)satisfiability problem for propositional logic. We present such encodings --- fully utilizing the power of incrementat SAT solvers --- prove correctness and validate this approach with benchmarks.