Discovering affine equalities using random interpretation

DOI10.1145/604131.604138MaRDI QIDQ2942914zbMATH OpenOpenAlexFDO

Authors Sumit Gulwani, George C. Necula

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

affine relationshipslinear equalitiesrandom interpretationrandomized algorithm

Mathematics Subject Classification ID

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

Recommendations

• An improved affine equivalence algorithm for random permutations
• Recovering or Testing Extended-Affine Equivalence
• Discovery of statistical equivalence classes using computer algebra
• An abstract domain to discover interval linear equalities
• Detecting affine equivalences between implicit planar algebraic curves
• Exploiting equalities in polynomial programming
• scientific article; zbMATH DE number 5372380
• Approximating sets with equivalence relations
• On the cost of generating an equivalence relation
• Equality in computer algebra and beyond.

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 615137 (Why is no real title available?)
• scientific article; zbMATH DE number 1942450 (Why is no real title available?)
• scientific article; zbMATH DE number 1948151 (Why is no real title available?)
• scientific article; zbMATH DE number 1953123 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Regular expression pattern matching for XML
• Types and programing languages

Cited in

(10)

• A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
• Global value numbering using random interpretation
• Inferring Congruence Equations Using SAT
• Discovering invariants via simple component analysis
• From invariant checking to invariant inference using randomized search
• Precise interprocedural analysis using random interpretation
• Automata, Languages and Programming
• Computer Aided Verification
• On strongest algebraic program invariants
• Relational bytecode correlations

Describes a project that uses

Uses Software

• TREX

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

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