Programming Languages and Systems

DOI10.1007/B107380MaRDI QIDQ5316583zbMATH OpenOpenAlexFDO

Authors Markus Müller-Olm, Helmut Seidl

Publication date 13 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b107380

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• On the Satisfiability of Modular Arithmetic Formulae
• Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$
• Static analysis of arithmetical congruences
• Solving difference constraints over modular arithmetic
• Satisfiability modulo linear arithmetic over a finite ring

Cited in

(14)

• Analysis of iterated modular exponentiation: The orbits of \(x^\alpha \mod N\)
• A new abstraction framework for affine transformers
• A layered algorithm for quantifier elimination from linear modular constraints
• Abstract interpretation of microcontroller code: intervals meet congruences
• The complete system of residues theory for the remainder operator of C language
• Inferring Congruence Equations Using SAT
• Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$
• On the Satisfiability of Modular Arithmetic Formulae
• scientific article; zbMATH DE number 1975594 (Why is no real title available?)
• Mind the gap: bit-vector interpolation recast over linear integer arithmetic
• Program Analysis Using Weighted Pushdown Systems
• Lifting numeric relational domains to algebraic data types
• Solving polynomial systems over non-fields and applications to modular polynomial factoring
• Verification of qualitative \(\mathbb Z\) constraints

This page was built for publication: Programming Languages and Systems

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