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
• 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
• Realizability and inscribability for simplicial polytopes via nonlinear optimization
• A new look at the automatic synthesis of linear ranking functions
• Stratified static analysis based on variable dependencies
• Hybrid Systems: Computation and Control
• 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}
• 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
• 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}
• 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
• Deriving numerical abstract domains via principal component analysis
• Parametric Deadlock-Freeness Checking Timed Automata
• Exact join detection for convex polyhedra and other numerical abstractions
• 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
• Information leakage analysis by abstract interpretation
• Parameter synthesis for hierarchical concurrent real-time systems
• 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
• 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
• Quantum position verification in the random oracle model
• Shrinking of time Petri nets
• \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
• Symbolic model checking in non-Boolean domains
• New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem
• 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
• Control-flow refinement by partial evaluation, and its application to termination and cost analysis
• Two variations of graph test in double description method
• Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming
• Efficient convex zone merging in parametric timed automata
• 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
• Interpolation-based height analysis for improving a recurrence solver
• Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
• 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
• Constraint-based abstract semantics for temporal logic: a direct approach to design and implementation
• LTL parameter synthesis of parametric timed automata
• Relational string abstract domains
• Automation of quantitative information-flow analysis
• A computational status update for exact rational mixed integer programming
• Checking array bounds by abstract interpretation and symbolic expressions
• Tracking smooth trajectories in linear hybrid systems
• Abstraction based verification of stability of polyhedral switched systems

This page was built for software: PPL