The following pages link to ASTREE (Q25618):
Displayed 50 items.
- Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions (Q2961579) (← links)
- An abstract memory functor for verified C static analyzers (Q2985780) (← 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)
- The Reduced Product of Abstract Domains and the Combination of Decision Procedures (Q3000629) (← 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)
- Precondition Inference from Intermittent Assertions and Application to Contracts on Collections (Q3075478) (← links)
- Hardware-Dependent Proofs of Numerical Programs (Q3100216) (← links)
- Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs (Q3166219) (← links)
- Combining Model Checking and Data-Flow Analysis (Q3176374) (← links)
- Learning a Strategy for Choosing Widening Thresholds from a Large Codebase (Q3179275) (← links)
- An Abstract Interpretation Framework for the Round-Off Error Analysis of Floating-Point Programs (Q3296349) (← links)
- Proving the Correctness of the Implementation of a Control-Command Algorithm (Q3392923) (← links)
- Abstract Interpretation of FIFO Replacement (Q3392924) (← links)
- Splitting the Control Flow with Boolean Flags (Q3522080) (← links)
- Automatic Modular Abstractions for Template Numerical Constraints (Q3575308) (← links)
- Inferring Loop Invariants Using Postconditions (Q3586008) (← links)
- A Scalable Segmented Decision Tree Abstract Domain (Q3587252) (← links)
- Orion: High-Precision Methods for Static Error Analysis of C and C++ Programs (Q3591386) (← links)
- Taming the Wrapping of Integer Arithmetic (Q3611998) (← links)
- Static Analysis in Disjunctive Numerical Domains (Q3613374) (← links)
- Static Analysis of String Manipulations in Critical Embedded C Programs (Q3613377) (← links)
- Beyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic (Q3613386) (← links)
- Abstract Interpretation of Symbolic Execution with Explicit State Updates (Q3638994) (← links)
- Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants (Q4913868) (← links)
- Constructive Galois Connections (Q4972068) (← links)
- ConSORT: Context- and Flow-Sensitive Ownership Refinement Types for Imperative Programs (Q5041118) (← links)
- Compact Difference Bound Matrices (Q5056006) (← links)
- Access-Based Localization for Octagons (Q5170168) (← links)
- TreeKs: A Functor to Make Numerical Abstract Domains Scalable (Q5170170) (← links)
- Generic Abstraction of Dictionaries and Arrays (Q5170171) (← links)
- An Accurate Join for Zonotopes, Preserving Affine Input/Output Relations (Q5170172) (← links)
- Stratified Static Analysis Based on Variable Dependencies (Q5170182) (← links)
- Loop invariants (Q5176169) (← links)
- Integrated and Automated Abstract Interpretation, Verification and Testing of C/C++ Modules (Q5187834) (← links)
- Structural Abstract Interpretation: A Formal Study Using Coq (Q5191090) (← links)
- Automatic modular abstractions for linear constraints (Q5261513) (← links)
- Automation of Quantitative Information-Flow Analysis (Q5300883) (← links)
- Converting One Type-Based Abstract Domain to Another (Q5302885) (← links)
- Programming Languages and Systems (Q5316570) (← links)
- A Data Driven Approach for Algebraic Loop Invariants (Q5326308) (← links)
- Comparison of Combinatorial Signatures of Global Network Dynamics Generated by Two Classes of ODE Models (Q5382446) (← links)
- Theories, solvers and static analysis by abstract interpretation (Q5395699) (← links)
- A galois connection calculus for abstract interpretation (Q5408396) (← links)
- A parametric segmentation functor for fully automatic and scalable array content analysis (Q5408536) (← links)
- Building Certified Static Analysers by Modular Construction of Well-founded Lattices (Q5415621) (← links)
- A Hybrid Denotational Semantics for Hybrid Systems (Q5458386) (← links)