-
1
-
-
75749147262
-
A few billion lines of code later: Using static analysis to find bugs in the real world
-
Bessey, A., Block, K., Chelf, B., Chou, A., Fulton, B., Hallem, S., Henri-Gros, C., Kamsky, A., McPeak, S., Engler, D.: A few billion lines of code later: using static analysis to find bugs in the real world. Communications of the ACM 53(2) (2010) 66-75.
-
(2010)
Communications of the ACM
, vol.53
, Issue.2
, pp. 66-75
-
-
Bessey, A.1
Block, K.2
Chelf, B.3
Chou, A.4
Fulton, B.5
Hallem, S.6
Henri-Gros, C.7
Kamsky, A.8
McPeak, S.9
Engler, D.10
-
3
-
-
84863436035
-
Minimum satisfying assignments for SMT
-
Dillig, I., Dillig, T., McMillan, K., Aiken, A.: Minimum satisfying assignments for SMT. In: To appear in CAV. (2012).
-
(2012)
CAV
-
-
Dillig, I.1
Dillig, T.2
McMillan, K.3
Aiken, A.4
-
4
-
-
78149246462
-
Small formulas for large programs: Online constraint simplification in scalable static analysis
-
Dillig, I., Dillig, T., Aiken, A.: Small formulas for large programs: Online constraint simplification in scalable static analysis. Static Analysis Symposium (SAS) (2010) 236-252.
-
(2010)
Static Analysis Symposium (SAS)
, pp. 236-252
-
-
Dillig, I.1
Dillig, T.2
Aiken, A.3
-
5
-
-
85040939688
-
Fluid updates: Beyond strong vs. Weak updates
-
Dillig, I., Dillig, T., Aiken, A.: Fluid updates: Beyond strong vs. weak updates. ESOP (2010) 246-266.
-
(2010)
ESOP
, pp. 246-266
-
-
Dillig, I.1
Dillig, T.2
Aiken, A.3
-
6
-
-
79251570920
-
Precise reasoning for programs using containers
-
Dillig, I., Dillig, T., Aiken, A.: Precise reasoning for programs using containers. POPL (2011) 187-200.
-
(2011)
POPL
, pp. 187-200
-
-
Dillig, I.1
Dillig, T.2
Aiken, A.3
-
7
-
-
79959888753
-
Precise and compact modular procedure summaries for heap manipulating programs
-
Dillig, I., Dillig, T., Aiken, A., Sagiv, M.: Precise and compact modular procedure summaries for heap manipulating programs. In: PLDI. (2011) 567-577.
-
(2011)
PLDI
, pp. 567-577
-
-
Dillig, I.1
Dillig, T.2
Aiken, A.3
Sagiv, M.4
-
8
-
-
1442339050
-
From symptom to cause: Localizing errors in counterexample traces
-
Ball, T., Naik, M., Rajamani, S.: From symptom to cause: localizing errors in counterexample traces. POPL 38(1) (2003) 97-105.
-
(2003)
POPL
, vol.38
, Issue.1
, pp. 97-105
-
-
Ball, T.1
Naik, M.2
Rajamani, S.3
-
9
-
-
35048873252
-
Error explanation with distance metrics
-
Groce, A.: Error explanation with distance metrics. TACAS (2004) 108-122.
-
(2004)
TACAS
, pp. 108-122
-
-
Groce, A.1
-
10
-
-
79959907861
-
Cause clue clauses: Error localization using maximum satisfiability
-
ACM
-
Jose, M., Majumdar, R.: Cause clue clauses: error localization using maximum satisfiability. In: PLDI, ACM (2011) 437-446.
-
(2011)
PLDI
, pp. 437-446
-
-
Jose, M.1
Majumdar, R.2
-
11
-
-
34248655664
-
Automated fault localization for C programs
-
DOI 10.1016/j.entcs.2006.12.032, PII S1571066107001983, Proceedings of the Workshop on Verification and Debugging (V and D 2006)
-
Griesmayer, A., Staber, S., Bloem, R.: Automated fault localization for c programs. Theoretical Computer Science 174(4) (2007) 95-111. (Pubitemid 46777511)
-
(2007)
Electronic Notes in Theoretical Computer Science
, vol.174
, Issue.4
, pp. 95-111
-
-
Griesmayer, A.1
Staber, S.2
Bloem, R.3
-
12
-
-
84917687527
-
Fault localization with nearest neighbor queries
-
Renieres, M., Reiss, S.: Fault localization with nearest neighbor queries. In: ASE. (2003) 30-39.
-
(2003)
ASE
, pp. 30-39
-
-
Renieres, M.1
Reiss, S.2
-
13
-
-
35048820043
-
Minimal assignments for bounded model checking
-
Ravi, K., Somenzi, F.: Minimal assignments for bounded model checking. TACAS (2004) 31-45.
-
(2004)
TACAS
, pp. 31-45
-
-
Ravi, K.1
Somenzi, F.2
-
14
-
-
33846506004
-
Software verification with blast
-
Henzinger, T., Jhala, R., Majumdar, R., Sutre, G.: Software verification with blast. Model Checking Software (2003) 624-624.
-
(2003)
Model Checking Software
, pp. 624-624
-
-
Henzinger, T.1
Jhala, R.2
Majumdar, R.3
Sutre, G.4
-
16
-
-
2442623463
-
Abstractions from proofs
-
Henzinger, T., Jhala, R., Majumdar, R., McMillan, K.: Abstractions from proofs. POPL 39(1) (2004) 232-244.
-
(2004)
POPL
, vol.39
, Issue.1
, pp. 232-244
-
-
Henzinger, T.1
Jhala, R.2
Majumdar, R.3
McMillan, K.4
-
17
-
-
20344382538
-
PSE: Explaining program failures via postmortem static analysis
-
Twelfth ACM SIGSOFT International Symposium on the Foundations of Software Engineering, SIGSOFT 2004/FSE-12
-
Manevich, R., Sridharan, M., Adams, S., Das, M., Yang, Z.: PSE: explaining program failures via postmortem static analysis. In: FSE. Volume 29., ACM (2004) 63-72. (Pubitemid 40787568)
-
(2004)
Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering
, pp. 63-72
-
-
Manevich, R.1
Sridharan, M.2
Adams, S.3
Das, M.4
Yang, Z.5
-
18
-
-
78751503884
-
Path-based fault correlations
-
Le, W., Soffa, M.: Path-based fault correlations. In: FSE. (2010) 307- 316.
-
(2010)
FSE
, pp. 307-316
-
-
Le, W.1
Soffa, M.2
-
20
-
-
85050273691
-
Program slicing
-
IEEE Press
-
Weiser, M.: Program slicing. In: ICSE, IEEE Press (1981) 439-449.
-
(1981)
ICSE
, pp. 439-449
-
-
Weiser, M.1
-
22
-
-
35448962507
-
Thin slicing
-
DOI 10.1145/1250734.1250748, PLDI'07: Proceedings of the 2007 ACM SIGPLAN Conference on Programming Language Design and Implementation
-
Sridharan, M., Fink, S., Bodik, R.: Thin slicing. In: PLDI, ACM (2007) 112-122. (Pubitemid 47630680)
-
(2007)
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
, pp. 112-122
-
-
Sridharan, M.1
Fink, S.J.2
Bodik, R.3
-
23
-
-
0027565614
-
Explaining type errors in polymorphic languages
-
Beaven, M., Stansifer, R.: Explaining type errors in polymorphic languages. LOPLAS 2(1-4) (1993) 17-30.
-
(1993)
LOPLAS
, vol.2
, Issue.1-4
, pp. 17-30
-
-
Beaven, M.1
Stansifer, R.2
-
24
-
-
35248816847
-
Type error slicing in implicitly typed higher-order languages
-
Haack, C., Wells, J.: Type error slicing in implicitly typed higher-order languages. Programming Languages and Systems (2003) 284-301.
-
(2003)
Programming Languages and Systems
, pp. 284-301
-
-
Haack, C.1
Wells, J.2
-
25
-
-
0003067236
-
Explaining type errors by finding the source of a type conflict
-
Yang, J.: Explaining type errors by finding the source of a type conflict. Trends in Functional Programming (1999) 49-57.
-
(1999)
Trends in Functional Programming
, pp. 49-57
-
-
Yang, J.1
-
26
-
-
35449002838
-
Searching for type-error messages
-
DOI 10.1145/1250734.1250783, PLDI'07: Proceedings of the 2007 ACM SIGPLAN Conference on Programming Language Design and Implementation
-
Lerner, B., Flower, M., Grossman, D., Chambers, C.: Searching for type-error messages. In: PLDI, ACM (2007) 425-434. (Pubitemid 47630709)
-
(2007)
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
, pp. 425-434
-
-
Lerner, B.S.1
Flower, M.2
Grossman, D.3
Chambers, C.4
-
27
-
-
70349303139
-
The yogi project: Software property checking via static analysis and testing
-
Nori, A., Rajamani, S., Tetali, S., Thakur, A.: The yogi project: Software property checking via static analysis and testing. TACAS (2009) 178-181.
-
(2009)
TACAS
, pp. 178-181
-
-
Nori, A.1
Rajamani, S.2
Tetali, S.3
Thakur, A.4
-
28
-
-
77950894390
-
Compositional maymust program analysis: Unleashing the power of alternation
-
ACM
-
Godefroid, P., Nori, A., Rajamani, S., Tetali, S.: Compositional maymust program analysis: unleashing the power of alternation. In: POPL. Volume 45., ACM (2010) 43-56.
-
(2010)
POPL
, vol.45
, pp. 43-56
-
-
Godefroid, P.1
Nori, A.2
Rajamani, S.3
Tetali, S.4
-
29
-
-
34247330209
-
Testing, abstraction, theorem proving: Better together!
-
ACM
-
Yorsh, G., Ball, T., Sagiv, M.: Testing, abstraction, theorem proving: better together! In: ISSTA, ACM (2006) 145-156.
-
(2006)
ISSTA
, pp. 145-156
-
-
Yorsh, G.1
Ball, T.2
Sagiv, M.3
-
30
-
-
57349184127
-
Sound, complete and scalable pathsensitive analysis
-
ACM
-
Dillig, I., Dillig, T., Aiken, A.: Sound, complete and scalable pathsensitive analysis. In: PLDI, ACM (2008) 270-280.
-
(2008)
PLDI
, pp. 270-280
-
-
Dillig, I.1
Dillig, T.2
Aiken, A.3
|