Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
linear arithmetic
Description:
Linear arithmetic is the study and formal reasoning of equations and inequalities involving linear expressions over numbers.
Primary topic:
Formal Methods in Verification (37%)
Related topics:
Formal Methods in Verification (37%),
Logic, programming, and type systems (30%)
OpenAlex ID:
keywords/linear-arithmetic
Decision Procedures: An Algorithmic Point of View
2008
·
Daniel Kroening
, Ofer Strichman
·
394
PDF
CVC Lite: A New Implementation of the Cooperating Validity Checker
2004
·
Clark Barrett
, Sergey Berezin
·
Lecture notes in computer science
·
299
PDF
The MathSAT 4 SMT Solver
2008
·
Roberto Bruttomesso
, Alessandro Cimatti
, et al.
·
Lecture notes in computer science
·
248
SMT-Based Model Checking for Recursive Programs
2014
·
Anvesh Komuravelli
, Arie Gurfinkel
, et al.
·
Lecture notes in computer science
·
209
PDF
Decision Procedures
2016
·
Daniel Kroening
, Ofer Strichman
·
Texts in theoretical computer science
·
196
Parametric Identification of Temporal Properties
2012
·
Eugene Asarin
, Alexandre Donzé
, et al.
·
Lecture notes in computer science
·
194
SMTInterpol: An Interpolating SMT Solver
2012
·
Jürgen Christ
, Jochen Hoenicke
, et al.
·
Lecture notes in computer science
·
194
Validity checking for combinations of theories with equality
1996
·
Clark Barrett
, David Dill
, et al.
·
Lecture notes in computer science
·
189
SMT-based model checking for recursive programs
2016
·
Anvesh Komuravelli
, Arie Gurfinkel
, et al.
·
Formal Methods in System Design
·
185
PDF
Complete functional synthesis
2010
·
Viktor Kuncak
, Mikaël Mayer
, et al.
·
ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
·
163
PDF
Mona Implementation Secrets
2002
·
NILS KLARLUND
, ANDERS MØLLER
, et al.
·
International Journal of Foundations of Computer Science
·
163
Automating Separation Logic Using SMT
2013
·
Ruzica Piskac
, Thomas Wies
, et al.
·
Lecture notes in computer science
·
150
Integrating decision procedures into heuristic theorem provers: a case study of linear arithmetic
1988
·
R. S. Boyer
, J. Strother Moore
·
Machine intelligence
·
149
Parameterized Logarithmic Framework for Image Enhancement
2010
·
K Panetta
, S Agaian
, et al.
·
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)
·
148
Theorem Proving Using Lazy Proof Explication
2003
·
Cormac Flanagan
, Rajeev Joshi
, et al.
·
Lecture notes in computer science
·
131
Invariant Synthesis for Combined Theories
2007
·
Dirk Beyer
, Thomas A. Henzinger
, et al.
·
Lecture notes in computer science
·
130
Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs
2017
·
Sheshansh Agrawal
, Krishnendu Chatterjee
, et al.
·
Proceedings of the ACM on Programming Languages
·
114
PDF
The Power of Symbolic Automata and Transducers
2017
·
Loris D’Antoni
, Margus Veanes
·
Lecture notes in computer science
·
111
Constraint Solving for Interpolation
2007
·
Andrey Rybalchenko
, Viorica Sofronie-Stokkermans
·
Springer eBooks
·
99
Optimization Modulo Theories with Linear Rational Costs
2015
·
Roberto Sebastiani
, Silvia Tomasi
·
ACM Transactions on Computational Logic
·
91
PDF
Learning Symbolic Automata
2017
·
Samuel Drews
, Loris D’Antoni
·
Lecture notes in computer science
·
89
An effective decision procedure for linear arithmetic over the integers and reals
2005
·
Bernard Boigelot
, Sébastien Jodogne
, et al.
·
ACM Transactions on Computational Logic
·
87
PDF
Fast and Flexible Difference Constraint Propagation for DPLL(T)
2006
·
Scott Cotton
, Oded Maler
·
Lecture notes in computer science
·
85
Calculating Sized Types
2001
·
Wei-Ngan Chin
, Siau-Cheng Khoo
·
LISP and Symbolic Computation
·
83
Efficient generation of craig interpolants in satisfiability modulo theories
2010
·
Alessandro Cimatti
, Alberto Griggio
, et al.
·
ACM Transactions on Computational Logic
·
79
PDF
Show more works
View as search
Works count:
390
Citation count:
7,699
Year
Topic
Type