Computer Aided Verification

DOI10.1007/B98490zbMATH Open1103.68606OpenAlexW4298302743MaRDI QIDQ5312910FDOQ5312910

Authors: Constantinos Bartzis, Tevfik Bultan 

Publication date: 25 August 2005

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

Full work available at URL: https://doi.org/10.1007/b98490

Recommendations

• Computing the width of non-deterministic automata
• Finite automata and arithmetic
• scientific article; zbMATH DE number 1223712
• Width of non-deterministic automata
• Arithmetic coding of weighted finite automata
• Approaching arithmetic theories with finite-state automata
• Compiler Construction
• Automata in number theory
• Automata and rational expressions

Mathematics Subject Classification ID

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

Cited In (10)

• Symbolic String Verification: Combining String Analysis and Size Analysis
• Action language verifier: An infinite-state model checker for reactive software specifications
• Don't care words with an application to the automata-based approach for real addition
• Twinning automata and regular expressions for string static analysis
• Structural Presburger digit vector automata
• Learning to verify branching time properties
• Relational string verification using multi-track automata
• Automata-based symbolic string analysis for vulnerability detection
• Compiler Construction
• String abstract domains and their combination

This page was built for publication: Computer Aided Verification

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