scientific article; zbMATH DE number 3610766
From MaRDI portal
Publication:4174789
zbMath0393.68080MaRDI QIDQ4174789
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (57)
Improving the results of program analysis by abstract interpretation beyond the decreasing sequence ⋮ Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data ⋮ Donut Domains: Efficient Non-convex Domains for Abstract Interpretation ⋮ Algebraic program analysis ⋮ Model Checking Procedural Programs ⋮ The role of linearity in sharing analysis ⋮ Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness ⋮ Why does Astrée scale up? ⋮ Termination of floating-point computations ⋮ The octagon abstract domain ⋮ Descending chains and narrowing on template abstract domains ⋮ Automatically replacing indices into parallel arrays with pointers to records ⋮ Sound Bit-Precise Numerical Domains ⋮ SMT sampling via model-guided approximation ⋮ Control-flow analysis of function calls and returns by abstract interpretation ⋮ Abstract allocation as a unified approach to polyvariance in control-flow analyses ⋮ Faster Algorithms for Weighted Recursive State Machines ⋮ Incremental Abstract Interpretation ⋮ Generating all polynomial invariants in simple loops ⋮ Generalizing the Template Polyhedral Domain ⋮ Improving Strategies via SMT Solving ⋮ Precise Interprocedural Analysis in the Presence of Pointers to the Stack ⋮ Counterexample- and simulation-guided floating-point loop invariant synthesis ⋮ Unbounded procedure summaries from bounded environments ⋮ Precise interprocedural dataflow analysis with applications to constant propagation ⋮ Approximating Probabilistic Behaviors of Biological Systems Using Abstract Interpretation ⋮ Inference of ranking functions for proving temporal properties by abstract interpretation ⋮ Interprocedural Shape Analysis for Effectively Cutpoint-Free Programs ⋮ TreeKs: A Functor to Make Numerical Abstract Domains Scalable ⋮ Sweeping in Abstract Interpretation ⋮ Summarized Dimensions Revisited ⋮ A Global Occurrence Counting Analysis for Brane Calculi ⋮ A Scalable Segmented Decision Tree Abstract Domain ⋮ Gate splitting in LOTOS specifications using abstract interpretation ⋮ Cache behavior prediction by abstract interpretation ⋮ Widening and narrowing operators for abstract interpretation ⋮ Enforcing termination of interprocedural analysis ⋮ Demand-driven interprocedural analysis for map-based abstract domains ⋮ An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints ⋮ Narrowing Operators on Template Abstract Domains ⋮ Symbolic Model Checking of Hybrid Systems Using Template Polyhedra ⋮ Program Analysis Using Weighted Pushdown Systems ⋮ Precondition Inference from Intermittent Assertions and Application to Contracts on Collections ⋮ Static Analysis of Finite Precision Computations ⋮ Optimal inverse projection of floating-point addition ⋮ Relational Abstract Domain of Weighted Hexagons ⋮ Static Analysis by Abstract Interpretation: A Mathematical Programming Approach ⋮ Speeding up the Constraint-Based Method in Difference Logic ⋮ A relational shape abstract domain ⋮ Region Analysis for Race Detection ⋮ Abstract Interpretation from a Topological Perspective ⋮ Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships ⋮ Polynomial Precise Interval Analysis Revisited ⋮ Template polyhedra and bilinear optimization ⋮ A new abstraction framework for affine transformers ⋮ The octagon abstract domain for continuous constraints ⋮ Abstract cofibered domains: Application to the alias analysis of untyped programs
This page was built for publication:
