On Bounded Reachability of Programs with Set Comprehensions

DOI10.1007/978-3-540-89439-1_22zbMath1182.68048OpenAlexW2146072020MaRDI QIDQ5505562

Ando Saabas, Margus Veanes

Publication date: 27 January 2009

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89439-1_22

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Automated reasoning with restricted intensional sets ⋮ Composing model programs for analysis

Uses Software

• z3
• Boogie
• AsmL
• NModel

This page was built for publication: On Bounded Reachability of Programs with Set Comprehensions