Intrusion detection via static analysis

Proceedings of the IEEE Computer Society Symposium on Research in Security and Privacy

Volumn , Issue , 2001, Pages 156-168

  Wagner, David ^a   Dean, Drew ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; AUTOMATION; CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; CONSTRAINT THEORY; LEARNING SYSTEMS; PROGRAM DIAGNOSTICS;

FALSE ALARM; INTRUSION DETECTION SYSTEM; STATIC ANALYSIS;

SECURITY OF DATA;

EID: 0034836394     PISSN: 10637109     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (37)

1. The base-rate fallacy and its implications for the difficulty of intrusion detection
2. Operating system enhancements to prevent the misue of system calls
3. Regular model checking
4. Enforcing trace properties by program transformation
5. Temporal abstract interpretation
6. Buffer overflows: Attacks and defenses for the vulnerability of the decade
7. An intrusion-detection model
8. An efficient context-free parsing algorithm
9. Context-sensitive interprocedural points-to-analysis in the presence of function pointers
10. Dynamically discovering likely program invariants to support program evolution
11. A direct symbolic approach to model checking pushdown systems
12. A sense of self for unix processes
13. A secure environment for untrusted helper applications: Confining the wily hacker
14. An improved context-free recognizer
15. The SLam calculus: Programming with secrecy and integrity
16. Logic induction of valid behavior specifications for intrusion detection
17. Automated detection of vulnerabilities in privileged programs by execution monitoring
18. Execution monitoring of security-critical programs in distributed systems: A specification-based approach
19. A note on the confinement problem
20. From system F to typed assembly language
21. Proof-carrying code
22. Precise interprocecural dataflow analysis via graph reachability
23. Data flow analysis is model checking of abstract interpretation
24. Fast and accurate flow-insensitive points-to analysis
25. Points-to analysis in almost linear time
26. Model checking the full modal mu-calculus for infinite sequential processes
27. An efficient augmented-context-free parsing algorithm
28. A first step towards automated detection of buffer overrun vulnerabilities
29. Verifying systems with infinite but regular state spaces
30. 3