OpenNWA: a nested-word automaton library

Authors:
Evan Driscoll;Aditya Thakur;Thomas Reps
Affiliations:
Computer Sciences Department, University of Wisconsin, Madison, WI;Computer Sciences Department, University of Wisconsin, Madison, WI;Computer Sciences Department, University of Wisconsin, Madison, WI, USA, GrammaTech, Inc., Ithaca, NY
Venue:
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Year:
2012

Citing 6
Cited 3

Weighted pushdown systems and their application to interprocedural dataflow analysis

Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Adding nesting structure to words

Journal of the ACM (JACM)
Checking conformance of a producer and a consumer

Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering
Directed proof generation for machine code

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Adding nesting structure to words

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Efficient runtime policy enforcement using counterexample-guided abstraction refinement

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification

TSL: A System for Generating Abstract Interpreters and its Application to Machine-Code Analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Ramsey goes visibly pushdown

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Trimming visibly pushdown automata

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nested-word automata (NWAs) are a language formalism that helps bridge the gap between finite-state automata and pushdown automata. NWAs can express some context-free properties, such as parenthesis matching, yet retain all the desirable closure characteristics of finite-state automata. This paper describes OpenNWA, a C++ library for working with NWAs. The library provides the expected automata-theoretic operations, such as intersection, determinization, and complementation. It is packaged with WALi--the Weighted Automaton Library--and interoperates closely with the weighted pushdown system portions of WALi.