Precise interprocedural analysis using random interpretation

No abstract is available for this paper.

• Publication year

  2005

• Venue

  ACM-SIGACT Symposium on Principles of Programming Languages

• Publication date

  2005-01-12

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/1040305.1040332
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Interprocedural Herbrand Equalities

  2005cited by this paper
• Program analysis using random interpretation

  2005cited by this paper
• Global value numbering using random interpretation

  2004cited by this paper
• A polynomial-time algorithm for global value numbering

  2004influential reference
• Precise interprocedural analysis through linear algebra

  2004influential reference
• Discovering affine equalities using random interpretation

  2003influential reference
• Detecting Equalities of Variables: Combining Efficiency with Precision

  1999cited by this paper
• The Complexity of Type Analysis of Object Oriented Programs

  1998cited by this paper
• Value Numbering

  1997cited by this paper
• Advanced Compiler Design and Implementation

  1997cited by this paper
• On the sequential nature of interprocedural program-analysis problems

  1996cited by this paper
• Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation

  1995influential reference
• Precise interprocedural dataflow analysis via graph reachability

  1995cited by this paper
• Undecidability of static analysis

  1992cited by this paper
• Efficiently computing static single assignment form and the control dependence graph

  1991influential reference
• Global value numbers and redundant computations

  1988cited by this paper
• Fast Probabilistic Algorithms for Verification of Polynomial Identities

  1980cited by this paper
• Probabilistic algorithms for sparse polynomials

  1979cited by this paper
• Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

  1977cited by this paper
• Affine relationships among variables of a program

  1976influential reference
• A unified approach to global program optimization

  1973cited by this paper

• A Survey of Binary Code Fingerprinting Approaches: Taxonomy, Methodologies, and Features

  2022cites this paper
• Binary Analysis Overview

  2020cites this paper
• Binary Code Fingerprinting for Cybersecurity: Application to Malicious Code Fingerprinting

  2020cites this paper
• BDA: practical dependence analysis for binary executables by unbiased whole-program path sampling and per-path abstract interpretation

  2019cites this paper
• Practical detection of concurrency issues at coding time

  2018cites this paper
• Integrated analysis of exception flows and handler actions in Java libraries: an empirical study

  2016cites this paper
• Understanding the Exception Handling Strategies of Java Libraries: An Empirical Study

  2016cites this paper
• Transforming spreadsheet data types using examples

  2016influential citation
• Abstract Domains of Affine Relations

  2014cites this paper
• Automatic abstraction for bit-vectors using decision procedures

  2013cites this paper
• Vérification probabiliste de résultats d'analyse statique

  2012cites this paper
• esultats d'analyse statique

  2012cites this paper
• Discovering invariants via simple component analysis

  2012influential citation
• Discovering Linear Restraint for Software Validation

  2012cites this paper
• Probabilistically Accurate Program Transformations

  2011cites this paper
• Domains of Affine Relations

  2011cites this paper
• Verification of semantic commutativity conditions and inverse operations on linked data structures

  2011cites this paper
• Abstract Domains of Affine Relations

  2011cites this paper
• Satisfiability-based Program Reasoning and Program Synthesis

  2010cites this paper
• Deriving Numerical Abstract Domains via Principal Component Analysis

  2010cites this paper
• Analysis Techniques for Information Security

  2010cites this paper
• Interprocedural Polynomial Invariants

  2010cites this paper
• INTERPROCEDURAL ANALYSIS AND THE VERIFICATION OF CONCURRENT PROGRAMS

  2009cites this paper
• Interprocedural Analysis of Concurrent Programs Under a Context Bound

  2008cites this paper
• Program Analysis Using Weighted Pushdown Systems

  2007cites this paper
• Generating all polynomial invariants in simple loops

  2007influential citation
• Program verification as probabilistic inference

  2007cites this paper
• Removing unimportant computations in interprocedural program analysis

  2007influential citation
• Open-Source Model Checking

  2006cites this paper
• Interprocedurally Analyzing Polynomial Identities

  2006cites this paper
• Assertion Checking over Combined Abstraction of Linear Arithmetic and Uninterpreted Functions

  2006cites this paper
• Program analysis using random interpretation

  2005cites this paper
• A Generic Framework for Interprocedural Analysis of Numerical Properties

  2005cites this paper
• DART: directed automated random testing

  2005cites this paper
• A Generic Framework for Interprocedural Analyses of Numerical Properties

  2004cites this paper
• about the Internet and Networking : 2010 – 2019

  2003cites this paper