Definability of Accelerated Relations in a Theory of Arrays and Its Applications

DOI10.1007/978-3-642-40885-4_3zbMath1397.68121arXiv1304.4499OpenAlexW3099434706MaRDI QIDQ2849479

Francesco Alberti, Silvio Ghilardi, Natasha Sharygina

Publication date: 20 September 2013

Published in: Frontiers of Combining Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.4499

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (5)

Decision procedures for flat array properties ⋮ Symbol elimination and applications to parametric entailment problems ⋮ Algebraic program analysis ⋮ A New Acceleration-Based Combination Framework for Array Properties ⋮ An array content static analysis based on non-contiguous partitions

Uses Software

• SMT-LIB
• Mcmt

This page was built for publication: Definability of Accelerated Relations in a Theory of Arrays and Its Applications