david's pl notes

        • Java Implementation and HotSpot Optimizations
        • ahoDragon10112007
        • ahoDragonBookBasic2007
        • ahoDragonBookGrammars2007
        • ahoDragonBookMachineindependent2007
        • appelCritiqueStandardML1993
        • appelSSAFunctionalProgramming1998
        • backusCanProgrammingBe1978
        • barrettSatisfiabilityModuloTheories2008
        • blellochProgrammingParallelAlgorithms1996
        • brachaMirrorsDesignPrinciples2004
        • carlssonImplementingPrologFunctional1984
        • chakravartyDataParallelHaskell2007
        • clarkeVerificationToolsFinitestate1994
        • ferranteProgramDependenceGraph1987
        • flanaganEssenceCompilingContinuations1993
        • fordPackratParsingSimple2002
        • gabrielLispGoodNews1991
        • godefroidDARTDirectedAutomated2005
        • grafConstructionAbstractState1997
        • henzingerLazyAbstraction2002
        • hoareHintsProgrammingLanguage1983
        • hughesWhyFunctionalProgramming1989
        • kowalskiAlgorithmLogicControl1979
        • krishnamurthiAutomataMacros2006
        • mitchellModelsTypedCalculus1996
        • mouraCoroutinesLua2004
        • nielsonPrinciplesProgramAnalysis1999a
        • nielsonPrinciplesProgramAnalysis1999b
        • nieuwenhuisSolvingSATSAT2006
        • ocallahanHybridDynamicData2003
        • pierceATAPLDependentTypes2005
        • pierceATAPLEffectTypes2005
        • pierceTAPL11Simplytyped2002
        • pierceTAPL2002
        • pierceTAPL12132002
        • pierceTAPL15182002
        • pierceTAPL20222002
        • repsProgramAnalysisGraph1998
        • sridharanAliasAnalysisObjectOriented2013
        • tipSurveyProgramSlicing1994
        • wadlerHowEnterprisesUse
        • wilsonUniprocessorGarbageCollection1992
        • winskelLectureNotesDenotational2005
        • winskelWinskelAxiomaticSemantics1993
        • winskelWinskelDenotationalSemantics1993
        • wobbrockResearchContributionsHumancomputer2016a
        • zhangBetterTogetherUnifying2023a
      • 2024-03-14 • CS 294, 7Th – How to design languages
      • 2024-04-02 • CS 294, 11Tu – SMT
      • 2024-04-11 • CS 294, 12Th – Projectional Editors
      • 2024-04-16 • CS 294, 13Tu – Program Slicing
      • 2024-06-17 • lambda calc
      • 2024-06-26 • type system extensions
      • 2024-07-03 • denotational semantics and fancy types
      • 2024-07-10 • optimizations and gc
      • 2024-07-17 • axiomatic semantics, domain theory
      • 2024-07-24 • dependent & effect types
      • 2024-07-31 • attribute grammars, ssa, cps
      • 2024-07-31 • Prelim, Justin targeted - abstract interpretation
      • 2024-08-05 • Prelim, Justin grab bag
      • 2024-08-07 • control flow analysis & abstract interpretation
      • 2024-08-07 • Prelim, Justin targeted - program slicing
      • 2024-08-09 • Prelim, Parker grab bag - axiomatic semantics
      • 2024-08-12 • Prelim, Justin grab bag
      • 2024-08-14 • Prelim, Justin targeted - auto-parallelization
      • 2024-08-14 • program dependence graphs, program slicing, lazy abstraction
      • 2024-08-20 • Prelim review - STLC and friends
      • 2024-08-21 • auto-parallelization
      • 2024-08-21 • Prelim, Federico grab bag
      • 2024-08-22 • Prelim review - type-checking and inference
      • 2024-08-23 • Prelim review - imperative semantics
      • 2024-08-24 • Prelim review - program analysis
      • 2024-08-25 • Prelim review - compiler innards
      • 2024-08-25 • Prelim review - language design and features
      • 2024-08-26 • Prelim review - testing and verification
      • compiler
      • continuation-passing style
      • CS 263 - Introduction to Denotational Semantics
      • CS 264 Notes
      • CS 294
      • dataflow programming
      • Datalog
      • denotational semantics and domain theory
      • escape analysis
      • inlining
      • interprocedural analysis
      • lattice
      • parsing
      • program slicing
      • program synthesis
      • register allocation
      • SAT and SMT solving
      • semantic analysis
      • value numbering
    Home

    ❯

    reading notes

    ❯

    repsProgramAnalysisGraph1998

    repsProgramAnalysisGraph1998

    Sep 02, 20241 min read

    • reading

    We can frame lots of program analyses (especially interprocedural ones) as graph reachability problems! See the backlinks for examples! And for more info, see interprocedural analysis in particular.


    Graph View

    Backlinks

    • 2024-08-24 • Prelim review - program analysis
    • David's PL Notes
    • interprocedural analysis
    • nielsonPrinciplesProgramAnalysis1999a
    • sridharanAliasAnalysisObjectOriented2013
    • tipSurveyProgramSlicing1994

    Created with Quartz v4.3.1 © 2024

    • made by david minh-duy cao
    • website source