The following pages link to Apron (Q12818):
Displayed 50 items.
- An abstract domain to infer symbolic ranges over nonnegative parameters (Q281291) (← links)
- Symbolic supervisory control of infinite transition systems under partial observation using abstract interpretation (Q434470) (← links)
- Acceleration of the abstract fixpoint computation in numerical program analysis (Q435974) (← links)
- Discovering invariants via simple component analysis (Q435979) (← links)
- Deciding floating-point logic with abstract conflict driven clause learning (Q479837) (← links)
- Construction of the underground contour of a hydraulic structure with constant flow velocity sections (Q532252) (← links)
- Decentralized control of infinite systems (Q645050) (← links)
- Effective abstractions for verification under relaxed memory models (Q681346) (← links)
- Inference of ranking functions for proving temporal properties by abstract interpretation (Q681349) (← links)
- An array content static analysis based on non-contiguous partitions (Q681352) (← links)
- Why does Astrée scale up? (Q845249) (← links)
- The octagon abstract domain (Q853733) (← links)
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence (Q1620957) (← links)
- Conflict-driven conditional termination (Q1702895) (← links)
- Incremental closure for systems of two variables per inequality (Q1733055) (← links)
- Learning analysis strategies for Octagon and context sensitivity from labeled data generated by static analyses (Q1791273) (← links)
- Inferring expected runtimes of probabilistic integer programs using expected sizes (Q2044203) (← links)
- Automatic complexity analysis of integer programs via triangular weakly non-linear loops (Q2104561) (← links)
- Experimental evaluation of numerical domains for inferring ranges (Q2130561) (← links)
- On the efficiency of convex polyhedra (Q2130564) (← links)
- Thread-modular analysis of release-acquire concurrency (Q2145344) (← links)
- PPLite: zero-overhead encoding of NNC polyhedra (Q2216124) (← links)
- Deductive verification of floating-point Java programs in KeY (Q2233510) (← links)
- SyReNN: a tool for analyzing deep neural networks (Q2233513) (← links)
- Quantitative static analysis of communication protocols using abstract Markov chains (Q2322314) (← links)
- Two variations of graph test in double description method (Q2322740) (← links)
- Incrementally closing octagons (Q2335904) (← links)
- Finding suitable variability abstractions for lifted analysis (Q2414252) (← links)
- Proper orthogonal decomposition and low-dimensional approximation of wall pressure fluctuation (Q2468927) (← links)
- (Q2714651) (← links)
- Polyhedral Approximation of Multivariate Polynomials Using Handelman’s Theorem (Q2796046) (← links)
- Lower Runtime Bounds for Integer Programs (Q2817952) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data (Q2891398) (← links)
- Donut Domains: Efficient Non-convex Domains for Abstract Interpretation (Q2891416) (← links)
- Sound Non-statistical Clustering of Static Analysis Alarms (Q2891424) (← links)
- QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers (Q2920992) (← links)
- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra (Q2931828) (← links)
- Static Analysis of Communicating Processes Using Symbolic Transducers (Q2961555) (← links)
- Block-Wise Abstract Interpretation by Combining Abstract Domains with SMT (Q2961574) (← links)
- Efficient Elimination of Redundancies in Polyhedra by Raytracing (Q2961577) (← links)
- Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions (Q2961579) (← links)
- Linear Absolute Value Relation Analysis (Q3000578) (← links)
- Generalizing the Template Polyhedral Domain (Q3000579) (← links)
- Precise Interprocedural Analysis in the Presence of Pointers to the Stack (Q3000594) (← links)
- Static Contract Checking with Abstract Interpretation (Q3067530) (← links)
- Static Analysis of Finite Precision Computations (Q3075485) (← links)
- Certified Roundoff Error Bounds Using Semidefinite Programming (Q3133585) (← links)
- Cyclic Schedule for Apron Services (Q3356101) (← links)
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships (Q3392932) (← links)