Ranking Abstractions

No abstract is available for this paper.

• Publication year

  2008

• Venue

  European Symposium on Programming

• Publication date

  2008-03-29

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-540-78739-6_13
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Formal Techniques for Networked and Distributed Systems - FORTE 2005, 25th IFIP WG 6.1 International Conference, Taipei, Taiwan, October 2-5, 2005, Proceedings

  2013cited by this paper
• Termination analysis of logic programs through combination of type-based norms

  2007cited by this paper
• Variance analyses from invariance analyses

  2007cited by this paper
• Influence of cultivation temperature on the ligninolytic activity of selected fungal strains

  2006influential reference
• Terminator: Beyond Safety

  2006cited by this paper
• Termination proofs for systems code

  2006cited by this paper
• Termination of Polynomial Programs

  2005cited by this paper
• The Polyranking Principle

  2005cited by this paper
• Ranking Abstraction as Companion to Predicate Abstraction

  2005cited by this paper
• Simplify: a theorem prover for program checking

  2005cited by this paper
• Ranking Abstraction as a Companion to Predicate Abstraction,

  2005cited by this paper
• A Complete Method for the Synthesis of Linear Ranking Functions

  2004cited by this paper
• Analysis of Recursive Game Graphs Using Data Flow Equations

  2004cited by this paper
• Transition invariants

  2004influential reference
• Verifying Temporal Heap Properties Specified via Evolution Logic

  2003cited by this paper
• Constructive design of a hierarchy of semantics of a transition system by abstract interpretation

  2002cited by this paper
• CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs

  2002cited by this paper
• The size-change principle for program termination

  2001cited by this paper
• The octagon abstract domain

  2001cited by this paper
• A Semantic Basis for the Termination Analysis of Logic Programs

  1999cited by this paper
• Checking a large routine

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

  1979cited by this paper

• Extending the range of bugs that automated program repair can handle

  2023cites this paper
• Towards Extending the Range of Bugs That Automated Program Repair Can Handle

  2022cites this paper
• Towards More Reliable Automated Program Repair by Integrating Static Analysis Techniques

  2021cites this paper
• Convergence: Integrating termination and abort-freedom

  2018cites this paper
• Knowledge-based verification of service compositions

  2018cites this paper
• Contributions to program analysis: expressivity and scalability

  2017cites this paper
• Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs

  2017cites this paper
• Precondition Calculation for Loops Iterating over Data Structures

  2016cites this paper
• Termination, correctness and relative correctness

  2016cites this paper
• Abstractions de programmes pour l’étude de la terminaison et de la complexité

  2016cites this paper
• Termination of Monotone Programs

  2016cites this paper
• Static analysis of control-command systems : floating-point and integer invariants. (Analyse statique des systèmes de contrôle-commande : invariants entiers et flottants)

  2015cites this paper
• Automatic program analysis using Max-SMT

  2015cites this paper
• ALICe: A Framework to Improve Affine Loop Invariant Computation

  2014cites this paper
• Verifying while loops with invariant relations

  2014cites this paper
• Th E pro Gr Am Te R M in Atio N Problem, Also Known Proving Program Termination Key Insights

  2014cites this paper
• Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants

  2013cites this paper
• Termination proofs from tests

  2013cites this paper
• Binary Reachability Analysis of Higher Order Functional Programs

  2012cites this paper
• Termination Analysis with Algorithmic Learning

  2012influential citation
• Loop summarization using state and transition invariants

  2012cites this paper
• Precise enforcement of progress-sensitive security

  2012influential citation
• Program Termination Proofs

  2012influential citation
• Lyapunov abstractions for inevitability of hybrid systems

  2012cites this paper
• Termination proofs for linear simple loops

  2012cites this paper
• Automated termination proofs for haskell by term rewriting

  2011cites this paper
• Termination Analysis of C Programs Using Compiler Intermediate Languages

  2011cites this paper
• Loop Summarization and Termination Analysis

  2011cites this paper
• Proving program termination

  2011influential citation
• Scalable abstractions for efficient security checks

  2011cites this paper
• Proving termination using abstract interpretation

  2010cites this paper
• Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs

  2010cites this paper
• Bounding the Computational Complexity of Flowchart Programs with Multi-dimensional Rankings

  2010cites this paper
• Alternation for Termination

  2010cites this paper
• Metric Spaces and Termination Analyses

  2010cites this paper
• Proving Termination of Integer Term Rewriting

  2009cites this paper
• A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs

  2009influential citation
• Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions

  2009cites this paper
• Term rewriting with built-in numbers and collection data structures

  2009cites this paper
• Principles of program termination ? ? ? ? ? Draft of notes for 2008 Marktoberdorf summer school Final version is currently in preparation

  2008cites this paper
• A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis

  2008cites this paper
• Abstract Interpretation with Applications to Timing Validation

  2008cites this paper
• Abstract Interpretation with Applications to Timing Validation Invited Tutorial

  2008cites this paper
• Automatically Proving Program Termination

  2007cites this paper
• Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions

  year unknowncites this paper
• Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions

  year unknowncites this paper
• Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions

  year unknowncites this paper
• Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions

  year unknowncites this paper
• Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions

  year unknowncites this paper
• Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions

  year unknowncites this paper
• Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions

  year unknowncites this paper
• ALICe: A Framework to Improve Affine Loop Invariant Computation

  year unknowncites this paper
• Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions

  year unknowncites this paper
• Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions

  year unknowncites this paper
• Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions

  year unknowncites this paper
• Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions

  year unknowncites this paper
• Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions

  year unknowncites this paper
• Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions

  year unknowncites this paper
• Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions

  year unknowncites this paper