A Relational Abstraction for Functions

No abstract is available for this paper.

• Publication year

  2005

• Venue

  Sensors Applications Symposium

• Publication date

  2005-09-07

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/11547662_14
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A framework for numeric analysis of array operations

  2005cited by this paper
• Numeric Domains with Summarized Dimensions

  2004influential reference
• A Temporal Logic of Nested Calls and Returns

  2004cited by this paper
• The octagon abstract domain

  2001cited by this paper
• The Reduced Relative Power Operation on Abstract Domains

  1999cited by this paper
• Parametric shape analysis via 3-valued logic

  1999influential reference
• A logical model for relational abstract domains

  1998cited by this paper
• Solving shape-analysis problems in languages with destructive updating

  1996cited by this paper
• Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages)

  1994influential reference
• Abstract Interpretation and Application to Logic Programs

  1992cited by this paper
• Analysis of pointers and structures (with retrospective)

  1990cited by this paper
• Analysis of pointers and structures

  1990cited by this paper
• Program Flow Analysis: Theory and Application

  1981cited by this paper
• Complexity of flow analysis, inductive assertion synthesis and a language due to Dijkstra

  1980cited by this paper
• Systematic design of program analysis frameworks

  1979cited by this paper
• Automatic discovery of linear restraints among variables of a program

  1978cited by this paper

• Modular analysis of numerical properties by abstract interpretation

  2020cites this paper
• Disjunctive Relational Abstract Interpretation for Interprocedural Program Analysis

  2019cites this paper
• Precise and modular static analysis by abstract interpretation for the automatic proof of program soundness and contracts inference. (Analyse statique modulaire précise par interprétation abstraite pour la preuve automatique de correction de programmes et pour l'inférence de contrats)

  2019cites this paper
• A new abstraction framework for affine transformers

  2017cites this paper
• Abstraction of Relations between Memory States

  2016cites this paper
• Componentized heap abstraction

  2016cites this paper
• A Simple Abstraction of Arrays and Maps by Program Translation

  2015cites this paper
• A zonotopic framework for functional abstractions

  2015cites this paper
• Program Analysis and Verification Static Analysis of Numerical Programs and Systems

  2013cites this paper
• Analyse statique de programmes manipulant des tableaux

  2013cites this paper
• Modular Static Analysis with Zonotopes

  2012cites this paper
• Arithmetisation of the Heap

  2011influential citation
• Statically Inferring Complex Heap, Array, and Numeric Invariants

  2010cites this paper
• A zonotopic framework for functional abstractions

  2009cites this paper
• Numeric program analysis techniques with applications to array analysis and library summarization

  2007cites this paper
• Shape Analysis and Applications

  2007cites this paper
• Project-Team VerTeCs Verification models and techniques applied to the Testing and Control of reactive Systems

  2005cites this paper
• Automatic Verification of Strongly Dynamic Software Systems

  2005cites this paper
• A relational approach to interprocedural shape analysis

  2004cites this paper