Verification, Model Checking, and Abstract Interpretation

DOI10.1007/11609773zbMath1176.68119OpenAlexW2496613029MaRDI QIDQ5898609

Laurent Van Begin, Pierre Ganty, Jean-François Raskin

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

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (9)

Ideal Abstractions for Well-Structured Transition Systems ⋮ Unnamed Item ⋮ Handling infinitely branching well-structured transition systems ⋮ Unnamed Item ⋮ Multiset rewriting for the verification of depth-bounded processes with name binding ⋮ Petri nets with name creation for transient secure association ⋮ A Forward-Backward Abstraction Refinement Algorithm ⋮ Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads ⋮ Forward analysis for WSTS, part I: completions

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