Safety Analysis versus Type Inference

Palsberg, Jens; Schwartzbach, Michael I.

doi:10.1006/inco.1995.1058

Cited by 45 publications

(26 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reachability analyses have previously been discovered independently [25,26,27,28]. In our case they arise naturally from a projecting abstraction of a reachable states collecting semantics.…”

Section: Characteristics Of the Derived Analysismentioning

confidence: 99%

“…However by using a pointer or the implicit label of each sub-expression instead of the sub-expression itself, a single constraint takes only constant space. By linearly determining a representative for each sub-expression, by generating O(n 2 ) constraints, linear post-processing, and iteratively solving them using a well-known algorithm [26,28,21], we can compute the analysis in worst-case O(n 3 ) time. The extracted constraints bear similarities to existing constraint-based analyses in the literature.…”

Section: Extracting a Constraint-based Cfamentioning

confidence: 99%

See 1 more Smart Citation

Control-flow analysis of function calls and returns by abstract interpretation

Midtgaard

Jensen

2009

SIGPLAN Not.

View full text Add to dashboard Cite

. Control-flow analysis of function calls and returns by abstract interpretation. Information and Computation, Elsevier, 2012, 2012, pp.49-76. 10.1016/j.ic.2011 AbstractAbstract interpretation techniques are used to derive a control-flow analysis for a simple higher-order functional language. The analysis approximates the interprocedural control-flow of both function calls and returns in the presence of first-class functions and tail-call optimization. In addition to an abstract environment, the analysis computes for each expression an abstract call-stack, effectively approximating where function calls return. The analysis is systematically derived by abstract interpretation of the stack-based C a EK abstract machine of Flanagan et al. using a series of Galois connections. We prove that the analysis is equivalent to an analysis obtained by first transforming the program into continuation-passing style and then performing control flow analysis of the transfored program. We then show how the analysis induces an equivalent constraint-based formulation, thereby providing a rational reconstruction of a constraint-based CFA from abstract interpretation principles.

show abstract

Section: Characteristics Of the Derived Analysismentioning

confidence: 99%

Section: Extracting a Constraint-based Cfamentioning

confidence: 99%

Control-flow analysis of function calls and returns by abstract interpretation

Midtgaard

Jensen

2009

SIGPLAN Not.

View full text Add to dashboard Cite

show abstract

“…Palsberg and Schwartzbach [121] coined the term safety analysis for such an analysis. Their analysis is based on a constraint-based CFA.…”

Section: Safety Analysismentioning

confidence: 99%

Control-Flow Analysis of Functional Programs

Midtgaard¹

2007

BRICS

View full text Add to dashboard Cite

We present a survey of control-flow analysis of functional programs, which has been the subject of extensive investigation throughout the past 25 years. Analyses of the control flow of functional programs have been formulated in multiple settings and have led to many different approximations, starting with the seminal works of Jones, Shivers, and Sestoft. In this paper we survey control-flow analysis of functional programs by structuring the multitude of formulations and approximations and comparing them. * IT-parken,

show abstract

“…The particular constraint system we consider is due to Palsberg and Schwartzbach [67], used in performing what they call safety analysis -a version of closure analysis -but very similar sets of constraints have been used for type inference [66]. For each subterm of the program we will have a variable, which is going to hold information about that particular part of the program (whether this is type information or anything else is irrelevant).…”

Section: Example: Constraint Systemsmentioning

confidence: 99%

Verification of Temporal Properties of Concurrent Systems

Andersen¹

1993

DPB

View full text Add to dashboard Cite

2 Dansk SammenfatningDenne afhandling behandler metoder og algoritmer til verifikation af parallelle systemer. Verifikationen af et system foretages ud fra en givet specifikation, der udtaler sig om visse ønskelige aspekter, og en, muligvis ufuldstaendig, beskrivelse af det parallelle system. Specifikationer vil blive angivet i en kraftig modallogik -den modale µ-kalkule -og parallelle systemer beskrives som processer fra en procesalgebra, der følger traditionen fra Milner's CCS og Hoare's CSP. Afhandlingen tager udgangspunkt i en kompositionel metode, der, givet en specifikation til en sammensat proces, dekomponerer denne til speficikationer om delprocesser, således at den oprindelige proces vi1 tilfredsstille sin specifikation, hvis og kun hvis, delprocesserne tilfredsstiller deres delspecifikationer. En sådan kompositionel metode bidrager til at kunne håndtere den store kompleksitet som parallelle systemer ofte besidder.Selvom den modale µ-kalkule er meget udtryksfuld, har den fra et pragmatisk synspunkt nogle mangler, som vi vi1 forsøge at udbedre ved introduktionen af en udvidet µ-kalkule, der, udover nogle yderligere logiske konstruktioner, som tillader nemmere formulering af egenskaber i logikken, også har en mulighed for kompakt repraesentation af specifikationer ved deling af deludtryk gennem simultane fikspunkter. Fra en mindre observation i den kompositionelle metode udnyttes denne mulighed for kompakte repraesentationer til at give effektive globale og lokale algoritmer til automatisk afgørelse af om en endelig proces tilfredsstiller sin specifikation -et problem der benaevnes model-check. Den modale µ-kalkule får sin udtrykskraft fra tilstedevaerelsen af minimale og maksimale fikspunkter; effektiv beregning af fikspunkter indgår således som en vigtig del af algoritmerne til modelcheck.De centrale ideer med deling af vaerdier og opfølgning af aendringer brugt i disse algoritmer er af en generel natur -en observation, der bliver brugt til at give en algoritme for beregning af fikspunkter i endelige fuldstaendige partielle ordninger og gitre.For uendelige tilstandssystemer er modelcheckproblemet generelt uafgør-ligt, så vi er nødt til betragte semi-automatiske eller brugerassisterede systemer. Vi praesenterer en metode baseret på angivelse af passende vel-funderede ordninger for de minimale fikspunkter. Metoden er en slags målorienteret bevissystem: Startende med målet, en proces og en specifikation som processen skal vises at tilfredsstille, konstrueres nye delmål ud fra et saet af regler. Dette 3 kan gentages indtil alle delmål er trivielle. Metoden bevises at vaere sund og fuldstaendig.Endelig praesesenteres en ny måde at angribe detåbne problem for µ-kalkulen, der består i at finde en endelig aksiomatisering. Vi karakteriserer en klasse af kategoriske modeller for en intuitionistisk version af kalkulen og reformulerer problemet som et problem om hvordan disse kategoriske modeller kan skaeres ned til mere traditionelle Kripke-agtige modeller.I det konkluderende kapitel diskuteres kort kompleksiteten...

show abstract

Safety Analysis versus Type Inference

Cited by 45 publications

References 18 publications

Control-flow analysis of function calls and returns by abstract interpretation

Control-flow analysis of function calls and returns by abstract interpretation

Control-Flow Analysis of Functional Programs

Verification of Temporal Properties of Concurrent Systems

Contact Info

Product

Resources

About