scientific article; zbMATH DE number 1979550
From MaRDI portal
Publication:4427903
zbMath1019.68591MaRDI QIDQ4427903
Sergey Berezin, Vijay Ganesh, David L. Dill
Publication date: 14 September 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2517/25170171.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25)
Related Items (8)
A layered algorithm for quantifier elimination from linear modular constraints ⋮ Bounded model checking of infinite state systems ⋮ String theories involving regular membership predicates: from practice to theory and back ⋮ Structural Presburger digit vector automata ⋮ Towards more efficient methods for solving regular-expression heavy string constraints ⋮ Cuts from proofs: a complete and practical technique for solving linear inequalities over integers ⋮ On the path-width of integer linear programming ⋮ The convex hull of a regular set of integer vectors is polyhedral and effectively computable
Uses Software
This page was built for publication:
