Apron
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Static contract checking with abstract interpretation
- Abstract domains for automated reasoning about list-manipulating programs with infinite data
- Inferring sufficient conditions with backward polyhedral under-approximations
- Automation of quantitative information-flow analysis
- Learning analysis strategies for Octagon and context sensitivity from labeled data generated by static analyses
- Symbolic supervisory control of infinite transition systems under partial observation using abstract interpretation
- Deriving numerical abstract domains via principal component analysis
- Cyclic Schedule for Apron Services
- Finding suitable variability abstractions for lifted analysis
- Fast polyhedra abstract domain
- Code2Inv
- The octagon abstract domain
- Formalizing the Face Lattice of Polyhedra
- Decentralized control of infinite systems
- iRankFinder
- CLN2INV
- Automatic verification of determinism for structured parallel programs
- Why does Astrée scale up?
- Construction of the underground contour of a hydraulic structure with constant flow velocity sections
- The Estimation of Integral Seepage Characteristics of Hydraulic Structures in Terms of the Theory of Inverse Boundary-Value Problems
- Computing Program Reliability Using Forward-Backward Precondition Analysis and Model Counting
- Generalizing the template polyhedral domain
- Behavioral cartography of timed automata
- Automatically Refining Abstract Interpretations
- An array content static analysis based on non-contiguous partitions
- Effective abstractions for verification under relaxed memory models
- Inference of ranking functions for proving temporal properties by abstract interpretation
- scientific article; zbMATH DE number 1149866 (Why is no real title available?)
- Two variations of graph test in double description method
- scientific article; zbMATH DE number 1165625 (Why is no real title available?)
- Sound non-statistical clustering of static analysis alarms
- Inferring expected runtimes of probabilistic integer programs using expected sizes
- Automatic complexity analysis of integer programs via triangular weakly non-linear loops
- Incremental closure for systems of two variables per inequality
- SyReNN: a tool for analyzing deep neural networks
- Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming
- Donut domains: efficient non-convex domains for abstract interpretation
- Formalizing the face lattice of polyhedra
- Incrementally closing octagons
- Towards Automatic Stability Analysis for Rely-Guarantee Proofs
- Precise thread-modular abstract interpretation of concurrent programs using relational interference abstractions
- QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers
- An abstract domain to infer symbolic ranges over nonnegative parameters
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
- Response of velocity and turbulence in submerged wall jets to abrupt changes from smooth to rough beds and its application to scour downstream of an apron
- Linear absolute value relation analysis
- A zonotopic framework for functional abstractions
- Quantitative static analysis of communication protocols using abstract Markov chains
- Deductive verification of floating-point Java programs in KeY
- Static analysis of communicating processes using symbolic transducers
- Block-wise abstract interpretation by combining abstract domains with SMT
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
- Stratified static analysis based on variable dependencies
- On the efficiency of convex polyhedra
- Acceleration of the abstract fixpoint computation in numerical program analysis
- Discovering invariants via simple component analysis
- Polyhedral approximation of multivariate polynomials using Handelman's theorem
- Lower runtime bounds for integer programs
- Certified roundoff error bounds using semidefinite programming
- Deciding floating-point logic with abstract conflict driven clause learning
- Proper orthogonal decomposition and low-dimensional approximation of wall pressure fluctuation
- Automated formal analysis and verification: an overview
- Determination of the underground contour of a submerged apron with a region of constant velocity when there is a salt backwater.
- Conflict-driven conditional termination
- PPLite: zero-overhead encoding of NNC polyhedra
- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
- Static analysis of finite precision computations
- An accurate join for zonotopes, preserving affine input/output relations
- Queuing models used to investigate technical logistics
- Efficient elimination of redundancies in polyhedra by raytracing
- Precise interprocedural analysis in the presence of pointers to the stack
- Thread-modular analysis of release-acquire concurrency
- scientific article; zbMATH DE number 5289321 (Why is no real title available?)
- TREX
- ARMC
- Aspic
- Dagger
- PPL
- SMACS
- TERMINATOR
- JACK
- NLCertify
- SymmPa
- Lackwit
- SYMBA
- Interproc
- Soot
- PolyLib
- FixBag
- Quicr
- TPDB
- PAGAI
- ASTREE
- SymDiff
- FunArray
- Octagon
- NewPolka
- IKOS
- ALICe
- KITTeL
This page was built for software: Apron
