The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Intrusion detection via static analysis
Abstract
One of the primary challenges in intrusion detection is modelling typical application behavior so that we can recognize attacks by their atypical effects without raising too many false alarms. We show how static analysis may be used to automatically derive a model of application behavior. The result is a host-based intrusion detection system with three advantages: a high degree of automation, protection against a broad class of attacks based on corrupted code, and the elimination of false alarms. We report on our experience with a prototype implementation of this technique.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Introduction to automata theory, languages and computation
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90068-9 · Cited by 10,699
Introduction to automata theory, languages, and computation
(1980) · Computer Languages · doi:10.1016/0096-0551(80)90011-9 · Cited by 6,824
Denning, D. E. (1987) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1987.232894 · Cited by 3,427
Necula, G. C. (1997) · Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97 · doi:10.1145/263699.263712 · Cited by 1,843
守屋, 悦. (1980) · 情報処理 · Cited by 1,791
An efficient context-free parsing algorithm
Earley, J. (1983) · Communications of the ACM · doi:10.1145/357980.358005 · Cited by 1,606
A note on the confinement problem
Lampson, B. W. (1973) · Communications of the ACM · doi:10.1145/362375.362389 · Cited by 1,429
Computer security threat monitoring and surveillance
Anderson, J. (1980) · Medical Entomology and Zoology · Cited by 1,342
Schneider, F. B. (2000) · ACM Transactions on Information and System Security · doi:10.1145/353323.353382 · Cited by 1,289
Precise interprocedural dataflow analysis via graph reachability
Reps, T., Horwitz, S., & Sagiv, M. (1995) · Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95 · doi:10.1145/199448.199462 · Cited by 1,170
Points-to analysis in almost linear time
Steensgaard, B. (1996) · Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96 · doi:10.1145/237721.237727 · Cited by 1,088
Dynamically discovering likely program invariants to support program evolution
Ernst, M. D., Cockrell, J., Griswold, W. G., & Notkin, D. (2001) · IEEE Transactions on Software Engineering · doi:10.1109/32.908957 · Cited by 1,050
Recognition and parsing of context-free languages in time n3
Younger, D. H. (1967) · Information and Control · doi:10.1016/s0019-9958(67)80007-x · Cited by 935
A sense of self for Unix processes
Forrest, S., Hofmeyr, S. A., Somayaji, A., & Longstaff, T. A. (2002) · Proceedings 1996 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.1996.502675 · Cited by 874
Insertion, Evasion, and Denial of Service: Eluding Network Intrusion Detection
Ptacek, T. H., & Newsham, T. N. (1998) · Cited by 649
From system F to typed assembly language
Morrisett, G., Walker, D., Crary, K., & Glew, N. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/319301.319345 · Cited by 584
Context-sensitive interprocedural points-to analysis in the presence of function pointers
Emami, M., Ghiya, R., & Hendren, L. J. (1994) · Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation · doi:10.1145/178243.178264 · Cited by 570
The SLam calculus: programming with secrecy and integrity
Heintze, N., & Riecke, J. G. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268976 · Cited by 410
A secure environment for untrusted helper applications confining the Wily Hacker
Goldberg, I., Wagner, D. A., Thomas, R., & Brewer, E. (1996) · Cited by 393
Self-citationBuffer overflows: attacks and defenses for the vulnerability of the decade
Cowan, C., Wagle, F., Pu, C., Beattie, S., & Walpole, J. (2002) · Proceedings DARPA Information Survivability Conference and Exposition. DISCEX'00 · doi:10.1109/discex.2000.821514 · Cited by 371
The base-rate fallacy and its implications for the difficulty of intrusion detection
Axelsson, S. (1999) · Proceedings of the 6th ACM conference on Computer and communications security · doi:10.1145/319709.319710 · Cited by 325
Ko, C., Ruschitzka, M., & Levitt, K. (2002) · Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097) · doi:10.1109/secpri.1997.601332 · Cited by 318
Bouajjani, A., Jönsson, B., Nilsson, M., & Touili, T. (2000) · Lecture notes in computer science · doi:10.1007/10722167_31 · Cited by 298
An Improved Context-Free Recognizer
Graham, S. L., Harrison, M. A., & Ruzzo, W. L. (1980) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357103.357112 · Cited by 206
Buffer overflows: attacks and defenses for the vulnerability of the decade
Cowan, C., Wagle, P., Pu, C., et al. (2004) · doi:10.1109/fits.2003.1264935 · Cited by 198
An efficient augmented-context-free parsing algorithm
Tomita, M. (1987) · Cited by 195
Data flow analysis is model checking of abstract interpretations
Schmidt, D. A. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268950 · Cited by 186
A direct symbolic approach to model checking pushdown systems
Finkel, A., Willems, B., Wolper, P., & Moller, F. (1997) · ORBi (University of Liège) · Cited by 178
Temporal abstract interpretation
Cousot, P. M., & Cousot, R. (2000) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/325694.325699 · Cited by 120
Enforcing trace properties by program transformation
Colcombet, T., & Fradet, P. (2000) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/325694.325703 · Cited by 98
Logic induction of valid behavior specifications for intrusion detection
Ko, C. (2002) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.2000.848452 · Cited by 66
Static analysis and computer security: new techniques for software assurance
Wagner, D., & Brewer, E. (2000) · Cited by 45
Self-citationSchneider, F. B. (2004) · doi:10.1109/fits.2003.1264930 · Cited by 45
Cited by
Mimicry attacks on host-based intrusion detection systems
Wagner, D., & Soto, P. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586145 · Cited by 714
Self-citationAmmons, G., Bodík, R., & Larus, J. R. (2002) · Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/503272.503275 · Cited by 665
Static Analysis of Executables to Detect Malicious Patterns
Christodorescu, M., & Jha, S. (2006) · doi:10.21236/ada449067 · Cited by 600
The essence of command injection attacks in web applications
Su, Z., & Wassermann, G. (2006) · Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1111037.1111070 · Cited by 515
Anomaly detection using call stack information
Feng, H. H., Kolesnikov, O. M., Fogla, P., Lee, W., & Gong, W. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/secpri.2003.1199328 · Cited by 386
Metadata
- Authors
- Wagner, D., & Dean, R.
- Venue
- Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-13
- Pages
- 156-168
- OpenAlex
- W2123886726
- Cited by
- 647
- References
- 33
- FWCI
- 36.16
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.