A parametric abstract domain for lattice-valued regular expressions

DOI10.1007/978-3-662-53413-7_17zbMATH Open1394.68080OpenAlexW2515137674MaRDI QIDQ1664397FDOQ1664397

Authors: Jan Midtgaard, Flemming Nielson, Hanne Riis Nielson 

Publication date: 27 August 2018

Full work available at URL: https://backend.orbit.dtu.dk/ws/files/126417522/paper_33.pdf

Recommendations

• Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification
• Logic Programming
• scientific article; zbMATH DE number 1738295
• Regular model checking using widening techniques
• An abstract domain to infer symbolic ranges over nonnegative parameters

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cited In (2)

• Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification
• Twinning automata and regular expressions for string static analysis

This page was built for publication: A parametric abstract domain for lattice-valued regular expressions

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