Polyvariance

Known as: Polyvariant 
In program analysis, an analysis is called polyvariant if functions are analyzed multiple times—typically once at each call site—to improve the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2013
Review
2013
Abstract interpretation is an efficient means for approximating program behaviors before run-time. It can be used as the basis… (More)
Is this relevant?
2011
2011
We present some extensions of a method for verifying safety properties of infinite state reactive systems. Safety properties are… (More)
  • figure 1
  • figure 2
  • figure 4
  • table 1
  • table 2
Is this relevant?
2011
2011
A reversible programming language is a programming language in which you can only write reversible programs, i.e., programs that… (More)
  • figure 1
  • figure 3
  • figure 8
  • figure 10
Is this relevant?
2006
2006
Interpretation with Specialized Definitions Germán Puebla 1 , Elvira Albert , and Manuel Hermenegildo 1,3 
  • figure 2
  • figure 3
Is this relevant?
2005
2005
The DDP (Demand-driven/Pruning) analysis algorithm allows us to perform data-flow analyses of programming languages that are… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 2
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We present the design of DyC, a dynamic-compilation system for C based on run-time specialization. Directed by a few declarative… (More)
  • figure 4
  • figure 6
  • figure 7
  • table 1
  • figure 12
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Given a program and some input data, partial deduction computes a specialized program handling any remaining input more… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1996
1996
Flow analysis is a potentially very useful analysis for higher order functional languages, but its practical application has been… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The control of polyvariance is a key issue in partial deduction of logic programs. Certainly, only nitely many specialised… (More)
Is this relevant?
1981
1981
The minimum phase factorization of bounded Hermitian operators (covariance operators) is an essential ingredient in linear… (More)
Is this relevant?