Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

CAV
2006
Springer

favoriteEmaildiscussreport

110views Hardware» more CAV 2006»

Improving Pushdown System Model Checking

13 years 8 months ago

Improving Pushdown System Model Checking

Download www.cs.wisc.edu

Abstract. In this paper, we reduce pushdown system (PDS) model checking to a graphtheoretic problem, and apply a fast graph algorithm to improve the running time for model checking. Several other PDS questions and techniques can be carried out in the new setting, including witness tracing and incremental analysis, each of which benefits from the fast graph-based algorithm.

Akash Lal, Thomas W. Reps

Real-time Traffic

CAV 2006 | Fast Graph Algorithm | Fast Graph-based Algorithm | Hardware | Model Checking |

claim paper

Related Content

» FO Model Checking on Nested Pushdown Trees

» Model Checking CTL Properties of Pushdown Systems

» Pushdown Module Checking with Imperfect Information

» Conditional weighted pushdown systems and applications

» Beyond Regular Model Checking

» Pushdown Module Checking

» On Global Model Checking Trees Generated by HigherOrder Recursion Schemes

» The Complexity of Model Checking Collapsible HigherOrder Pushdown Systems

» Model Checking x86 Executables with CodeSurferx86 and WPDS

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	CAV
Authors	Akash Lal, Thomas W. Reps

Comments (0)