scientific article; zbMATH DE number 1773084

zbMATH Open0989.03500MaRDI QIDQ4540967FDOQ4540967

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

Publication date: 28 July 2002

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

Title of this publication is not available (Why is that?)

Recommendations

• MONA IMPLEMENTATION SECRETS
• scientific article; zbMATH DE number 1223628
• Lazy automata techniques for WS1S
• Nested antichains for WS1S
• Nested antichains for WS1S

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)

Cited In (14)

• Verifying Heap-Manipulating Programs in an SMT Framework
• Practical algorithms for MSO model-checking on tree-decomposable graphs
• Courcelle's theorem -- a game-theoretic approach
• MONA IMPLEMENTATION SECRETS
• A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings
• A Practical Approach to Courcelle's Theorem
• MONA
• Juggrnaut: using graph grammars for abstracting unbounded heap structures
• Specification and optimal reactive synthesis of run-time enforcement shields
• An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures
• Complexity of fixed-size bit-vector logics
• Title not available (Why is that?)
• Combining WS1S and HOL
• Relativizations for the logic-automata connection

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540967)