… static portions of modules as part of their static semantics, and alsoÐseparatelyÐgave an
algorithm for compiling modules … as simply the restriction of logical equivalence to static values. …

… modules have a direction of information propagation, which corresponds to solving MX
task for those modules. … notation, however, the equivalence of the two formalisms is well-known. …

… In the sequel, for static analysis leading to equivalence checking we shall find it convenient
to visualize a computation as a sequence of parallel paths each of which would contain …

… modules that treats modules as the fundamental constructs, in which the usual suspects of
prior module … notion of static equivalence of program fragments that is independent of dynamic …

… a modular analyzer, able to infer, prove and use (to improve the efficiency) such summaries.
Our modular … , structures, arrays, memory allocations (static and dynamic), pointers, pointer …

… system, to support equivalence checking of Scala programs. … and from the program equivalence
checking literature; this is … correctness by generating inductive equivalence proofs, and …

… This means that we can string refinements and equivalences together to reach a desired
conclusion. For instance, from 𝑡1 ≈ 𝑡2 ≳𝑅 𝑡3 ≳𝑅 𝑡4 ≈ 𝑡5 we can conclude 𝑡1 ≳𝑅 𝑡5. Rule …

… and static program analysis. These applications regularly reason about equivalences, eg, …
For Datalog, [13] presents a modular framework for Datalog evaluation, allowing to plug in a …

… the modules of a modular program, using context-sensitive fixpoint analysis while achieving
both inter-modular (coarse-grain) and intra-modular (… Thus, we use equivalence checking to …

… Some techniques for proving equivalence between different … equivalence are able to relate
different calls and loops [22… logic, or to perform standard static analyses on it), which we …