메뉴 건너뛰기




Volumn , Issue , 2004, Pages 199-208

Verifying web applications using bounded model checking

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; ERROR CORRECTION; MATHEMATICAL MODELS; QUALITY ASSURANCE; SECURITY OF DATA; USER INTERFACES;

EID: 4544358830     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (35)

References (29)
  • 5
    • 0000301097 scopus 로고
    • A greedy heuristic for the set covering problem
    • Chvatal, V. "A Greedy Heuristic for the Set Covering Problem." Mathematics of Operations Research, 4:33-235, 1979.
    • (1979) Mathematics of Operations Research , vol.4 , pp. 33-235
    • Chvatal, V.1
  • 6
    • 0043197065 scopus 로고    scopus 로고
    • Behavioral consistency of C and verilog programs using bounded model checking
    • Carnegie Mellon University, School of Computer Science
    • Clarke, E., Kroening, D., Yorav, k. "Behavioral Consistency of C and Verilog Programs using Bounded Model Checking." Technical Report CMU-CS-03-126, Carnegie Mellon University, School of Computer Science, 2003.
    • (2003) Technical Report , vol.CMU-CS-03-126
    • Clarke, E.1    Kroening, D.2    Yorav, K.3
  • 7
    • 0042134845 scopus 로고    scopus 로고
    • Behavioral consistency of C and verilog programs using bounded model checking
    • Session 23.3, Anaheim, CA
    • Clarke, E., Kroening, D., Yorav, K. "Behavioral Consistency of C and Verilog Programs using Bounded Model Checking." In Proc. 40th Design Automation Conference, Session 23.3, Anaheim, CA, 2003.
    • (2003) Proc. 40th Design Automation Conference
    • Clarke, E.1    Kroening, D.2    Yorav, K.3
  • 9
    • 85050550846 scopus 로고
    • Abstract interpretation: A unified lattice model for static analysis of programs by constructions or approximation of fixpoints
    • Cousot, P., Cousot, R. "Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Constructions or Approximation of Fixpoints." In Conference Record of the 4th ACM Symp. Principles of Programming Languages, p.238-252, 1977.
    • (1977) Conference Record of the 4th ACM Symp. Principles of Programming Languages , pp. 238-252
    • Cousot, P.1    Cousot, R.2
  • 12
    • 0016949746 scopus 로고
    • A lattice model of secure information flow
    • Denning, D. E. "A Lattice Model of Secure Information Flow." Communications of the ACM, 19(5):236-243, 1976.
    • (1976) Communications of the ACM , vol.19 , Issue.5 , pp. 236-243
    • Denning, D.E.1
  • 13
    • 84880450431 scopus 로고    scopus 로고
    • Web application security assessment by fault injection and behavior monitoring
    • Budapest, Hungary
    • Huang, Y. W., Huang, S. K., Lin, T. P., Tsai, C. H. "Web Application Security Assessment by Fault Injection and Behavior Monitoring." In Proc. 12th Int'l World Wide Web Conference, p.148-159, Budapest, Hungary, 2003.
    • (2003) Proc. 12th Int'l World Wide Web Conference , pp. 148-159
    • Huang, Y.W.1    Huang, S.K.2    Lin, T.P.3    Tsai, C.H.4
  • 20
    • 4544371144 scopus 로고    scopus 로고
    • The ten most critical web application security vulnerabilities
    • OWASP. "The Ten Most Critical Web Application Security Vulnerabilities." OWASP Whitepaper, version 1.0, 2003.
    • (2003) OWASP Whitepaper, Version 1.0
  • 22
    • 0027699087 scopus 로고
    • Lattice-based access control models
    • Sandhu, R. S. "Lattice-Based Access Control Models." IEEE Computer, 26(11):9-19, 1993.
    • (1993) IEEE Computer , vol.26 , Issue.11 , pp. 9-19
    • Sandhu, R.S.1
  • 23
    • 21244432992 scopus 로고    scopus 로고
    • Unbounded, fully symbolic model checking of timed automata using boolean methods
    • Boulder, Colorado, Springer-Verlag
    • Sanjit, A. S., Bryant, R. E., "Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods." In Proc. 15th Int'l Conf. Computer-Aided Verification, p.154-166, volume LNCS 2725, Boulder, Colorado, 2003. Springer-Verlag.
    • (2003) Proc. 15th Int'l Conf. Computer-Aided Verification , vol.LNCS 2725 , pp. 154-166
    • Sanjit, A.S.1    Bryant, R.E.2
  • 24
  • 26
    • 0022605097 scopus 로고
    • Typestate: A programming language concept for enhancing software reliability
    • Jan
    • Strom, R. E., Yemini, S. A. "Typestate: A Programming Language Concept for Enhancing Software Reliability." IEEE Transactions on Software Engineering, 12(1):157-171, Jan 1986.
    • (1986) IEEE Transactions on Software Engineering , vol.12 , Issue.1 , pp. 157-171
    • Strom, R.E.1    Yemini, S.A.2


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