메뉴 건너뛰기




Volumn 46, Issue 1, 2011, Pages 187-200

Precise reasoning for programs using containers

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC TECHNIQUE; BUILDING BLOCKES; LINES OF CODE; PRECISE ANALYSIS; PROGRAMMING LANGUAGE;

EID: 79251570920     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1925844.1926407     Document Type: Conference Paper
Times cited : (50)

References (27)
  • 1
    • 85040939688 scopus 로고    scopus 로고
    • Fluid updates: Beyond strong vs. weak updates
    • Dillig, I., Dillig, T., Aiken, A.: Fluid Updates: Beyond Strong vs. Weak Updates. In: ESOP. (2010)
    • (2010) ESOP
    • Dillig, I.1    Dillig, T.2    Aiken, A.3
  • 2
    • 47249132975 scopus 로고    scopus 로고
    • Cover algorithms
    • Gulwani, S., Musuvathi, M.: Cover Algorithms. In: ESOP. (2008) 193-207
    • (2008) ESOP , pp. 193-207
    • Gulwani, S.1    Musuvathi, M.2
  • 3
    • 85035003357 scopus 로고
    • Automatic discovery of linear restraints among variables of a program
    • ACM
    • Cousot, P., Halbwachs, N.: Automatic Discovery of Linear Restraints among Variables of a Program. In: POPL, ACM (1978) 84-96
    • (1978) POPL , pp. 84-96
    • Cousot, P.1    Halbwachs, N.2
  • 5
    • 67650170833 scopus 로고    scopus 로고
    • Finding loop invariants for programs over arrays using a theorem prover
    • Kovacs, L., Voronkov, A.: Finding loop invariants for programs over arrays using a theorem prover. In: FASE 2009. (2009) 470-485
    • (2009) FASE 2009 , pp. 470-485
    • Kovacs, L.1    Voronkov, A.2
  • 7
    • 78650144530 scopus 로고    scopus 로고
    • Cuts from proofs: A complete and practical technique for solving linear inequalities over integers
    • Dillig, I., Dillig, T., Aiken, A.: Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers. In: CAV. (2009)
    • (2009) CAV
    • Dillig, I.1    Dillig, T.2    Aiken, A.3
  • 8
    • 78650157928 scopus 로고    scopus 로고
    • Small formulas for large programs: On-line constraint simplification in scalable static analysis
    • Dillig, I., Dillig, T., Aiken, A.: Small Formulas for Large Programs: On-line Constraint Simplification in Scalable Static Analysis. In: SAS. (2010)
    • (2010) SAS
    • Dillig, I.1    Dillig, T.2    Aiken, A.3
  • 9
    • 57349184127 scopus 로고    scopus 로고
    • Sound, Complete and scalable pathsensitive analysis
    • Dillig, I., Dillig, T., Aiken, A.: Sound, Complete and Scalable Pathsensitive Analysis. In: PLDI. (2008) 270-280
    • (2008) PLDI , pp. 270-280
    • Dillig, I.1    Dillig, T.2    Aiken, A.3
  • 10
    • 79251577042 scopus 로고    scopus 로고
    • C++ standard template library
    • http://www.sgi.com/tech/stl/: C++ standard template library
  • 11
    • 79251538597 scopus 로고    scopus 로고
    • LiteSQL
    • http://sourceforge.net/apps/trac/litesql/: LiteSQL
  • 12
    • 79251549124 scopus 로고    scopus 로고
    • Inkscape
    • http://www.inkscape.org/: Inkscape
  • 13
    • 79251549754 scopus 로고    scopus 로고
    • Digikam
    • http://www.digikam.org/: Digikam
  • 14
    • 79251559656 scopus 로고    scopus 로고
    • QT Framework
    • http://qt.nokia.com/products/: QT Framework
  • 15
    • 24644463830 scopus 로고    scopus 로고
    • Hob: A tool for verifying data structure consistency
    • Lam, P., Kuncak, V., Rinard, M.: Hob: A tool for verifying data structure consistency. In: Compiler Construction. 237-241
    • Compiler Construction , pp. 237-241
    • Lam, P.1    Kuncak, V.2    Rinard, M.3
  • 16
    • 24144476280 scopus 로고    scopus 로고
    • Generalized typestate checking for data structure consistency
    • Verification, Model Checking, and Abstract Interpretation - 6th International Conference, VMCAI 2005
    • Lam, P., Kuncak, V., Rinard, M.: Generalized Typestate Checking for Data Structure Consistency. In: VMCAI. (2005) 430-447 (Pubitemid 41231376)
    • (2005) Lecture Notes in Computer Science , vol.3385 , pp. 430-447
    • Lam, P.1    Kuncak, V.2    Rinard, M.3
  • 17
    • 33947308127 scopus 로고    scopus 로고
    • Modular pluggable analyses for data structure consistency
    • DOI 10.1109/TSE.2006.125
    • Kuncak, V., Lam, P., Zee, K., Rinard, M.: Modular Pluggable Analyses for Data Structure Consistency. IEEE Transactions on Software Engineering 32(12) (2006) 988-1005 (Pubitemid 46437705)
    • (2006) IEEE Transactions on Software Engineering , vol.32 , Issue.12 , pp. 988-1005
    • Kuncak, V.1    Lam, P.2    Zee, K.3    Rinard, M.C.4
  • 18
    • 0036037941 scopus 로고    scopus 로고
    • Deriving specialized program analyses for certifying componentclient conformance
    • Ramalingam, G., Warshavsky, A., Field, J., Goyal, D., Sagiv, M.: Deriving Specialized Program Analyses for Certifying Componentclient Conformance. In: PLDI. (2002) 94
    • (2002) PLDI , vol.94
    • Ramalingam, G.1    Warshavsky, A.2    Field, J.3    Goyal, D.4    Sagiv, M.5
  • 20
    • 33644795132 scopus 로고    scopus 로고
    • STLlint: Lifting static checking from languages to libraries
    • Gregor, D., Schupp, S.: STLlint: lifting static checking from languages to libraries. Software Practice and Experience 36(3) (2006) 225
    • (2006) Software Practice and Experience , vol.36 , Issue.3 , pp. 225
    • Gregor, D.1    Schupp, S.2
  • 21
    • 0027961596 scopus 로고
    • Interprocedural may-alias analysis for pointers: Beyond k-limiting
    • ACM NY, USA
    • Deutsch, A.: Interprocedural may-alias analysis for pointers: Beyond k-limiting. In: PLDI, ACM NY, USA (1994) 230-241
    • (1994) PLDI , pp. 230-241
    • Deutsch, A.1
  • 22
    • 34548211382 scopus 로고    scopus 로고
    • Conditional must not aliasing for static race detection
    • Naik, M., Aiken, A.: Conditional Must not Aliasing for Static Race Detection. In: POPL. (2007) 338
    • (2007) POPL , pp. 338
    • Naik, M.1    Aiken, A.2
  • 23
    • 43449124115 scopus 로고    scopus 로고
    • Effective typestate verification in the presence of aliasing
    • Fink, S., Yahav, E., Dor, N., Ramalingam, G., Geay, E.: Effective Typestate Verification in the Presence of Aliasing. TOSEM 17(2) (2008) 1-34
    • (2008) TOSEM , vol.17 , Issue.2 , pp. 1-34
    • Fink, S.1    Yahav, E.2    Dor, N.3    Ramalingam, G.4    Geay, E.5
  • 24
    • 26944484921 scopus 로고    scopus 로고
    • Static program analysis via 3- valued logic
    • Reps, T.W., Sagiv, S., Wilhelm, R.: Static Program Analysis via 3- Valued Logic. In: CAV. (2004) 15-30
    • (2004) CAV , pp. 15-30
    • Reps, T.W.1    Sagiv, S.2    Wilhelm, R.3
  • 25
    • 70450235107 scopus 로고    scopus 로고
    • Chameleon: Adaptive selection of collections
    • ACM
    • Shacham, O., Vechev, M., Yahav, E.: Chameleon: Adaptive Selection of Collections. In: PLDI, ACM (2009) 408-418
    • (2009) PLDI , pp. 408-418
    • Shacham, O.1    Vechev, M.2    Yahav, E.3
  • 26
    • 67649876630 scopus 로고    scopus 로고
    • Speed: Precise and efficient static estimation of program computational complexity
    • Gulwani, S., Mehra, K.K., Chilimbi, T.: Speed: Precise and efficient static estimation of program computational complexity. In: POPL. (2009) 127-139
    • (2009) POPL , pp. 127-139
    • Gulwani, S.1    Mehra, K.K.2    Chilimbi, T.3
  • 27
    • 84865647096 scopus 로고    scopus 로고
    • Lifting abstract interpreters to quantified logical domains
    • ACM
    • Gulwani, S., McCloskey, B., Tiwari, A.: Lifting abstract interpreters to quantified logical domains. In: POPL, ACM (2008) 235-246
    • (2008) POPL , pp. 235-246
    • Gulwani, S.1    McCloskey, B.2    Tiwari, A.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.