scientific article; zbMATH DE number 1773084

MaRDI QIDQ4540967zbMATH OpenFDO

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

Publication date 28 July 2002

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

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)

Recommendations

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

Cited in

(16)

• Lazy automata techniques for WS1S
• Practical algorithms for MSO model-checking on tree-decomposable graphs
• Verifying Heap-Manipulating Programs in an SMT Framework
• Nested antichains for WS1S
• Nested antichains for WS1S
• Courcelle's theorem -- a game-theoretic approach
• MONA IMPLEMENTATION SECRETS
• A decision procedure for regular membership and length constraints over unbounded strings
• MONA
• A Practical Approach to Courcelle's Theorem
• Juggrnaut: using graph grammars for abstracting unbounded heap structures
• 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
• scientific article; zbMATH DE number 1670771 (Why is no real title available?)
• 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)