MONA IMPLEMENTATION SECRETS

From MaRDI portal
Publication:3021971

DOI10.1142/S012905410200128XzbMath1066.68079OpenAlexW1987469449MaRDI QIDQ3021971

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

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905410200128x




Related Items

A symbolic decision procedure for symbolic alternating finite automataDeciding Boolean algebra with Presburger arithmeticLogic programming approach to automata-based decision proceduresFirst-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certificationMechanizing the Powerset Construction for Restricted Classes of ω-AutomataSymbolic tree automataNested antichains for WS1SCertifying proofs in the first-order theory of rewritingLazy Automata Techniques for WS1SMinimization of Visibly Pushdown Automata Using Partial Max-SATAutomata-based symbolic string analysis for vulnerability detectionBounded treewidth as a key to tractability of knowledge representation and reasoningEhrenfeucht-Fraïssé goes automatic for real additionMonitoring Metric First-Order Temporal PropertiesLanguage-Based Abstraction Refinement for Hybrid System VerificationAutomata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedureAutomata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedureAn Evaluation of Automata Algorithms for String AnalysisDeciding Monadic Second Order Logic over $$\omega $$ ω -Words by Specialized Finite AutomataMONAPITL2MONA: Implementing a Decision Procedure for Propositional Interval Temporal LogicDon't care words with an application to the automata-based approach for real additionTurning decision procedures into disproversRelativizations for the logic-automata connection



Cites Work