Live briefing
Everything about Polyvariance
In program analysis, a polyvariant or context-sensitive analysis analyzes each function multiple times—typically once at each call site—to improve the precision of the analysis. Polyvariance is common in data-flow and pointer analyses. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: PolyvarianceA 5-minute orientation
- Skim a recent paper: Polyvariance of the Exegetic Hypotheses of Clement of AlexandriaInfluential work since 2022
- Pick up a classic book: Polyvariant analysis of the untyped lambda calculusThe most-reprinted book on the subject
- Read the landmark paper: Controlling generalization and polyvariance in partial deduction of normal logic programsCited 66 times
- Go sideways: Pointer analysisA closely related topic
- Go sideways: Steensgaard's algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
No outline available.
🏆 Landmark papers (most cited)
Controlling generalization and polyvariance in partial deduction of normal logic programs
On the polyvariance of the base equations of coupled micropolar thermoelasticity
The Concept of Ontogenesis Polyvariance and Modern Evolutionary Morphology
Morphological Polyvariance of Ontogeny in Natural Plant Populations
On factoring the polyvariance operator
Morphogenetic Polyvariance in the Colonial Hydroid Dynamena pumila (L.)
Controlling Polyvariance for Specialization-based Verification
Abstract allocation as a unified approach to polyvariance in control-flow analyses
🆕 Influential since 2022
Polyvariance of the Exegetic Hypotheses of Clement of Alexandria
ONTOGENY POLYVARIANCE OF PEDUNCULATE OAK IN PINE FORESTS OF THE BRYANSK POLESIE
Polyvariance of Ontogeny and Structural Evolution of Modular Organisms
Development Polyvariance of the Siberian Fir’s Undergrowth in Dark-Coniferous Forests of the Northern Pre-Urals
Polyvariance of vector formation of sustainable development of metallurgical enterprises
📚 Books worth reading
- 📕Polyvariant analysis of the untyped lambda calculusJens Palsberg · 1992
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Pointer analysis In computer science, pointer analysis, or points-to analysis, is a static code analysis technique that establishes which pointers, or heap references,…
- Steensgaard's algorithm In computer science, Steensgaard's algorithm is a scalable, flow-insensitive, algorithm for pointer analysis. It is often used in compilers, due to its…
- Yannis Smaragdakis Yannis Smaragdakis (Greek: Γιάννης Σμαραγδάκης; born 31 March 1972) is a Greek-American software engineer, computer programmer, and researcher. He is a…
- Alias analysis In program analysis and compiler theory, alias analysis is a technique used to determine if a storage location may be accessed in more than one way. Two…
- Runtime predictive analysis Runtime predictive analysis (or predictive analysis) is a runtime verification technique in computer science for detecting property violations in program…
- Context-free language reachability Context-free language reachability is an algorithmic problem with applications in static program analysis. Given a graph with edge labels from some alphabet…
- Data-flow analysis Data-flow analysis is a technique for gathering information about the possible set of values calculated at various points in a computer program. It forms…
- Soufflé (programming language) Soufflé is an open source parallel logic programming language, influenced by Datalog. Soufflé includes both an interpreter and a compiler that targets…