PPL
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Applications of polyhedral computations to the analysis and verification of hardware and software systems
- Apron
- COSTA
- DEMiCs
- GAVS
- IMITATOR
- MixedVol
- ChvatalIP
- Exact SCIP
- iRankFinder
- PaPILO
- ZRAM
- VINAS-P
- ECDAR
- LOGEN
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
- PHAVer
- HyTech
- SMV
- ECCE
- On clock-aware LTL parameter synthesis of timed automata
- RSOLVER
- cddplus
- azove
- Tracking smooth trajectories in linear hybrid systems
- Realizability and inscribability for simplicial polytopes via nonlinear optimization
- Gfan
- Uppaal
- New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem
- lrs
- barvinok
- ARMC
- Dagger
- PURRS
- Checking array bounds by abstract interpretation and symbolic expressions
- desing
- PGeomlib
- Unimodularity
- ATGen
- HSolver
- Convex
- Algorithms for tight spans and tropical linear spaces
- A dynamic F4 algorithm to compute Gröbner bases
- Lackwit
- Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro}
- Interproc
- Soot
- Efficient convex zone merging in parametric timed automata
- NLTOOLBOX
- Experimental evaluation of numerical domains for inferring ranges
- On the efficiency of convex polyhedra
- TRACER
- Relational string abstract domains
- PyEcdar
- QUASY
- InvGen
- Abstraction based verification of stability of polyhedral switched systems
- PolyLib
- SIMP
- HSF
- Refinements of behavioural abstractions for the supervisory control of hybrid systems
- TropLi
- Even convexity and optimization. Handling strict inequalities
- PPLite: zero-overhead encoding of NNC polyhedra
- Exact join detection for convex polyhedra and other numerical abstractions
- SpaceEx
- Template polyhedra and bilinear optimization
- Two variations of graph test in double description method
- Solving strong controllability of temporal problems with uncertainty using SMT
- Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques
- Shrinktech
- BACH
- Computing convex hulls and counting integer points with \texttt{polymake}
- On finite linear systems containing strict inequalities
- Ciao
- BENSOLVE
- Closed-form upper bounds in static cost analysis
- STL*: extending signal temporal logic with signal-value freezing operator
- SMAPO
- PANDA
- net.datastructures
- Unimodularity Test
- PRISM-games
- PAGAI
- StInG
- PAT
- CSSV
- Octagon
- ASTREE
- PrologCheck
- NewPolka
- Parameter synthesis for probabilistic timed automata using stochastic game abstractions
- infinite group relaxation
- Algorithms and programs for calculating the roots of polynomial of one or two variables
- IKOS
- ALICe
- Omega
- Polyhedral approximation of multivariate polynomials using Handelman's theorem
- Linear vector optimization and European option pricing under proportional transaction costs
This page was built for software: PPL
