Sciweavers

3335 search results - page 327 / 667
» Grid result checking
Sort
View
LICS
2006
IEEE
16 years 21 days ago
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
Dietrich Kuske, Markus Lohrey
FSTTCS
2004
Springer
16 years 2 days ago
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
Ahmed Bouajjani, Antoine Meyer
DATE
1998
IEEE
93views Hardware» more  DATE 1998»
15 years 11 months ago
Verification by Simulation Comparison using Interface Synthesis
One of the main tasks within the high-level synthesis (HLS) process is the verification problem to prove automatically the correctness of the synthesis results. Currently, the res...
Cordula Hansen, Arno Kunzmann, Wolfgang Rosenstiel
BIS
2008
133views Business» more  BIS 2008»
15 years 8 months ago
Deep Web Navigation by Example
Large portions of the Web are buried behind user-oriented interfaces, which can only be accessed by filling out forms. To make the therein contained information accessible to autom...
Yang Wang 0012, Thomas Hornung
DAC
2004
ACM
16 years 7 months ago
A general decomposition strategy for verifying register renaming
This paper describes a strategy for verifying data-hazard correctness of out-of-order processors that implement register-renaming. We define a set of predicates to characterize re...
Hazem I. Shehata, Mark Aagaard