Skip to search formSkip to main contentSkip to account menu

Flow*: An Analyzer for Non-linear Hybrid Systems

The tool Flow* performs Taylor model-based flowpipe construction for non-linear (polynomial) hybrid systems with a wide variety of optimizations including adaptive step sizes, adaptive selection of approximation orders and the heuristic selection of template directions for aggregation flowpipes.
View via Publisher (opens in a new tab)

The Scalasca performance toolset architecture

The current toolset architecture is reviewed, emphasizing its scalable design and the role of the different components in transforming raw measurement data into knowledge of application execution behavior.
View on Wiley (opens in a new tab)

Taylor Model Flowpipe Construction for Non-linear Hybrid Systems

This paper provides techniques for handling the effect of discrete transitions on Taylor model flow pipe construction and explores various solutions based on two ideas: domain contraction and range over-approximation.
View on IEEE (opens in a new tab)

PROPhESY: A PRObabilistic ParamEter SYnthesis Tool

ProPhESY, a tool for analyzing parametric Markov chains (MCs), can compute a rational function (i.e., a fraction of two polynomials in the model parameters) for reachability and expected reward objectives and supports the novel feature of conditional probabilities.
View via Publisher (opens in a new tab)

Building Bridges between Symbolic Computation and Satisfiability Checking

  • E. Ábrahám
  • Computer Science, Mathematics
    International Symposium on Symbolic and Algebraic…
  • 24 June 2015
Differences and similarities in their approaches are discussed, potentials of combining their strengths are highlighted, and the challenges that come with this task are discussed.
View on ACM (opens in a new tab)

SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving

During the last decade, popular SMT solvers have been extended step-by-step with a wide range of decision procedures for different theories, but configuring solvers this way is a tedious task with restricted options.
View via Publisher (opens in a new tab)

Accelerating Parametric Probabilistic Verification

A novel method for computing reachability probabilities of parametric discrete-time Markov chains whose transition probabilities are fractions of polynomials over a set of parameters based on a graph decomposition into strongly connected subgraphs combined with a novel factorization strategy for polynOMials.
View PDF on arXiv (opens in a new tab)

DTMC Model Checking by SCC Reduction

A model checking algorithm for DTMCs that also supports the generation of counterexamples is introduced, based on the detection and abstraction of strongly connected components, which offers abstract countereXamples, which can be interactively refined by the user.
View on IEEE (opens in a new tab)

Optimizing Bounded Model Checking for Linear Hybrid Systems

Improvements are tailored to lazy satisfiability solving and follow two complementary directions: first, the formula representation of the finite unfoldings of the transition relations of linear hybrid systems are optimized, and second, the Satisfiability checks are accelerated by accumulating and generalizing data that is generated during earlier satisfiability checks.
View via Publisher (opens in a new tab)

Minimal counterexamples for linear-time probabilistic verification

View via Publisher (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)