Automated Technology for Verification and Analysis

DOI10.1007/11562948zbMath1170.68507OpenAlexW4300912265MaRDI QIDQ5491888

Jérôme Leroux, Sébastien Bardin, Alain Finkel, Philippe Schnoebelen

Publication date: 10 October 2006

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

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

zbMATH Keywords

accelerationsymbolic model checkingverification of infinite-state systems

Mathematics Subject Classification ID

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

Related Items (19)

A Calculus for Modular Loop Acceleration ⋮ Forward analysis and model checking for trace bounded WSTS ⋮ Regular model checking revisited ⋮ Accelerating worst case execution time analysis of timed automata models with cyclic behaviour ⋮ Applying abstract acceleration to (co-)reachability analysis of reactive programs ⋮ Bounded underapproximations ⋮ Unnamed Item ⋮ Verification of Flat FIFO Systems ⋮ Fair Termination for Parameterized Probabilistic Concurrent Systems ⋮ Forward Analysis and Model Checking for Trace Bounded WSTS ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ Reachability in Timed Counter Systems ⋮ Decidable models of integer-manipulating programs with recursive parallelism ⋮ On Verifying Fault Tolerance of Distributed Protocols ⋮ Accelerating Interpolation-Based Model-Checking ⋮ Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs ⋮ Bottom-Up Shape Analysis ⋮ Unnamed Item ⋮ Flat Petri nets (invited talk)

Uses Software

• TREX

This page was built for publication: Automated Technology for Verification and Analysis