scientific article; zbMATH DE number 1738295
From MaRDI portal
Publication:4529777
zbMath0984.68034MaRDI QIDQ4529777
Publication date: 6 May 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2053/20530155
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (25)
A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling ⋮ On the efficiency of convex polyhedra ⋮ Scalable polyhedral verification of recurrent neural networks ⋮ Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness ⋮ Static analysis of ReLU neural networks with tropical polyhedra ⋮ The octagon abstract domain ⋮ Discovering invariants via simple component analysis ⋮ Reachability analysis for timed automata using max-plus algebra ⋮ Magic-sets for localised analysis of Java bytecode ⋮ The two variable per inequality abstract domain ⋮ Incremental closure for systems of two variables per inequality ⋮ Generalizing the Template Polyhedral Domain ⋮ Improving Strategies via SMT Solving ⋮ Efficient SAT-based bounded model checking for software verification ⋮ Numerical invariants through convex relaxation and max-strategy iteration ⋮ TreeKs: A Functor to Make Numerical Abstract Domains Scalable ⋮ An Accurate Join for Zonotopes, Preserving Affine Input/Output Relations ⋮ Exact join detection for convex polyhedra and other numerical abstractions ⋮ Pentagons: a weakly relational abstract domain for the efficient validation of array accesses ⋮ A zonotopic framework for functional abstractions ⋮ Symbolic Model Checking of Hybrid Systems Using Template Polyhedra ⋮ Acceleration in Convex Data-Flow Analysis ⋮ Cooperative Query Answering by Abstract Interpretation ⋮ Speeding up the Constraint-Based Method in Difference Logic ⋮ Template polyhedra and bilinear optimization
This page was built for publication:
