-
2
-
-
0030679983
-
Symbolic timing verification of timing diagrams using Presburger formulas
-
T. Amon, G. Borriello, T. Hu, and J. Liu, "Symbolic Timing Verification of Timing Diagrams Using Presburger Formulas," DAC, pp 226-231, 1997.
-
(1997)
DAC
, pp. 226-231
-
-
Amon, T.1
Borriello, G.2
Hu, T.3
Liu, J.4
-
3
-
-
26444439127
-
-
ARIO SMT Solver, http://www.eecs.umich.edu/~ario
-
ARIO SMT Solver
-
-
-
4
-
-
0037797733
-
A SAT-based approach for solving formulas over Boolean and linear mathematical propositions
-
G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowics, and R. Sebastiani, "A SAT-Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions," CADE, pp. 193-208, 2002.
-
(2002)
CADE
, pp. 193-208
-
-
Audemard, G.1
Bertoli, P.2
Cimatti, A.3
Kornilowics, A.4
Sebastiani, R.5
-
5
-
-
84957633777
-
Validity checking for combinations of theories with equality
-
C. Barrett, D. Dill, and J. Levitt, "Validity Checking for Combinations of Theories with Equality," FMCAD, LNCS 1166, pp. 187-201, 1996
-
(1996)
FMCAD, LNCS
, vol.1166
, pp. 187-201
-
-
Barrett, C.1
Dill, D.2
Levitt, J.3
-
6
-
-
24644470145
-
An incremental and layered procedure for the satisfiability of linear arithmetic logic
-
M. Bozzano, R. Bruttomesso, A. Cimatti, T.A. Junttila, P. van Rossum, S. Schulz, and R. Sebastiani, "An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic," TACAS, pp 317-333, 2005.
-
(2005)
TACAS
, pp. 317-333
-
-
Bozzano, M.1
Bruttomesso, R.2
Cimatti, A.3
Junttila, T.A.4
Van Rossum, P.5
Schulz, S.6
Sebastiani, R.7
-
7
-
-
84962325965
-
RTL-datapath verification using integer linear programming
-
R. Brinkmann and R. Drechsler, "RTL-datapath Verification Using Integer Linear Programming," VLSI Design, pp 741-746, 2002
-
(2002)
VLSI Design
, pp. 741-746
-
-
Brinkmann, R.1
Drechsler, R.2
-
9
-
-
0000971541
-
Edmonds polytopes and a hierarchy of combinatorial problems
-
V. Chvátal, "Edmonds polytopes and a hierarchy of combinatorial problems," Discrete Math. vol. 4 pp. 305-337, 1973.
-
(1973)
Discrete Math.
, vol.4
, pp. 305-337
-
-
Chvátal, V.1
-
10
-
-
26444580250
-
-
Dash Inc., XPRESS-MP 15.25.03, http://www.dashoptimization.com.
-
XPRESS-MP 15.25.03
-
-
-
11
-
-
1442341246
-
Simplify: A theorem prover for program checking
-
HP Labs
-
D.L. Detlefs, G. Nelson, and J.B. Saxe, "Simplify: A Theorem Prover for Program Checking," Tech Report HPL-2003-148, HP Labs, 2003.
-
(2003)
Tech Report
, vol.HPL-2003-148
-
-
Detlefs, D.L.1
Nelson, G.2
Saxe, J.B.3
-
12
-
-
30344450270
-
An extensible SAT-solver
-
N. Eén and N. Sörensson, "An Extensible SAT-solver," SAT, pp. 502-508, 2003.
-
(2003)
SAT
, pp. 502-508
-
-
Eén, N.1
Sörensson, N.2
-
13
-
-
84958751994
-
ICS: Integrated canonizer and solver
-
J.C. Filliatre, S. Owre, H. Rueß and N. Shankar, "ICS: Integrated Canonizer and Solver," CAV, pp. 246-249, 2001.
-
(2001)
CAV
, pp. 246-249
-
-
Filliatre, J.C.1
Owre, S.2
Rueß, H.3
Shankar, N.4
-
14
-
-
26944470937
-
Automatic discovery of API-level exploits
-
V. Ganapathy, S.A. Seshia, S. Jha, T.W. Reps, R.E. Bryant, "Automatic Discovery of API-Level Exploits," ICSE, 2005
-
(2005)
ICSE
-
-
Ganapathy, V.1
Seshia, S.A.2
Jha, S.3
Reps, T.W.4
Bryant, R.E.5
-
15
-
-
23044532366
-
Deciding presburger arithmetic by model checking and comparisons with other methods
-
V. Ganesh, S. Berezin, and D.L. Dill, "Deciding Presburger Arithmetic by Model Checking and Comparisons with Other Methods," FMCAD, pp. 171-186, 2002.
-
(2002)
FMCAD
, pp. 171-186
-
-
Ganesh, V.1
Berezin, S.2
Dill, D.L.3
-
16
-
-
35048870724
-
DPLL(T): Fast decision procedures
-
H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli, "DPLL(T): Fast Decision Procedures," CAV, pp. 175-188, 2004.
-
(2004)
CAV
, pp. 175-188
-
-
Ganzinger, H.1
Hagen, G.2
Nieuwenhuis, R.3
Oliveras, A.4
Tinelli, C.5
-
17
-
-
26444541907
-
-
ILOG CPLEX, http://www.ilog.com/products/cplex.
-
-
-
-
18
-
-
26444463842
-
Efficient conflict-based learning in an RTL circuit constraint solver
-
M.K. Iyer, G. Parthasarathy and K.-T. Cheng, "Efficient Conflict-Based Learning in an RTL Circuit Constraint Solver," DATE, pp 666-671, 2005.
-
(2005)
DATE
, pp. 666-671
-
-
Iyer, M.K.1
Parthasarathy, G.2
Cheng, K.-T.3
-
19
-
-
0009406381
-
Beyond finite domains
-
J. Jaffar, M. Maher, P. Suckey, and R. Yap, "Beyond Finite Domains," Workshop on Principles and Practice of Constraint Programming, 1994.
-
(1994)
Workshop on Principles and Practice of Constraint Programming
-
-
Jaffar, J.1
Maher, M.2
Suckey, P.3
Yap, R.4
-
20
-
-
35048844329
-
Abstraction-based satisfiability solving of Presburger arithmetic
-
D. Kroening, J. Ouaknine, S. Seshia, and O. Strichman, "Abstraction-based Satisfiability Solving of Presburger Arithmetic," CAV, pp.308-320, 2004
-
(2004)
CAV
, pp. 308-320
-
-
Kroening, D.1
Ouaknine, J.2
Seshia, S.3
Strichman, O.4
-
21
-
-
0032680865
-
GRASP: A search algorithm for propositional satisfiability
-
J. P. Marques-Silva and K. A. Sakallah, "GRASP: A Search Algorithm for Propositional Satisfiability," IEEE Trans. on Computers, vol. 48(5), pp. 506-521, 1999.
-
(1999)
IEEE Trans. on Computers
, vol.48
, Issue.5
, pp. 506-521
-
-
Marques-Silva, J.P.1
Sakallah, K.A.2
-
22
-
-
0034852165
-
Chaff: Engineering an efficient SAT solver
-
M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an Efficient SAT Solver," DAC, pp. 530-535, 2001.
-
(2001)
DAC
, pp. 530-535
-
-
Moskewicz, M.1
Madigan, C.2
Zhao, Y.3
Zhang, L.4
Malik, S.5
-
23
-
-
35048865999
-
An experimental evaluation of ground decision procedures
-
L. de Moura and H. Rueß, "An Experimental Evaluation of Ground Decision Procedures," CAV pp. 162-174, 2004.
-
(2004)
CAV
, pp. 162-174
-
-
De Moura, L.1
Rueß, H.2
-
25
-
-
0002217486
-
Uber die Vollstandigkeit eines Gewissen Systems der Arithmetik Ganzer Zahlen, in Welchem die Addition als Einzige Operation Hervortritt
-
M. Presburger, "Uber die Vollstandigkeit eines Gewissen Systems der Arithmetik Ganzer Zahlen, in Welchem die Addition als Einzige Operation Hervortritt," Comptes-rendus du premier congres des mathematiciens des pays slaves, 395: pp 92-101, 1929.
-
(1929)
Comptes-rendus du Premier Congres des Mathematiciens des Pays Slaves
, vol.395
, pp. 92-101
-
-
Presburger, M.1
-
26
-
-
0026278958
-
The omega test: A fast and practical integer programming algorithm for dependence analysis
-
W. Pugh, "The Omega Test: A Fast and Practical Integer Programming Algorithm for Dependence Analysis," ACM conf. on Supercomputing, pp. 4-13, 1991.
-
(1991)
ACM Conf. on Supercomputing
, pp. 4-13
-
-
Pugh, W.1
-
27
-
-
9444232903
-
Solving linear arithmetic constraints
-
January
-
H. Rueß, and N. Shankar, "Solving Linear Arithmetic Constraints," SRI International Tech Report CSL-SRI-04-01, January 2004.
-
(2004)
SRI International Tech Report
, vol.CSL-SRI-04-01
-
-
Rueß, H.1
Shankar, N.2
-
28
-
-
4544294526
-
Deciding quantifier-free Presburger formulas using parameterized solution bounds
-
S. Seshia and R. Bryant, "Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds," LICS, pp. 100-109, 2004.
-
(2004)
LICS
, pp. 100-109
-
-
Seshia, S.1
Bryant, R.2
-
29
-
-
0021125949
-
Deciding combination of theories
-
R. Shostak, "Deciding Combination of Theories," Journal of the ACM vol. 31 pp. 1-12, 1984.
-
(1984)
Journal of the ACM
, vol.31
, pp. 1-12
-
-
Shostak, R.1
-
30
-
-
0019621772
-
Deciding linear inequalities by computing loop residues
-
R. Shostak, "Deciding Linear Inequalities by Computing Loop Residues," Journal of the ACM, vol. 28(4) pp. 769-779, 1981.
-
(1981)
Journal of the ACM
, vol.28
, Issue.4
, pp. 769-779
-
-
Shostak, R.1
-
31
-
-
84937568788
-
Deciding separation formulas with SAT
-
O. Strichman, S.A. Seshia, and R.E. Bryant " Deciding Separation Formulas with SAT", CAV, pp 209-222, 2002.
-
(2002)
CAV
, pp. 209-222
-
-
Strichman, O.1
Seshia, S.A.2
Bryant, R.E.3
-
32
-
-
0002946830
-
A first step towards detection of buffer overrun vulnerabilities
-
Internet Society
-
D. Wagner, J. S. Foster, E. A. Brewer, and A. Aiken, "A First Step Towards Detection of Buffer Overrun Vulnerabilities," Network and Distributed System Security Symposium, Internet Society, 2000.
-
(2000)
Network and Distributed System Security Symposium
-
-
Wagner, D.1
Foster, J.S.2
Brewer, E.A.3
Aiken, A.4
-
33
-
-
0025238253
-
Compact normal forms in prepositional logic and integer programming formulations
-
J.M. Wilson, "Compact Normal Forms in Prepositional Logic and Integer Programming Formulations," Computers and Operation Research, pp. 309-314, 1990.
-
(1990)
Computers and Operation Research
, pp. 309-314
-
-
Wilson, J.M.1
|