Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL

DOI10.1007/978-3-540-74128-2_4MaRDI QIDQ5423882zbMATH OpenOpenAlexFDO

Authors J. Hoffmann, Jan-Georg Smaus, Andrey Rybalchenko, Sebastian Kupferschmid, Andreas Podelski

Publication date 1 November 2007

Published in Model Checking and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74128-2_4

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Predicate Abstraction with Under-approximation Refinement
• scientific article; zbMATH DE number 549957
• Predicate Abstraction via Symbolic Decision Procedures
• Computer Aided Verification
• Verification, Model Checking, and Abstract Interpretation
• Combining Predicate Abstraction with Fixpoint Approximations
• Predicate abstraction in a program logic calculus
• Predicate Abstraction in a Program Logic Calculus

Cited in

(6)

• Fast Directed Model Checking Via Russian Doll Abstraction
• Model Checking Software
• Abstractions and pattern databases: the quest for succinctness and accuracy
• The Causal Graph Revisited for Directed Model Checking
• Mcta: heuristics and search for timed systems
• Transition-Based Directed Model Checking

Describes a project that uses

Uses Software

• ARMC
• Uppaal

This page was built for publication: Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL

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