The following pages link to (Q4414726):
Displaying 50 items.
- ASTREE (Q25618) (← links)
- Inferring complete initialization of arrays (Q383356) (← links)
- Acceleration of the abstract fixpoint computation in numerical program analysis (Q435974) (← links)
- An extension of lazy abstraction with interpolation for programs with arrays (Q479820) (← links)
- The two variable per inequality abstract domain (Q656848) (← links)
- An array content static analysis based on non-contiguous partitions (Q681352) (← links)
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness (Q845242) (← links)
- Why does Astrée scale up? (Q845249) (← links)
- A minimalistic look at widening operators (Q848744) (← links)
- Termination of floating-point computations (Q850498) (← links)
- Some ways to reduce the space dimension in polyhedra computations (Q853727) (← links)
- The octagon abstract domain (Q853733) (← links)
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses (Q988565) (← links)
- Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
- Integration of verification methods for program systems (Q1040327) (← links)
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence (Q1620957) (← links)
- The abstract domain of trapezoid step functions (Q1749121) (← links)
- Class invariants as abstract interpretation of trace semantics (Q1749225) (← links)
- Demand-driven interprocedural analysis for map-based abstract domains (Q1785851) (← links)
- Learning analysis strategies for Octagon and context sensitivity from labeled data generated by static analyses (Q1791273) (← links)
- Inferring functional properties of matrix manipulating programs by abstract interpretation (Q1791274) (← links)
- A formally verified floating-point implementation of the compact position reporting algorithm (Q2024357) (← links)
- Unbounded-time safety verification of guarded LTI models with inputs by abstract acceleration (Q2031413) (← links)
- A two-phase approach for conditional floating-point verification (Q2233493) (← links)
- Deductive verification of floating-point Java programs in KeY (Q2233510) (← links)
- Widening and narrowing operators for abstract interpretation (Q2275526) (← links)
- Template polyhedra and bilinear optimization (Q2322312) (← links)
- Incrementally closing octagons (Q2335904) (← links)
- A sparse evaluation technique for detailed semantic analyses (Q2339156) (← links)
- Implementing and reasoning about hash-consed data structures in Coq (Q2351422) (← links)
- A divide-and-conquer approach for analysing overlaid data structures (Q2441710) (← links)
- Temporal property verification as a program analysis task (Q2441713) (← links)
- Abstract Fixpoint Computations with Numerical Acceleration Methods (Q2814099) (← links)
- Relational Abstract Domain of Weighted Hexagons (Q2814105) (← links)
- Sound Non-statistical Clustering of Static Analysis Alarms (Q2891424) (← links)
- The Undefined Domain: Precise Relational Information for Entities That Do Not Exist (Q2937785) (← links)
- Analyzing Array Manipulating Programs by Program Transformation (Q2949696) (← links)
- Unbounded-Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration (Q2949859) (← links)
- Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions (Q2961579) (← links)
- Generalizing the Template Polyhedral Domain (Q3000579) (← links)
- Improving Strategies via SMT Solving (Q3000582) (← links)
- Static Analysis of Run-Time Errors in Embedded Critical Parallel C Programs (Q3000591) (← links)
- Mutation-Based Test Case Generation for Simulink Models (Q3066126) (← links)
- Static Contract Checking with Abstract Interpretation (Q3067530) (← links)
- Sawja: Static Analysis Workshop for Java (Q3067538) (← links)
- Combining Model Checking and Data-Flow Analysis (Q3176374) (← links)
- Learning a Strategy for Choosing Widening Thresholds from a Large Codebase (Q3179275) (← links)
- Proving the Correctness of the Implementation of a Control-Command Algorithm (Q3392923) (← links)
- A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis (Q3512505) (← links)
- Inferring Loop Invariants Using Postconditions (Q3586008) (← links)
