Alexey Loginov, Thomas Reps, Mooly Sagiv  Home/Search
Context Related
| wisc.edu/wpis/papers/tr1504.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wisc.edu/~reps/reps (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper concerns the question of how to create abstractions that are useful for program analysis. It presents a method that refines an abstraction automatically for analysis problems in which the semantics of statements and the query of interest are expressed using logical formulas. Refinement is carried out by introducing new instrumentation relations (defined via logical formulas over core relations, which capture the basic properties of memory configurations). A tool that... (Update)
Cited by: More
A Relational Approach to Interprocedural Shape Analysis.. - Alexey Loginov Thomas (Correct)
Static Program Analysis via 3-Valued Logic - Thomas Reps Mooly (2004) (Correct)
Active bibliography (related documents): More All
0.3: Efficient Verification of Sequential and Concurrent C.. - Chaki, Clarke, Groce, .. (2004) (Correct)
0.3: Refining Approximations in Software Predicate Abstraction - Ball, Cook, Das, Rajamani (2004) (Correct)
0.3: Abstraction Refinement via Inductive Learning - Alexey Loginov Thomas (Correct)
Similar documents based on text: More All
0.5: Parametric Shape Analysis via 3-Valued Logic - Sagiv, Reps, Wilhelm (1999) (Correct)
0.4: Debugging via Run-Time Type Checking - Loginov, Yong, Horwitz, Reps (2001) (Correct)
0.4: Speeding up Slicing - Reps, Horwitz, Sagiv, Rosay (1994) (Correct)
Related documents from co-citation: More All
3: TVLA: A system for implementing static analyses (context) - Lev-Ami, Sagiv - 2000
3: Numeric domains with summarized dimensions - Gopan, DiMaio et al. - 2004
3: Finite differencing of logical formulas for static analysis - Reps, Sagiv et al. - 2003
BibTeX entry: (Update)
Loginov, A., Reps, T., Sagiv, M.: Abstraction refinement for 3-valued-logic analysis. Tech. Rep. 1504, Comp. Sci. Dept., Univ. of Wisconsin (2004) http://citeseer.ist.psu.edu/loginov04abstraction.html More
@misc{ loginov04abstraction,
author = "A. Loginov and T. Reps and M. Sagiv",
title = "Abstraction refinement for 3-valued-logic analysis",
text = "Loginov, A., Reps, T., Sagiv, M.: Abstraction refinement for 3-valued-logic
analysis. Tech. Rep. 1504, Comp. Sci. Dept., Univ. of Wisconsin (2004)",
year = "2004",
url = "citeseer.ist.psu.edu/loginov04abstraction.html" }
Citations (may not include all citations):312 Systematic design of program analysis frameworks (context) - Cousot, Cousot - 1979
267 Computer-aided Verification of Coordinating Processes (context) - Kurshan - 1994
150 Parametric shape analysis via 3-valued logic - Sagiv, Reps et al. - 2002
94 Counterexample-guided abstraction refinement - Clarke, Grumberg et al. - 2000
40 Successive approximation of abstract transition relations (context) - Das, Dill - 2001
37 Modular verification of software components in C - Chaki, Clarke et al. - 2003
28 TVLA: A system for implementing static analyses (context) - Lev-Ami, Sagiv - 2000
21 On proving safety properties by integrating static analysis - Rusu, Singerman - 1999
20 Deriving specialized program analyses for certifying compone.. - Ramalingam, Warshavsky et al. - 2002
18 Symbolically computing most-precise abstract operations for .. (context) - Yorsh, Reps et al. - 2004
17 Putting static analysis to work for verification: A case stu.. (context) - Lev-Ami, Reps et al. - 2000
13 Generating abstract explanations of spurious counterexamples.. (context) - Ball, Rajamani - 2002
12 Finding feasible counter-examples when model checking Java p.. - Pasareanu, Dwyer et al. - 2001
12 Incremental verification by abstraction - Lakhnech, Bensalem et al. - 2001
12 Counter-example based predicate discovery in predicate abstr.. - Das, Dill - 2002
12 Automatically closing open reactive programs - Colby, Godefroid et al. - 1998
10 Thread-modular abstraction refinement - Henzinger, Jhala et al. - 2003
10 Finite differencing of logical formulas for static analysis - Reps, Sagiv et al. - 2003
9 Numeric domains with summarized dimensions - Gopan, DiMaio et al. - 2004
9 Automated environment generation for software model checking - Tkachuk, Dwyer et al. - 2003
http://research.microsoft.com/slam/"
http://www.math.tau.ac.il/#rumster/TVLA/"
Documents on the same site (http://www.cs.wisc.edu/~reps/reps.html): More
Parametric Shape Analysis via 3-Valued Logic - Sagiv, Reps, Wilhelm (1999) (Correct)
Putting Static Analysis to Work for Verification: A Case.. - Lev-Ami, Reps, Sagiv.. (2000) (Correct)
Program Slicing for VHDL - Clarke, Fujita, Rajan, Reps.. (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC