The following pages link to PPL (Q17497):
Displaying 50 items.
- Algorithms and programs for calculating the roots of polynomial of one or two variables (Q2664516) (← links)
- Polyhedral Approximation of Multivariate Polynomials Using Handelman’s Theorem (Q2796046) (← links)
- Linear Vector Optimization and European Option Pricing Under Proportional Transaction Costs (Q2805756) (← links)
- Pruning Algorithms for Pretropisms of Newton Polytopes (Q2830024) (← links)
- Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems (Q2835688) (← links)
- Quantum Position Verification in the Random Oracle Model (Q2874527) (← links)
- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra (Q2931828) (← links)
- Sound Bit-Precise Numerical Domains (Q2961585) (← links)
- Avoiding geometric intersection operations in reachability analysis of hybrid systems (Q2986751) (← links)
- Hybridization for Stability Analysis of Switched Linear Systems (Q2988963) (← links)
- Generalizing the Template Polyhedral Domain (Q3000579) (← links)
- Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation (Q3066089) (← links)
- Information Leakage Analysis by Abstract Interpretation (Q3075542) (← links)
- Interpolation-Based Height Analysis for Improving a Recurrence Solver (Q3167525) (← links)
- Verification of Hybrid Systems (Q3176388) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
- Parametric Deadlock-Freeness Checking Timed Automata (Q3179417) (← links)
- Verifying Generalized Soundness of Workflow Nets (Q3401950) (← links)
- SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities (Q3600478) (← links)
- Program Analysis Using Symbolic Ranges (Q3612010) (← links)
- Static Analysis in Disjunctive Numerical Domains (Q3613374) (← links)
- Analysis of Linear Hybrid Systems in CLP (Q3617430) (← links)
- Cardinality Abstraction for Declarative Networking Applications (Q3636882) (← links)
- Solving Horn Clauses on Inductive Data Types Without Induction (Q4559806) (← links)
- An iterative approach to precondition inference using constrained Horn clauses (Q4559813) (← links)
- LTL Parameter Synthesis of Parametric Timed Automata (Q4571131) (← links)
- Tree dimension in verification of constrained Horn clauses (Q4644355) (← links)
- (Q4813408) (← links)
- Deriving Numerical Abstract Domains via Principal Component Analysis (Q4930722) (← links)
- Boxes: A Symbolic Abstract Domain of Boxes (Q4930734) (← links)
- (Q5015369) (← links)
- Parametric Schedulability Analysis of a Launcher Flight Control System under Reactivity Constraints* (Q5025034) (← links)
- Real Tropical Hyperfaces by Patchworking in polymake (Q5039573) (← links)
- Formalizing the Face Lattice of Polyhedra (Q5049001) (← links)
- (Q5094138) (← links)
- Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis (Q5108517) (← links)
- (Q5114822) (← links)
- Merge and Conquer: State Merging in Parametric Timed Automata (Q5166701) (← links)
- Stratified Static Analysis Based on Variable Dependencies (Q5170182) (← links)
- Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming (Q5233243) (← links)
- Automation of Quantitative Information-Flow Analysis (Q5300883) (← links)
- Programming Languages and Systems (Q5308685) (← links)
- (Q5358292) (← links)
- Fast polyhedra abstract domain (Q5370845) (← links)
- An Improved Tight Closure Algorithm for Integer Octagonal Constraints (Q5452703) (← links)
- Ranking Functions for Linear-Constraint Loops (Q5501930) (← links)
- Hybrid Systems: Computation and Control (Q5703927) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5711496) (← links)
- Program Development in Computational Logic (Q5712541) (← links)
- Parameter Synthesis Algorithms for Parametric Interval Markov Chains (Q5881537) (← links)
