-
1
-
-
34547366652
-
MiniSat: A SAT solver with conflict-clause minimization
-
Bacchus, F., Walsh, T. (eds.) SAT 2005. Springer, Heidelberg
-
Een, N., Sorensson, N.: MiniSat: A SAT solver with conflict-clause minimization. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, Springer, Heidelberg (2005)
-
(2005)
LNCS
, vol.3569
-
-
Een, N.1
Sorensson, N.2
-
2
-
-
76649112158
-
RID-GRASP: Redundancy identification and removal using GRASP
-
Kim, J., Silva, J., Savoj, H., Sakallah, K.: RID-GRASP: Redundancy identification and removal using GRASP. In: International Workshop on Logic Synthesis (1997)
-
(1997)
International Workshop on Logic Synthesis
-
-
Kim, J.1
Silva, J.2
Savoj, H.3
Sakallah, K.4
-
3
-
-
0034852165
-
Chaff: Engineering an Efficient SAT Solver
-
ACM, New York
-
Malik, S., Zhao, Y., Madigan, C., Zhang, L., Moskewicz, M.: Chaff: Engineering an Efficient SAT Solver. In: DAC, pp. 530-535. ACM, New York (2001)
-
(2001)
DAC
, pp. 530-535
-
-
Malik, S.1
Zhao, Y.2
Madigan, C.3
Zhang, L.4
Moskewicz, M.5
-
4
-
-
45749085681
-
Z3: An Efficient SMT Solver
-
Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. Springer, Heidelberg
-
De Moura, L., Bjørner, N.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
-
(2008)
LNCS
, vol.4963
, pp. 337-340
-
-
De Moura, L.1
Bjørner, N.2
-
6
-
-
48949100787
-
The Math-SAT 4 SMT Solver
-
Gupta, A., Malik, S. (eds.) CAV 2008. Springer, Heidelberg
-
Bruttomesso, R., Cimatti, A., Franzén, A., Griggio, A., Sebastiani, R.: The Math-SAT 4 SMT Solver. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 299-303. Springer, Heidelberg (2008)
-
(2008)
LNCS
, vol.5123
, pp. 299-303
-
-
Bruttomesso, R.1
Cimatti, A.2
Franzén, A.3
Griggio, A.4
Sebastiani, R.5
-
7
-
-
38149123956
-
CVC3
-
Damm, W., Hermanns, H. (eds.) CAV 2007. Springer, Heidelberg
-
Barrett, C., Tinelli, C.: CVC3. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 298-302. Springer, Heidelberg (2007)
-
(2007)
LNCS
, vol.4590
, pp. 298-302
-
-
Barrett, C.1
Tinelli, C.2
-
8
-
-
48949090405
-
The Barcelogic SMT Solver
-
Gupta, A., Malik, S. (eds.) CAV 2008. Springer, Heidelberg
-
Bofill, M., Nieuwenhuis, R., Oliveras, A., Rodriguez-Carbonell, E., Rubio, A.: The Barcelogic SMT Solver. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, p. 294. Springer, Heidelberg (2008)
-
(2008)
LNCS
, vol.5123
, pp. 294
-
-
Bofill, M.1
Nieuwenhuis, R.2
Oliveras, A.3
Rodriguez-Carbonell, E.4
Rubio, A.5
-
9
-
-
4243189286
-
Counterexample-guided abstraction refinement for symbolic model checking
-
Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. JACM 50(5), 752-794 (2003)
-
(2003)
JACM
, vol.50
, Issue.5
, pp. 752-794
-
-
Clarke, E.1
Grumberg, O.2
Jha, S.3
Lu, Y.4
Veith, H.5
-
10
-
-
0036041563
-
Lazy abstraction
-
ACM, New York
-
Henzinger, T., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: POPL, pp. 58-70. ACM, New York (2002)
-
(2002)
POPL
, pp. 58-70
-
-
Henzinger, T.1
Jhala, R.2
Majumdar, R.3
Sutre, G.4
-
11
-
-
0036039066
-
The SLAM project: Debugging system software via static analysis
-
NY, USA
-
Ball, T., Rajamani, S.: The SLAM project: debugging system software via static analysis. In: POPL, NY, USA, pp.1-3 (2002)
-
(2002)
POPL
, pp. 1-3
-
-
Ball, T.1
Rajamani, S.2
-
12
-
-
0036040604
-
ESP: Path-sensitive program verification in polynomial time
-
Das, M., Lerner, S., Seigle, M.: ESP: Path-sensitive program verification in polynomial time. ACM SIGPLAN Notices 37(5), 57-68 (2002)
-
(2002)
ACM SIGPLAN Notices
, vol.37
, Issue.5
, pp. 57-68
-
-
Das, M.1
Lerner, S.2
Seigle, M.3
-
13
-
-
17044371129
-
Scalable error detection using boolean satisfiability
-
ACM, New York
-
Xie, Y., Aiken, A.: Scalable error detection using boolean satisfiability. In: POPL, vol. 40, pp. 351-363. ACM, New York (2005)
-
(2005)
POPL
, vol.40
, pp. 351-363
-
-
Xie, Y.1
Aiken, A.2
-
15
-
-
84947935855
-
Fundamentals of Contex-Sensitive Rewriting
-
Springer, Heidelberg
-
Lucas, S.: Fundamentals of Contex-Sensitive Rewriting. LNCS, pp. 405-412. Springer, Heidelberg (1995)
-
(1995)
LNCS
, pp. 405-412
-
-
Lucas, S.1
-
17
-
-
33847102258
-
Solving SAT and SAT Modulo Theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL (T)
-
Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL (T). Journal of the ACM (JACM) 53(6), 977 (2006)
-
(2006)
Journal of the ACM (JACM)
, vol.53
, Issue.6
, pp. 977
-
-
Nieuwenhuis, R.1
Oliveras, A.2
Tinelli, C.3
-
18
-
-
70350236911
-
Cuts from proofs: A complete and practical technique for solving linear inequalities over integers
-
Bouajjani, A., Maler, O. (eds.) CAV 2009. Springer, Heidelberg
-
Dillig, I., Dillig, T., Aiken, A.: Cuts from proofs: A complete and practical technique for solving linear inequalities over integers. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 233-247. Springer, Heidelberg (2009)
-
(2009)
LNCS
, vol.5643
, pp. 233-247
-
-
Dillig, I.1
Dillig, T.2
Aiken, A.3
-
19
-
-
85040939688
-
Fluid Updates: Beyond Strong vs. Weak Updates
-
Gordon, A.D. (ed.) ESOP 2010. Springer, Heidelberg
-
Dillig, I., Dillig, T., Aiken, A.: Fluid Updates: Beyond Strong vs. Weak Updates. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 246-266. Springer, Heidelberg (2010)
-
(2010)
LNCS
, vol.6012
, pp. 246-266
-
-
Dillig, I.1
Dillig, T.2
Aiken, A.3
-
20
-
-
56249143748
-
Calysto: Scalable and Precise Extended Static Checking
-
ACM, New York May
-
Babić, D., Hu, A.J.: Calysto: Scalable and Precise Extended Static Checking. In: ICSE, pp. 211-220. ACM, New York (May 2008)
-
(2008)
ICSE
, pp. 211-220
-
-
Babić, D.1
Hu, A.J.2
-
21
-
-
0031630370
-
Partial online cycle elimination in inclusion constraint graphs
-
ACM, New York
-
Faehndrich, M., Foster, J., Su, Z., Aiken, A.: Partial online cycle elimination in inclusion constraint graphs. In: PLDI, p. 96. ACM, New York (1998)
-
(1998)
PLDI
, pp. 96
-
-
Faehndrich, M.1
Foster, J.2
Su, Z.3
Aiken, A.4
-
22
-
-
33846545005
-
DAG-aware AIG rewriting: A fresh look at combinational logic synthesis
-
Mishchenko, A., Chatterjee, S., Brayton, R.: DAG-aware AIG rewriting: A fresh look at combinational logic synthesis. In: DAC, pp.532-535 (2006)
-
(2006)
DAC
, pp. 532-535
-
-
Mishchenko, A.1
Chatterjee, S.2
Brayton, R.3
-
23
-
-
50249108001
-
SAT-based logic optimization and resynthesis
-
Mishchenko, A., Brayton, R., Jiang, J., Jang, S.: SAT-based logic optimization and resynthesis. In: Proc. IWLS 2007, pp. 358-364 (2007)
-
(2007)
Proc. IWLS 2007
, pp. 358-364
-
-
Mishchenko, A.1
Brayton, R.2
Jiang, J.3
Jang, S.4
-
25
-
-
35048866057
-
Enhanced Vacuity Detection in Linear Temporal Logic
-
Computer Aided Verification
-
Armoni, R., Fix, L., Flaisher, A., Grumberg, O., Piterman, N., Tiemeyer, A., Vardi, M.: Enhanced vacuity detection in linear temporal logic. LNCS, pp. 368-380. Springer, Heidelberg (2003) (Pubitemid 36881638)
-
(2003)
LECTURE NOTES in COMPUTER SCIENCE
, Issue.2725
, pp. 368-380
-
-
Armoni, R.1
Fix, L.2
Flaisher, A.3
Grumberg, O.4
Piterman, N.5
Tiemeyer, A.6
Vardi, M.Y.7
-
26
-
-
0026913667
-
Symbolic Boolean manipulation with ordered binary-decision diagrams
-
Bryant, R.: Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys (CSUR) 24(3), 293-318 (1992)
-
(1992)
ACM Computing Surveys (CSUR)
, vol.24
, Issue.3
, pp. 293-318
-
-
Bryant, R.1
-
28
-
-
78149263339
-
Hybrid decision diagrams overcoming the limitations of MTBDDs and BMDs
-
Clarke, E., Fujita, M., Zhao, X.: Hybrid decision diagrams overcoming the limitations of MTBDDs and BMDs. In: ICCAD (1995)
-
(1995)
ICCAD
-
-
Clarke, E.1
Fujita, M.2
Zhao, X.3
-
30
-
-
78149259674
-
Simplifying interpreted formulas
-
Springer, Heidelberg
-
Loveland, D., Shostak, R.: Simplifying interpreted formulas. In: Proc. 5th Conf. on Automated Deduction (CADE), vol. 87, pp. 97-109. Springer, Heidelberg (1987)
-
(1987)
Proc. 5th Conf. on Automated Deduction (CADE)
, vol.87
, pp. 97-109
-
-
Loveland, D.1
Shostak, R.2
-
31
-
-
38149088089
-
A decision procedure for bit-vectors and arrays
-
Damm, W., Hermanns, H. (eds.) CAV 2007. Springer, Heidelberg
-
Ganesh, V., Dill, D.: A decision procedure for bit-vectors and arrays. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, p. 519. Springer, Heidelberg (2007)
-
(2007)
LNCS
, vol.4590
, pp. 519
-
-
Ganesh, V.1
Dill, D.2
-
32
-
-
70350246119
-
Beaver: Engineering an Efficient SMT Solver for Bit-Vector Arithmetic
-
Bouajjani, A., Maler, O. (eds.) CAV 2009. Springer, Heidelberg
-
Jha, S., Limaye, R., Seshia, S.: Beaver: Engineering an Efficient SMT Solver for Bit-Vector Arithmetic. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 668-674. Springer, Heidelberg (2009)
-
(2009)
LNCS
, vol.5643
, pp. 668-674
-
-
Jha, S.1
Limaye, R.2
Seshia, S.3
-
33
-
-
67650812037
-
Snugglebug: A powerful approach to weakest preconditions
-
Chandra, S., Fink, S.J., Sridharan, M.: Snugglebug: a powerful approach to weakest preconditions. SIGPLAN Not. 44(6), 363-374 (2009)
-
(2009)
SIGPLAN Not.
, vol.44
, Issue.6
, pp. 363-374
-
-
Chandra, S.1
Fink, S.J.2
Sridharan, M.3
-
34
-
-
0039616218
-
Effectiveness of Optimizing Compilation for CLP (R)
-
The MIT Press, Cambridge
-
Kelly, A., Marriott, A., Stuckey, P., Yap, R.: Effectiveness of Optimizing Compilation for CLP (R). In: Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming, p. 37. The MIT Press, Cambridge (1996)
-
(1996)
Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming
, pp. 37
-
-
Kelly, A.1
Marriott, A.2
Stuckey, P.3
Yap, R.4
|