scientific article; zbMATH DE number 3592938
From MaRDI portal
Publication:4162449
zbMath0381.68013MaRDI QIDQ4162449
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Directed graphs (digraphs), tournaments (05C20)
Related Items (45)
Formal timing analysis for distributed real-time programs ⋮ Efficient symbolic analysis of programs ⋮ Precise interprocedural dependence analysis of parallel programs ⋮ Why does Astrée scale up? ⋮ The complexity of reachability in distributed communicating processes ⋮ Composition and evaluation of attribute coupled grammars ⋮ Packing feedback arc sets in reducible flow graphs ⋮ Computing polynomial program invariants ⋮ Dynamic program slicing ⋮ Iterative methods of program analysis ⋮ Approximate matching of regular expressions ⋮ Flow analysis of lazy higher-order functional programs ⋮ Eliminating partially dead code in explicitly parallel programs ⋮ Data flow analysis as model checking ⋮ Static and dynamic processor allocation for higher-order concurrent languages ⋮ Application of static analyses for state-space reduction to the microcontroller binary code ⋮ Bidirectional data flow analysis for type inferencing. ⋮ Properties of data flow frameworks: A unified model ⋮ Unnamed Item ⋮ Interprocedural analysis and optimization ⋮ COMPILE-TIME ANALYSIS AND OPTIMIZATION OF EXPLICITLY PARALLEL PROGRAMS* ⋮ Program structures: Some new characterisations ⋮ Efficient parallel algorithms for path problems in directed graphs ⋮ A parallel algorithm for static program slicing ⋮ On edge addition rewrite systems and their relevance to program analysis ⋮ A generalized mathematical theory of structured programming ⋮ The complexity of data flow criteria for test data selection ⋮ A comparison of some algorithms for live variable analysis ⋮ Internal and External Logics of Abstract Interpretations ⋮ The allocation problem in hardware design ⋮ Transfer flow graphs ⋮ Quality Engineering: Leveraging Heterogeneous Information ⋮ Precondition Inference from Intermittent Assertions and Application to Contracts on Collections ⋮ Data flow analysis of distributed communicating processes ⋮ Least-cost partition algorithms ⋮ Analysis of program structure ⋮ Interconvertibility of a class of set constraints and context-free-language reachability ⋮ Equivalence of conservative, free, linear program schemas is decidable ⋮ A region analysis algorithm for the live variables problem ⋮ Intensional Kleene and Rice theorems for abstract program semantics ⋮ Branch distance optimization of structured programs ⋮ Reconstructing sequential behavior from parallel behavior projections ⋮ Analysis of program optimization possibilities and further development ⋮ Axiomatic-like performance analysis (ALPA) ⋮ An even faster solver for general systems of equations
This page was built for publication:
