Inferring Congruence Equations Using SAT

DOI10.1007/978-3-540-70545-1_26zbMath1155.68441OpenAlexW1824807610WikidataQ57665014 ScholiaQ57665014MaRDI QIDQ3512500

Harald Søndergaard, Andy King

Publication date: 15 July 2008

Published in: Computer Aided Verification (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Application of static analyses for state-space reduction to the microcontroller binary code ⋮ Inferring Congruence Equations Using SAT ⋮ Abstract interpretation of microcontroller code: intervals meet congruences

Cites Work

• A structure-preserving clause form translation
• Affine relationships among variables of a program
• Discovering affine equalities using random interpretation
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
• Inferring Congruence Equations Using SAT
• Grids: A Domain for Analyzing the Distribution of Numerical Values
• Static analysis of arithmetical congruences
• Tools and Algorithms for the Construction and Analysis of Systems
• Programming Languages and Systems
• Automated Technology for Verification and Analysis
• Automata, Languages and Programming
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: Inferring Congruence Equations Using SAT