On the SUP-INF Method for Proving Presburger Formulas

DOI10.1145/322033.322034zbMATH Open0423.68052OpenAlexW1996325171MaRDI QIDQ3857732FDOQ3857732

Authors: Robert E. Shostak 

Publication date: 1977

Published in: Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

Presburger arithmetic

Mathematics Subject Classification ID

Linear programming (90C05)

Cited In (13)

• Symbolic model checking of timed guarded commands using difference decision diagrams
• Conditional rewrite rule systems with built-in arithmetic and induction
• SLAP: specification logic of actions with probability
• A structure-preserving clause form translation
• A multi-level geometric reasoning system for vision
• From LP to LP: Programming with constraints
• Problem-oriented program verification system ?SPEKTR?
• The complexity of almost linear diophantine problems
• The two variable per inequality abstract domain
• A typed \(\lambda\)-calculus for proving-by-example and bottom-up generalization procedure
• A canonical form for generalized linear constraints
• Problem-oriented verification system and its application to linear algebra programs
• Symbolic reasoning among 3-D models and 2-D images

This page was built for publication: On the SUP-INF Method for Proving Presburger Formulas

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