Verification, Model Checking, and Abstract Interpretation

DOI10.1007/11609773MaRDI QIDQ5898613zbMATH OpenOpenAlexFDO

Authors Sriram Sankaranarayanan, Michael A. Colón, Henny B. Sipma, Zohar Manna

Publication date 12 February 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11609773

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Relational queries computable in polynomial time
• Polynomial queries to relational data bases
• Publication:4728265
• An algorithm for handling many relational calculus queries efficiently.
• The complexity of evaluating relational queries
• Faster algorithms for alternating refinement relations
• Efficient Approximations of Conjunctive Queries
• scientific article; zbMATH DE number 3980481

Cited in

(22)

• Efficient SAT-based bounded model checking for software verification
• Tropical linear-fractional programming and parametric mean payoff games
• scientific article; zbMATH DE number 2090856 (Why is no real title available?)
• Linear absolute value relation analysis
• Alloy*: a general-purpose higher-order relational constraint solver
• On the efficiency of convex polyhedra
• Abstract interpretation meets convex optimization
• Finding relevant templates via the principal component analysis
• Polynomial approximations of the relational semantics of imperative programs
• Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems
• Applications of polyhedral computations to the analysis and verification of hardware and software systems
• A note on the inversion join for polyhedral analysis
• Canonical forms and widening for two variables per inequality systems
• Speeding up polyhedral analysis by identifying common constraints
• Change-of-bases abstractions for non-linear hybrid systems
• The abstract domain of parallelotopes
• The two variable per inequality abstract domain
• SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
• Symbolic analysis of linear hybrid automata -- 25 years later
• A change-based heuristic for static analysis with policy iteration
• Revisiting polyhedral analysis for hybrid systems
• Generalizing the template polyhedral domain

This page was built for publication: Verification, Model Checking, and Abstract Interpretation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5898613)