Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,065,670 papers from all fields of science
Search
Sign In
Create Free Account
Presburger arithmetic
Known as:
Presberger arithmetic
, Pressburger arithmetic
Presburger arithmetic is the first-order theory of the natural numbers with addition, named in honor of Mojżesz Presburger, who introduced it in 1929…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
27 relations
Algorithm
Analysis of algorithms
Automated reasoning
Automated theorem proving
Expand
Broader (1)
Logic in computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Program Verification via Craig Interpolation for Presburger Arithmetic with Arrays
Angelo Brillout
,
D. Kroening
,
Philipp Rümmer
,
T. Wahl
VERIFY@IJCAR
2012
Corpus ID: 3031494
Craig interpolation has become a versatile tool in formal verification, in particular for generating intermediate assertions in…
Expand
2011
2011
A General Logic-Based Authorization Model
W. Cook
,
V. Marek
2011
Corpus ID: 18362422
The system-security literature contains numerous papers on authorization which are written according to the following scheme. The…
Expand
2008
2008
A Characterisation of the Relations Definable in Presburger Arithmetic
Mathias Barra
Theory and Applications of Models of Computation
2008
Corpus ID: 36476245
Four sub-recursive classes of functions, B, D, BD and BDD are defined, and compared to the classes G0, G1 and G2, originally…
Expand
2007
2007
Generic Complexity of Presburger Arithmetic
A. Rybalov
Theory of Computing Systems
2007
Corpus ID: 30862417
Fischer and Rabin proved in (Proceedings of the SIAM-AMS Symposium in Applied Mathematics, vol. 7, pp. 27–41, 1974) that the…
Expand
Highly Cited
2005
Highly Cited
2005
LusSy: a toolbox for the analysis of systems-on-a-chip at the transactional level
M. Moy
,
F. Maraninchi
,
L. Maillet-Contoz
International Conference on Application of…
2005
Corpus ID: 2457667
We describe a toolbox for the analysis of systems-on-a-chip described in SystemC at the transactional level. The tools are able…
Expand
2004
2004
Generic proof synthesis for presburger arithmetic-draft
T. Nipkow
,
Amine Chaieb
2004
Corpus ID: 16673652
We develop in complete detail an extension of Cooper’s decision procedure for Presburger arithmetic that returns a proof of the…
Expand
2004
2004
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
P. Revesz
Symposium on Advances in Databases and…
2004
Corpus ID: 1571359
We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier…
Expand
2003
2003
Generic Proof Synthesis for Presburger Arithmetic
Amine Chaieb
,
T. Nipkow
2003
Corpus ID: 14754658
We develop in detail a proof-producing implementation of Cooper’s decision procedure for Presburger arithmetic. The algorithm is…
Expand
1984
1984
The Experience of Science
M. Goldstein
,
I. Goldstein
Springer US
1984
Corpus ID: 37280397
ing the general features that matter from the messy details that do not, and then solving the problem simply and once and for all…
Expand
1961
1961
Algorithm 66: Invrs
A. Gibb
CACM
1961
Corpus ID: 52328988
b e g i n p r o c e d u r e RANGESUM (a, b, c, d, e, f); rea l a , b , c , d , e , f ; c o m m e n t The term "range number" was…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE