The following pages link to Programming Languages and Systems (Q5308685):
Displayed 26 items.
- 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)
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness (Q845242) (← links)
- Why does Astrée scale up? (Q845249) (← links)
- Termination of floating-point computations (Q850498) (← links)
- The octagon abstract domain (Q853733) (← links)
- Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case (Q888469) (← links)
- The analytic hierarchy process, max algebra and multi-objective optimisation (Q1940091) (← links)
- Formal analysis of the compact position reporting algorithm (Q1996426) (← links)
- A formally verified floating-point implementation of the compact position reporting algorithm (Q2024357) (← links)
- The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory (Q2133400) (← links)
- Exploiting verified neural networks via floating point numerical error (Q2145326) (← links)
- Correct approximation of IEEE 754 floating-point arithmetic for program verification (Q2152274) (← links)
- Optimal inverse projection of floating-point addition (Q2299211) (← links)
- Incrementally closing octagons (Q2335904) (← links)
- When Is a Formula a Loop Invariant? (Q2945711) (← links)
- Linear Absolute Value Relation Analysis (Q3000578) (← links)
- Mutation-Based Test Case Generation for Simulink Models (Q3066126) (← links)
- Static Contract Checking with Abstract Interpretation (Q3067530) (← links)
- Static Analysis of Finite Precision Computations (Q3075485) (← links)
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships (Q3392932) (← links)
- Polynomial Precise Interval Analysis Revisited (Q3644736) (← links)
- Compact Difference Bound Matrices (Q5056006) (← links)
- Checking Compatibility of Bit Sizes in Floating Point Comparison Operations (Q5170177) (← links)
- Approximating the volume of tropical polytopes is difficult (Q5742783) (← links)