Foundations of Software Science and Computational Structures

DOI10.1007/B106850MaRDI QIDQ5705902zbMATH OpenOpenAlexFDO

Authors Marius Bozga, Radu Iosif

Publication date 10 November 2005

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

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

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Quantifier elimination, model completeness, and related topics (03C10) First-order arithmetic and fragments (03F30)

Recommendations

• On the complexity of linear arithmetic with divisibility
• Arithmetic of divisibility in finite models
• The Diophantine problem for addition and divisibility over subrings of the rationals
• scientific article; zbMATH DE number 8420
• Complexity of Subcases of Presburger Arithmetic

Cited in

(8)

• Automated verification of functional correctness of race-free GPU programs
• Compositional satisfiability solving in separation logic
• A proof of Bel'tyukov-Lipshitz theorem by quasi-quantifier elimination. II: The main reduction
• Arithmetic of divisibility in finite models
• On the complexity of linear arithmetic with divisibility
• Programs with lists are counter automata
• Positive existential Definability with unit, addition and coprimeness
• Deciding Boolean algebra with Presburger arithmetic

This page was built for publication: Foundations of Software Science and Computational Structures

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