PPL
From MaRDI portal
swMATH5357MaRDI QIDQ17497FDOQ17497
Author name not available (Why is that?)
Official website: http://bugseng.com/products/ppl
Cited In (only showing first 100 items - show all)
- Program Development in Computational Logic
- Static Analysis in Disjunctive Numerical Domains
- Continuous valuations of temporal logic specifications with applications to parameter optimization and robustness measures
- Static Analysis
- An integer static analysis for better extrapolation in Uppaal
- \textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- Formalizing the face lattice of polyhedra
- Analysis of Linear Hybrid Systems in CLP
- Formal Modeling and Analysis of Timed Systems
- Closed-form upper bounds in static cost analysis
- A zonotopic framework for functional abstractions
- Efficient constraint/generator removal from double description of polyhedra
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
- A new look at the automatic synthesis of linear ranking functions
- Stratified static analysis based on variable dependencies
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
- Ranking functions for linear-constraint loops
- Polyhedral approximation of multivariate polynomials using Handelman's theorem
- An iterative approach to precondition inference using constrained Horn clauses
- Discovering invariants via simple component analysis
- Parametric schedulability analysis of a launcher flight control system under reactivity constraints
- Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems
- Real tropical hyperfaces by patchworking in \texttt{polymake}
- Verification, Model Checking, and Abstract Interpretation
- Applications of polyhedral computations to the analysis and verification of hardware and software systems
- Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets
- Reachability analysis for timed automata using max-plus algebra
- Verifying generalized soundness of workflow nets
- PPLite: zero-overhead encoding of NNC polyhedra
- Template polyhedra and bilinear optimization
- Computing convex hulls and counting integer points with \texttt{polymake}
- On clock-aware LTL parameter synthesis of timed automata
- LTL parameter synthesis of parametric timed automata
- Quantitative verification and strategy synthesis for stochastic games
- A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture
- Experimental evaluation of numerical domains for inferring ranges
- A computational status update for exact rational mixed integer programming
- Verification of Hybrid Systems
- Deriving numerical abstract domains via principal component analysis
- Parametric Deadlock-Freeness Checking Timed Automata
- Exact join detection for convex polyhedra and other numerical abstractions
- MultiGain
- Avoiding geometric intersection operations in reachability analysis of hybrid systems
- On finite linear systems containing strict inequalities
- A dynamic F4 algorithm to compute Gröbner bases
- The two variable per inequality abstract domain
- ChvatalIP
- Exact SCIP
- Information leakage analysis by abstract interpretation
- Solving non-linear Horn clauses using a linear Horn clause solver
- Hybridization for Stability Analysis of Switched Linear Systems
- Formalizing the Face Lattice of Polyhedra
- iRankFinder
- PaPILO
- SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
- STL*: extending signal temporal logic with signal-value freezing operator
- Magic-sets for localised analysis of Java bytecode
- Cost analysis of object-oriented bytecode programs
- Programming Languages and Systems
- Some ways to reduce the space dimension in polyhedra computations
- Quantum position verification in the random oracle model
- Shrinking of time Petri nets
- Symbolic model checking in non-Boolean domains
- Program Analysis Using Symbolic Ranges
- Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
- Generalizing the template polyhedral domain
- Robust synthesis for real-time systems
- Automatic synthesis of switching controllers for linear hybrid systems: safety control
- Merge and conquer: state merging in parametric timed automata
- Solving strong controllability of temporal problems with uncertainty using SMT
- Linear vector optimization and European option pricing under proportional transaction costs
- An Improved Tight Closure Algorithm for Integer Octagonal Constraints
- Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
- Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro}
- Realizability and inscribability for simplicial polytopes via nonlinear optimization
- Hybrid Systems: Computation and Control
- Algorithms for tight spans and tropical linear spaces
- DEMiCs
- GAVS
- IMITATOR
- Boxes: A Symbolic Abstract Domain of Boxes
- cddplus
- azove
- Gfan
- lrs
- barvinok
- ARMC
- Dagger
- Uppaal
- PURRS
- desing
- PGeomlib
- Unimodularity
- ATGen
- HSolver
- TRACER
- Convex
- PANDA
This page was built for software: PPL
