Apron
From MaRDI portal
Cited in
(only showing first 100 items - show all)- iRankFinder
- CLN2INV
- TREX
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
- Conflict-driven conditional termination
- ARMC
- Dagger
- Aspic
- Incremental closure for systems of two variables per inequality
- PPL
- Learning analysis strategies for Octagon and context sensitivity from labeled data generated by static analyses
- SMACS
- TERMINATOR
- JACK
- SymmPa
- Inferring expected runtimes of probabilistic integer programs using expected sizes
- SYMBA
- NLCertify
- Lackwit
- Automatic complexity analysis of integer programs via triangular weakly non-linear loops
- Interproc
- Soot
- Experimental evaluation of numerical domains for inferring ranges
- On the efficiency of convex polyhedra
- Thread-modular analysis of release-acquire concurrency
- PolyLib
- Quicr
- FixBag
- TPDB
- PPLite: zero-overhead encoding of NNC polyhedra
- Deductive verification of floating-point Java programs in KeY
- SyReNN: a tool for analyzing deep neural networks
- Quantitative static analysis of communication protocols using abstract Markov chains
- Two variations of graph test in double description method
- Incrementally closing octagons
- Finding suitable variability abstractions for lifted analysis
- Proper orthogonal decomposition and low-dimensional approximation of wall pressure fluctuation
- SymDiff
- PAGAI
- Octagon
- ASTREE
- FunArray
- NewPolka
- IKOS
- ALICe
- Determination of the underground contour of a submerged apron with a region of constant velocity when there is a salt backwater.
- Polyhedral approximation of multivariate polynomials using Handelman's theorem
- An abstract domain to infer symbolic ranges over nonnegative parameters
- Lower runtime bounds for integer programs
- Automated formal analysis and verification: an overview
- KITTeL
- Abstract domains for automated reasoning about list-manipulating programs with infinite data
- Donut domains: efficient non-convex domains for abstract interpretation
- Sound non-statistical clustering of static analysis alarms
- QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers
- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
- Static analysis of communicating processes using symbolic transducers
- Block-wise abstract interpretation by combining abstract domains with SMT
- Efficient elimination of redundancies in polyhedra by raytracing
- Precise thread-modular abstract interpretation of concurrent programs using relational interference abstractions
- Linear absolute value relation analysis
- Generalizing the template polyhedral domain
- Precise interprocedural analysis in the presence of pointers to the stack
- Sparrow
- Static contract checking with abstract interpretation
- Static analysis of finite precision computations
- Certified roundoff error bounds using semidefinite programming
- Goblint
- BOXES
- FAST
- RAML
- ELINA
- Cyclic Schedule for Apron Services
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
- Queuing models used to investigate technical logistics
- DyTa
- LoAT
- scientific article; zbMATH DE number 5289321 (Why is no real title available?)
- FuncTion
- Behavioral cartography of timed automata
- The analytical research of self-sustained oscillation system with the piecewise model of dry friction
- Towards Automatic Stability Analysis for Rely-Guarantee Proofs
- An abstract domain to discover interval linear equalities
- SONOLAR
- Checkmate
- Bugbench
- The Estimation of Integral Seepage Characteristics of Hydraulic Structures in Terms of the Theory of Inverse Boundary-Value Problems
- Ultimate Taipan
- Verimag Polyhedra Library
- Symbolic supervisory control of infinite transition systems under partial observation using abstract interpretation
- Acceleration of the abstract fixpoint computation in numerical program analysis
- Discovering invariants via simple component analysis
- scientific article; zbMATH DE number 1149866 (Why is no real title available?)
- scientific article; zbMATH DE number 1165625 (Why is no real title available?)
- Fixpoint
- Vass
- Deciding floating-point logic with abstract conflict driven clause learning
- Deriving numerical abstract domains via principal component analysis
- Automatic verification of determinism for structured parallel programs
- Computing Program Reliability Using Forward-Backward Precondition Analysis and Model Counting
This page was built for software: Apron
