FAST

swMATH21268MaRDI QIDQ33078

No author found.

Related Items (42)

A case study on parametric verification of failure detectors ⋮ Improving the results of program analysis by abstract interpretation beyond the decreasing sequence ⋮ A Calculus for Modular Loop Acceleration ⋮ Forward analysis and model checking for trace bounded WSTS ⋮ Guiding Craig interpolation with domain-specific abstractions ⋮ Symbolic Model Checking in Non-Boolean Domains ⋮ Formal verification of real-time systems with preemptive scheduling ⋮ Structural Presburger digit vector automata ⋮ Some ways to reduce the space dimension in polyhedra computations ⋮ \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms ⋮ Acceleration of the abstract fixpoint computation in numerical program analysis ⋮ Applying abstract acceleration to (co-)reachability analysis of reactive programs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Verification of Flat FIFO Systems ⋮ Generalizing the Template Polyhedral Domain ⋮ Fair Termination for Parameterized Probabilistic Concurrent Systems ⋮ Reachability in Parameterized Systems: All Flavors of Threshold Automata ⋮ Experimenting Formal Proofs of Petri Nets Refinements ⋮ Forward Analysis and Model Checking for Trace Bounded WSTS ⋮ Verification of qualitative \(\mathbb Z\) constraints ⋮ Programs with lists are counter automata ⋮ Automated Technology for Verification and Analysis ⋮ Verification and falsification of programs with loops using predicate abstraction ⋮ Automatic Verification of Bossa Scheduler Properties ⋮ Automatic Verification of Counter Systems With Ranking Function ⋮ Reachability in Timed Counter Systems ⋮ Quantitative separation logic and programs with lists ⋮ Dense-choice counter machines revisited ⋮ Ehrenfeucht-Fraïssé goes automatic for real addition ⋮ The Power of Hybrid Acceleration ⋮ On the completeness of bounded model checking for threshold-based distributed algorithms: reachability ⋮ Abstraction refinement and antichains for trace inclusion of infinite state systems ⋮ Abstract Fixpoint Computations with Numerical Acceleration Methods ⋮ Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs ⋮ Unnamed Item ⋮ Don't care words with an application to the automata-based approach for real addition ⋮ How to Tackle Integer Weighted Automata Positivity ⋮ The convex hull of a regular set of integer vectors is polyhedral and effectively computable ⋮ Verification of programs with half-duplex communication ⋮ Expand, enlarge and check: new algorithms for the coverability problem of WSTS ⋮ Flat Petri nets (invited talk)

This page was built for software: FAST