Sciweavers

193 search results - page 2 / 39
» Improving Pushdown System Model Checking
Sort
View
FSTTCS
2001
Springer
13 years 10 months ago
Beyond Regular Model Checking
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...
Dana Fisman, Amir Pnueli
LPAR
2005
Springer
13 years 11 months ago
Pushdown Module Checking
Model checking is a useful method to verify automatically the correctness of a system with respect to a desired behavior, by checking whether a mathematical model of the system sat...
Laura Bozzelli, Aniello Murano, Adriano Peron
FOSSACS
2009
Springer
14 years 6 days ago
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
Christopher Broadbent, C.-H. Luke Ong
FSTTCS
2010
Springer
13 years 2 months ago
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
Matthew Hague, Anthony Widjaja To
CAV
2005
Springer
99views Hardware» more  CAV 2005»
13 years 11 months ago
Model Checking x86 Executables with CodeSurfer/x86 and WPDS++
This paper presents a toolset for model checking x86 executables. The members of the toolset are CodeSurfer/x86, WPDS++, and the Path Inspector. CodeSurfer/x86 is used to extract a...
Gogul Balakrishnan, Thomas W. Reps, Nicholas Kidd,...