Discovering affine equalities using random interpretation

DOI10.1145/604131.604138zbMath1321.68490OpenAlexW2151759383MaRDI QIDQ2942914

George C. Necula, Sumit Gulwani

Publication date: 11 September 2015

Published in: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/604131.604138

zbMATH Keywords

randomized algorithmlinear equalitiesaffine relationshipsrandom interpretation

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Randomized algorithms (68W20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (5)

Inferring Congruence Equations Using SAT ⋮ Discovering invariants via simple component analysis ⋮ From invariant checking to invariant inference using randomized search ⋮ A randomized satisfiability procedure for arithmetic and uninterpreted function symbols ⋮ Relational bytecode correlations

Uses Software

• TREX

Cites Work

• Regular expression pattern matching for XML
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Discovering affine equalities using random interpretation