scientific article; zbMATH DE number 3610766
From MaRDI portal
Publication:4174789
zbMATH Open0393.68080MaRDI QIDQ4174789FDOQ4174789
Authors: Patrick Cousot, Radhia Cousot 
Publication date: 1978
Title of this publication is not available (Why is that?)
Cited In (58)
- Summarized dimensions revisited
- SMT sampling via model-guided approximation
- Control-flow analysis of function calls and returns by abstract interpretation
- Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes
- Algebraic program analysis
- Program Analysis Using Weighted Pushdown Systems
- Donut domains: efficient non-convex domains for abstract interpretation
- Interprocedural shape analysis for effectively cutpoint-free programs
- The octagon abstract domain for continuous constraints
- Abstract cofibered domains: Application to the alias analysis of untyped programs
- Generating all polynomial invariants in simple loops
- Abstract allocation as a unified approach to polyvariance in control-flow analyses
- Region Analysis for Race Detection
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
- Unbounded procedure summaries from bounded environments
- Abstract Interpretation from a Topological Perspective
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
- Termination of floating-point computations
- Automatically replacing indices into parallel arrays with pointers to records
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
- Enforcing termination of interprocedural analysis
- Speeding up the constraint-based method in difference logic
- Faster algorithms for weighted recursive state machines
- Widening and narrowing operators for abstract interpretation
- Counterexample- and simulation-guided floating-point loop invariant synthesis
- Static analysis of finite precision computations
- Template polyhedra and bilinear optimization
- Cache behavior prediction by abstract interpretation
- Precise interprocedural analysis in the presence of pointers to the stack
- A scalable segmented decision tree abstract domain
- \textsf{TreeKs}: a functor to make numerical abstract domains scalable
- Demand-driven interprocedural analysis for map-based abstract domains
- Abstract domains for automated reasoning about list-manipulating programs with infinite data
- An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints
- Optimal inverse projection of floating-point addition
- Descending chains and narrowing on template abstract domains
- Model Checking Procedural Programs
- Static analysis by abstract interpretation: a mathematical programming approach
- Sweeping in Abstract Interpretation
- A new abstraction framework for affine transformers
- A relational shape abstract domain
- The octagon abstract domain
- Polynomial Precise Interval Analysis Revisited
- The role of linearity in sharing analysis
- Precondition inference from intermittent assertions and application to contracts on collections
- Precise interprocedural dataflow analysis with applications to constant propagation
- A Global Occurrence Counting Analysis for Brane Calculi
- Why does Astrée scale up?
- Relational abstract domain of weighted hexagons
- Approximating probabilistic behaviors of biological systems using abstract interpretation
- Incremental Abstract Interpretation
- Improving strategies via SMT solving
- Narrowing Operators on Template Abstract Domains
- Sound bit-precise numerical domains
- Gate splitting in LOTOS specifications using abstract interpretation
- Generalizing the template polyhedral domain
- Symbolic Model Checking of Hybrid Systems Using Template Polyhedra
- Inference of ranking functions for proving temporal properties by abstract interpretation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4174789)
