Static Analysis

Lecture Notes in Computer Science(2013)

引用 2|浏览6
暂无评分
摘要
Interpretation over Non-lattice Abstract Domains . . . . . . . . . . . . 6 Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Søndergaard, and Peter J. Stuckey Localizing Widening and Narrowing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 Gianluca Amato and Francesca Scozzari The Abstract Domain of Segmented Ranking Functions . . . . . . . . . . . . . . . 43 Caterina Urban Symbolic Automata for Static Specification Mining . . . . . . . . . . . . . . . . . . . 63 Hila Peleg, Sharon Shoham, Eran Yahav, and Hongseok Yang Predicate Abstraction for Relaxed Memory Models . . . . . . . . . . . . . . . . . . . 84 Andrei Marian Dan, Yuri Meshman, Martin Vechev, and Eran Yahav On Solving Universally Quantified Horn Clauses . . . . . . . . . . . . . . . . . . . . . 105 Nikolaj Bjørner, Ken McMillan, and Andrey Rybalchenko From Concrete Examples to Heap Manipulating Programs . . . . . . . . . . . . 126 Subhajit Roy Local Shape Analysis for Overlaid Data Structures . . . . . . . . . . . . . . . . . . . 150 Cezara Drăgoi, Constantin Enea, and Mihaela Sighireanu Quantified Data Automata on Skinny Trees: An Abstract Domain for Lists . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 172 Pranav Garg, P. Madhusudan, and Gennaro Parlato Static Validation of Dynamically Generated HTML Documents Based on Abstract Parsing and Semantic Processing . . . . . . . . . . . . . . . . . . 194 Hyunha Kim, Kyung-Goo Doh, and David A. Schmidt Byte-Precise Verification of Low-Level List Manipulation . . . . . . . . . . . . . . 215 Kamil Dudka, Petr Peringer, and Tomáš Vojnar
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要