Apron

swMATH45MaRDI QIDQ12818FDOQ12818

Author name not available (Why is that?)

Cited In (74)

• Two variations of graph test in double description method
• An Accurate Join for Zonotopes, Preserving Affine Input/Output Relations
• Inferring expected runtimes of probabilistic integer programs using expected sizes
• Automatic complexity analysis of integer programs via triangular weakly non-linear loops
• Title not available (Why is that?)
• Incremental closure for systems of two variables per inequality
• SyReNN: a tool for analyzing deep neural networks
• Incrementally closing octagons
• Towards Automatic Stability Analysis for Rely-Guarantee Proofs
• QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers
• Inferring Sufficient Conditions with Backward Polyhedral Under-Approximations
• Deriving Numerical Abstract Domains via Principal Component Analysis
• Polyhedral Approximation of Multivariate Polynomials Using Handelman’s Theorem
• A zonotopic framework for functional abstractions
• An abstract domain to infer symbolic ranges over nonnegative parameters
• Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
• Quantitative static analysis of communication protocols using abstract Markov chains
• Deductive verification of floating-point Java programs in KeY
• Automation of Quantitative Information-Flow Analysis
• Generalizing the Template Polyhedral Domain
• Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
• On the efficiency of convex polyhedra
• Acceleration of the abstract fixpoint computation in numerical program analysis
• Discovering invariants via simple component analysis
• Sound Non-statistical Clustering of Static Analysis Alarms
• Deciding floating-point logic with abstract conflict driven clause learning
• Proper orthogonal decomposition and low-dimensional approximation of wall pressure fluctuation
• Behavioral Cartography of Timed Automata
• 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
• Donut Domains: Efficient Non-convex Domains for Abstract Interpretation
• Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
• Automatic Verification of Determinism for Structured Parallel Programs
• Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions
• Thread-modular analysis of release-acquire concurrency
• Title not available (Why is that?)
• Compact Difference Bound Matrices
• An abstract domain to discover interval linear equalities
• Lower Runtime Bounds for Integer Programs
• Experimental evaluation of numerical domains for inferring ranges
• Learning analysis strategies for Octagon and context sensitivity from labeled data generated by static analyses
• Certified Roundoff Error Bounds Using Semidefinite Programming
• Symbolic supervisory control of infinite transition systems under partial observation using abstract interpretation
• Cyclic Schedule for Apron Services
• Finding suitable variability abstractions for lifted analysis
• Fast polyhedra abstract domain
• Efficient Elimination of Redundancies in Polyhedra by Raytracing
• Formalizing the Face Lattice of Polyhedra
• Static Analysis of Finite Precision Computations
• The octagon abstract domain
• Title not available (Why is that?)
• Decentralized control of infinite systems
• Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data
• Static Contract Checking with Abstract Interpretation
• 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
• Stratified Static Analysis Based on Variable Dependencies
• 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
• Title not available (Why is that?)
• Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming
• 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
• Block-Wise Abstract Interpretation by Combining Abstract Domains with SMT
• Static Analysis of Communicating Processes Using Symbolic Transducers
• Linear Absolute Value Relation Analysis
• The analytical research of self-sustained oscillation system with the piecewise model of dry friction
• Precise Interprocedural Analysis in the Presence of Pointers to the Stack
• Title not available (Why is that?)

This page was built for software: Apron