메뉴 건너뛰기




Volumn , Issue , 2010, Pages 377-386

Solving string constraints lazily

Author keywords

Decision procedure; Regular language; Scalability

Indexed keywords

CLIENT APPLICATIONS; CONSTRAINT SOLVING; DECISION PROCEDURE; INPUT CONSTRAINTS; KEY ELEMENTS; ORDERS OF MAGNITUDE; PROGRAM ANALYSIS; REGULAR LANGUAGES; SATISFYING ASSIGNMENTS; SEARCH SPACES; STRING ANALYSIS; TESTING FRAMEWORK;

EID: 78649793709     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1858996.1859080     Document Type: Conference Paper
Times cited : (38)

References (34)
  • 4
    • 24944448541 scopus 로고    scopus 로고
    • Simplify: A theorem prover for program checking
    • David Detlefs, Greg Nelson, and James B. Saxe. Simplify: a theorem prover for program checking. J. ACM, 52(3):365-473, 2005.
    • (2005) J. ACM , vol.52 , Issue.3 , pp. 365-473
    • Detlefs, D.1    Nelson, G.2    Saxe, J.B.3
  • 6
    • 38149088089 scopus 로고    scopus 로고
    • A decision procedure for bit-vectors and arrays
    • Vijay Ganesh and David L. Dill. A decision procedure for bit-vectors and arrays. In Computer-Aided Verification, pages 519-531, 2007.
    • (2007) Computer-Aided Verification , pp. 519-531
    • Ganesh, V.1    Dill, D.L.2
  • 11
    • 0141639607 scopus 로고    scopus 로고
    • Follow automata
    • Lucian Ilie and Sheng Yu. Follow automata. Inf. Comput., 186(1):140-162, 2003.
    • (2003) Inf. Comput. , vol.186 , Issue.1 , pp. 140-162
    • Ilie, L.1    Yu, S.2
  • 13
    • 34547231669 scopus 로고    scopus 로고
    • The power of commuting with finite sets of words
    • Michal Kunc. The power of commuting with finite sets of words. Theory Comput. Syst., 40(4):521-551, 2007.
    • (2007) Theory Comput. Syst. , vol.40 , Issue.4 , pp. 521-551
    • Kunc, M.1
  • 14
    • 34548072632 scopus 로고    scopus 로고
    • What do we know about language equations?
    • Michal Kunc. What do we know about language equations? In Developments in Language Theory, pages 23-27, 2007.
    • (2007) Developments in Language Theory , pp. 23-27
    • Kunc, M.1
  • 16
    • 77949808417 scopus 로고    scopus 로고
    • Automated test data generation for coverage: Haven't we solved this problem yet?
    • September
    • K. Lakhotia, P. McMinn, and M. Harman. Automated test data generation for coverage: Haven't we solved this problem yet? In Testing Academia and Industry Conference, pages 95-104, September 2009.
    • (2009) Testing Academia and Industry Conference , pp. 95-104
    • Lakhotia, K.1    McMinn, P.2    Harman, M.3
  • 19
    • 58049169957 scopus 로고    scopus 로고
    • Directed test generation using symbolic grammars
    • Rupak Majumdar and Ru-Gang Xu. Directed test generation using symbolic grammars. In Automated Software Engineering, pages 134-143, 2007.
    • (2007) Automated Software Engineering , pp. 134-143
    • Majumdar, R.1    Xu, R.-G.2
  • 20
    • 33749823368 scopus 로고    scopus 로고
    • Static approximation of dynamically generated web pages
    • Yasuhiko Minamide. Static approximation of dynamically generated web pages. In International Conference on the World Wide Web, pages 432-441, 2005.
    • (2005) International Conference on the World Wide Web , pp. 432-441
    • Minamide, Y.1
  • 24
    • 33847102258 scopus 로고    scopus 로고
    • Solving sat and sat modulo theories: From an abstract davis-putnam-logemann-loveland procedure to dpll(t)
    • Robert Nieuwenhuis, Albert Oliveras, and Cesare Tinelli. Solving sat and sat modulo theories: From an abstract davis-putnam-logemann-loveland procedure to dpll(t). J. ACM, 53(6):937-977, 2006.
    • (2006) J. ACM , vol.53 , Issue.6 , pp. 937-977
    • Nieuwenhuis, R.1    Oliveras, A.2    Tinelli, C.3
  • 26
    • 33745216482 scopus 로고    scopus 로고
    • The essence of command injection attacks in web applications
    • Zhendong Su and Gary Wassermann. The essence of command injection attacks in web applications. In Principles of Programming Languages, pages 372-382, 2006.
    • (2006) Principles of Programming Languages , pp. 372-382
    • Su, Z.1    Wassermann, G.2
  • 27
    • 78449248345 scopus 로고    scopus 로고
    • Solving extended regular constraints symbolically
    • December
    • Margus Veanes, Nikolaj Bjørner, and Leonardo de Moura. Solving extended regular constraints symbolically. Technical report, MSR, December 2009.
    • (2009) Technical Report, MSR
    • Veanes, M.1    Bjørner, N.2    De Moura, L.3
  • 29
    • 35449004893 scopus 로고    scopus 로고
    • Sound and precise analysis of web applications for injection vulnerabilities
    • Gary Wassermann and Zhendong Su. Sound and precise analysis of web applications for injection vulnerabilities. In Programming Language Design and Implementation, pages 32-41, 2007.
    • (2007) Programming Language Design and Implementation , pp. 32-41
    • Wassermann, G.1    Su, Z.2
  • 32
    • 84910681237 scopus 로고    scopus 로고
    • Static detection of security vulnerabilities in scripting languages
    • July
    • Y. Xie and Alex Aiken. Static detection of security vulnerabilities in scripting languages. In Usenix Security Symposium, pages 179-192, July 2006.
    • (2006) Usenix Security Symposium , pp. 179-192
    • Xie, Y.1    Aiken, A.2
  • 33
    • 26444583266 scopus 로고    scopus 로고
    • Saturn: A SAT-based tool for bug detection
    • Yichen Xie and Alexander Aiken. Saturn: A SAT-based tool for bug detection. In Computer Aided Verification, pages 139-143, 2005.
    • (2005) Computer Aided Verification , pp. 139-143
    • Xie, Y.1    Aiken, A.2


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