203 search results - page 2 / 41 » Pushdown Module Checking |
CONCUR
2006
Springer
13 years 9 months ago
2006
Springer
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
FSTTCS
2001
Springer
13 years 10 months ago
2001
Springer
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...
TACAS
2005
Springer
13 years 11 months ago
2005
Springer
We present a tool for finding errors in Java programs that translates Java bytecodes into symbolic pushdown systems, which are then checked by the Moped tool [1].
FOSSACS
2009
Springer
14 years 12 days ago
2009
Springer
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...
SOFSEM
2012
Springer
12 years 1 months ago
2012
Springer
Visibly Pushdown Transducers (VPT) form a subclass of pushdown transducers. In this paper, we investigate the extension of VPT with visibly pushdown look-ahead (VPTla). Their trans...