Verification, Model Checking, and Abstract Interpretation

DOI10.1007/11609773MaRDI QIDQ5898609zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Ideal abstractions for well-structured transition systems
• Expand, enlarge and check: new algorithms for the coverability problem of WSTS
• The ideal view on Rackoff's coverability technique
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Computer Aided Verification

Cited in

(16)

• Handling infinitely branching well-structured transition systems
• Petri nets with name creation for transient secure association
• Expand, enlarge and check: new algorithms for the coverability problem of WSTS
• Ideal abstractions for well-structured transition systems
• The Theory of WSTS: The Case of Complete WSTS
• Efficient coverability analysis by proof minimization
• Forward analysis for WSTS, part I: completions
• Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
• Regular separability of well-structured transition systems
• View abstraction -- a tutorial (invited paper)
• A Forward-Backward Abstraction Refinement Algorithm
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Computer Aided Verification
• Hardness results for coverability problem of well-structured pushdown systems
• The ideal view on Rackoff's coverability technique
• Multiset rewriting for the verification of depth-bounded processes with name binding

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 Q5898609)