scientific article
From MaRDI portal
Publication:4068060
zbMath0309.68020MaRDI QIDQ4068060
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Verified bytecode verifiers. ⋮ Non-local configuration of component interfaces by constraint satisfaction ⋮ Efficient symbolic analysis of programs ⋮ Continualization of Probabilistic Programs With Correction ⋮ Algebraic program analysis ⋮ Compositional verification of smart contracts through communication abstraction ⋮ Instruction-level security analysis for information flow in stack-based assembly languages ⋮ A flow-insensitive-complete program representation ⋮ A formally verified compiler back-end ⋮ Mechanising a type-safe model of multithreaded Java with a verified compiler ⋮ Data flow analysis as model checking ⋮ Application of static analyses for state-space reduction to the microcontroller binary code ⋮ Bidirectional data flow analysis for type inferencing. ⋮ An algorithm for analyzing communicating processes ⋮ The logic-termal equivalence is polynomial-time decidable ⋮ Complete Abstractions and Subclassical Modal Logics ⋮ The Birth of Model Checking ⋮ Efficient interprocedural data-flow analysis using treedepth and treewidth ⋮ Abstract Interpretation with Applications to Timing Validation ⋮ A unifying view on SMT-based software verification ⋮ Properties of data flow frameworks: A unified model ⋮ Tree equivalence of linear recursive schemata is polynomial-time decidable ⋮ Control-flow analysis of function calls and returns by abstract interpretation ⋮ Finite constants: Characterizations of a new decidable set of constants ⋮ Automatic generation of interprocedural data-flow analyzers and optimizers ⋮ System-level non-interference of constant-time cryptography. II: Verified static analysis and stealth memory ⋮ Dataflow Analysis for Datarace-Free Programs ⋮ Typing Local Control and State Using Flow Analysis ⋮ Data flow analysis of asynchronous systems using infinite abstract domains ⋮ Precise interprocedural dataflow analysis with applications to constant propagation ⋮ On the computational complexity of data flow analysis over finite bounded meet semilattices ⋮ An algorithm for tracing live variables based on a straightened program graph ⋮ Compiling Janus to RSSA ⋮ Mechanized Verification of Computing Dominators for Formalizing Compilers ⋮ A Case Study in Abstract Interpretation Based Program Transformation ⋮ A Scalable Segmented Decision Tree Abstract Domain ⋮ Program equivalence and context-free grammars ⋮ Tractable constraints in finite semilattices ⋮ Pentagons: a weakly relational abstract domain for the efficient validation of array accesses ⋮ Node listings for reducible flow graphs ⋮ Demand-driven interprocedural analysis for map-based abstract domains ⋮ Profitability computations on program flow graphs ⋮ Äquivalente Transformationen für Flußdiagramme ⋮ The Cayley-Hamilton Theorem for Noncommutative Semirings ⋮ Program Analysis Using Weighted Pushdown Systems ⋮ A decision tree lifted domain for analyzing program families with numerical features ⋮ Precise interprocedural dataflow analysis with applications to constant propagation ⋮ A class of polynomially solvable range constraints for interval analysis without widenings ⋮ Optimizing reversible programs ⋮ A region analysis algorithm for the live variables problem ⋮ Automated formal analysis and verification: an overview ⋮ On sparse evaluation representations ⋮ Transformational derivation of an improved alias analysis algorithm ⋮ Property-oriented expansion ⋮ An even faster solver for general systems of equations
