Sciweavers

4716 search results - page 391 / 944
» Iterative-free program analysis
Sort
View
TACAS
2012
Springer
263views Algorithms» more  TACAS 2012»
14 years 2 months ago
Reachability under Contextual Locking
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
Rohit Chadha, P. Madhusudan, Mahesh Viswanathan
OSDI
2006
ACM
16 years 7 months ago
Securing Software by Enforcing Data-flow Integrity
Software attacks often subvert the intended data-flow in a vulnerable program. For example, attackers exploit buffer overflows and format string vulnerabilities to write data to u...
Manuel Costa, Miguel Castro, Timothy L. Harris
FOSSACS
2007
Springer
16 years 28 days ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
APLAS
2006
ACM
16 years 22 days ago
XML Validation for Context-Free Grammars
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...
Yasuhiko Minamide, Akihiko Tozawa
CCS
2005
ACM
16 years 9 days ago
The framework of selective interleaving functions and the modular assembly kit
The Framework of Selective Interleaving Functions and the Modular Assembly Kit for Security Properties both provide a basis for the uniform representation and formal analysis of n...
Heiko Mantel