Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking

DOI10.1007/978-3-642-33654-6_18zbMath1367.68158OpenAlexW284384401MaRDI QIDQ2918989

Dominik Engelke, Christoph Blume, H. J. Sander Bruggink, Barbara König

Publication date: 2 October 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33654-6_18

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Related Items (2)

Inductive Invariant Checking with Partial Negative Application Conditions ⋮ Specifying graph languages with type graphs

Uses Software

• MONA

This page was built for publication: Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking