PPL

swMATH5357MaRDI QIDQ17497FDOQ17497

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro}
• 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
• Analysis of Linear Hybrid Systems in CLP
• Quantum Position Verification in the Random Oracle Model
• Formal Modeling and Analysis of Timed Systems
• Closed-form upper bounds in static cost analysis
• Symbolic Model Checking in Non-Boolean Domains
• Deriving Numerical Abstract Domains via Principal Component Analysis
• Polyhedral Approximation of Multivariate Polynomials Using Handelman’s Theorem
• A zonotopic framework for functional abstractions
• Efficient constraint/generator removal from double description of polyhedra
• Linear Vector Optimization and European Option Pricing Under Proportional Transaction Costs
• Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
• Generalizing the Template Polyhedral Domain
• Realizability and inscribability for simplicial polytopes via nonlinear optimization
• A new look at the automatic synthesis of linear ranking functions
• Hybrid Systems: Computation and Control
• Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
• Title not available (Why is that?)
• An iterative approach to precondition inference using constrained Horn clauses
• Discovering invariants via simple component analysis
• Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems
• Algorithms for tight spans and tropical linear spaces
• 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
• PPLite: zero-overhead encoding of NNC polyhedra
• Template polyhedra and bilinear optimization
• Computing convex hulls and counting integer points with \texttt{polymake}
• 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
• Boxes: A Symbolic Abstract Domain of Boxes
• Parametric Deadlock-Freeness Checking Timed Automata
• Exact join detection for convex polyhedra and other numerical abstractions
• Merge and Conquer: State Merging in Parametric Timed Automata
• Avoiding geometric intersection operations in reachability analysis of hybrid systems
• On finite linear systems containing strict inequalities
• Fast polyhedra abstract domain
• A dynamic F4 algorithm to compute Gröbner bases
• The two variable per inequality abstract domain
• Parameter synthesis for hierarchical concurrent real-time systems
• Hybridization for Stability Analysis of Switched Linear Systems
• Formalizing the Face Lattice of Polyhedra
• Title not available (Why is that?)
• Verifying Generalized Soundness of Workflow Nets
• SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
• Magic-sets for localised analysis of Java bytecode
• Cost analysis of object-oriented bytecode programs
• Programming Languages and Systems
• Title not available (Why is that?)
• Some ways to reduce the space dimension in polyhedra computations
• Shrinking of time Petri nets
• \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
• Parametric Schedulability Analysis of a Launcher Flight Control System under Reactivity Constraints*
• Real Tropical Hyperfaces by Patchworking in polymake
• New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem
• Stratified Static Analysis Based on Variable Dependencies
• Program Analysis Using Symbolic Ranges
• Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
• Robust synthesis for real-time systems
• Automatic synthesis of switching controllers for linear hybrid systems: safety control
• Information Leakage Analysis by Abstract Interpretation
• Solving strong controllability of temporal problems with uncertainty using SMT
• An Improved Tight Closure Algorithm for Integer Octagonal Constraints
• Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
• Ranking Functions for Linear-Constraint Loops
• Two variations of graph test in double description method
• LTL Parameter Synthesis of Parametric Timed Automata
• Pruning Algorithms for Pretropisms of Newton Polytopes
• Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming
• Efficient convex zone merging in parametric timed automata
• Sound Bit-Precise Numerical Domains
• Automation of Quantitative Information-Flow Analysis
• Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques
• Cardinality Abstraction for Declarative Networking Applications
• Title not available (Why is that?)
• On the efficiency of convex polyhedra
• Even convexity and optimization. Handling strict inequalities
• Parameter synthesis for probabilistic timed automata using stochastic game abstractions
• Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
• Solving Horn Clauses on Inductive Data Types Without Induction
• On clock-aware LTL parameter synthesis of timed automata
• Parameter Synthesis Algorithms for Parametric Interval Markov Chains
• Algorithms and programs for calculating the roots of polynomial of one or two variables
• Relational string abstract domains
• A computational status update for exact rational mixed integer programming
• Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis
• Checking array bounds by abstract interpretation and symbolic expressions
• Interpolation-Based Height Analysis for Improving a Recurrence Solver

This page was built for software: PPL