scientific article

zbMath0468.68002MaRDI QIDQ3922128

Neil D. Jones, Steven S. Muchnick

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

program analysisprogram optimizationdata flow analysis

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Conference proceedings and collections of articles (00Bxx)

Related Items (38)

Efficient symbolic analysis of programs ⋮ Specifications can make programs run faster ⋮ Strictness analysis and denotational abstract interpretation ⋮ Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study ⋮ Convergence of chaotic iterative least fixed point computations ⋮ Dynamic program slicing ⋮ Flow analysis of lazy higher-order functional programs ⋮ Eliminating partially dead code in explicitly parallel programs ⋮ Inverse-limit and topological aspects of abstract interpretation ⋮ Verification of multi-linked heaps ⋮ Two-level semantics and abstract interpretation ⋮ Control-flow analysis of function calls and returns by abstract interpretation ⋮ Grammar semantics, analysis and parsing by abstract interpretation ⋮ Finite constants: Characterizations of a new decidable set of constants ⋮ Program verification using symbolic game semantics ⋮ Least solutions of equations over N ⋮ Static semantics, types, and binding time analysis ⋮ Proving implications by algebraic approximation ⋮ Precise interprocedural dataflow analysis with applications to constant propagation ⋮ Using multiset discrimination to solve language processing problems without hashing ⋮ Abstract interpretation: a kind of magic ⋮ SMT-based model checking for recursive programs ⋮ Acquiring search-control knowledge via static analysis ⋮ A lattice for abstract interpretation of dynamic (LISP-like) structures ⋮ Relational Analysis and Precision via Probabilistic Abstract Interpretation ⋮ Internal and External Logics of Abstract Interpretations ⋮ On the complexity of dataflow analysis of logic programs ⋮ Upper Adjoints for Fast Inter-procedural Variable Equalities ⋮ Program Analysis Using Weighted Pushdown Systems ⋮ The reduced relative power operation on abstract domains ⋮ Interconvertibility of a class of set constraints and context-free-language reachability ⋮ On the verification of finite failure ⋮ An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. ⋮ Efficient and flexible matching of recursive types ⋮ Closures and fairness in the semantics of programming logic ⋮ Constructive design of a hierarchy of semantics of a transition system by abstract interpretation ⋮ Termination analysis for offline partial evaluation of a higher order functional language ⋮ Abstract cofibered domains: Application to the alias analysis of untyped programs

This page was built for publication: