scientific article; zbMATH DE number 1773084

zbMath0989.03500MaRDI QIDQ4540967

Anders Møller, Nils Klarlund, Michael I. Schwartzbach

Publication date: 28 July 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2088/20880182

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04)

Related Items (10)

Specification and optimal reactive synthesis of run-time enforcement shields ⋮ Courcelle's theorem -- a game-theoretic approach ⋮ Verifying Heap-Manipulating Programs in an SMT Framework ⋮ A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ Complexity of fixed-size bit-vector logics ⋮ A Practical Approach to Courcelle's Theorem ⋮ An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures ⋮ Juggrnaut: using graph grammars for abstracting unbounded heap structures ⋮ MONA

This page was built for publication: