Sciweavers

2035 search results - page 284 / 407
» On the complexity of stratified logics
Sort
View
118
Voted
ICFP
2008
ACM
16 years 23 days ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
100
Voted
LCTRTS
2009
Springer
15 years 7 months ago
Debugging FPGA-based packet processing systems through transaction-level communication-centric monitoring
The fine-grained parallelism inherent in FPGAs has encouraged their use in packet processing systems. Debugging and performance evaluation of such complex designs can be signifi...
Paul Edward McKechnie, Michaela Blott, Wim Vanderb...
95
Voted
DATE
2009
IEEE
122views Hardware» more  DATE 2009»
15 years 7 months ago
Model-based synthesis and optimization of static multi-rate image processing algorithms
Abstract—High computational effort in modern image processing applications like medical imaging or high-resolution video processing often demands for massively parallel special p...
Joachim Keinert, Hritam Dutta, Frank Hannig, Chris...
CCS
2007
ACM
15 years 7 months ago
Specifying and analyzing security automata using CSP-OZ
Security automata are a variant of B¨uchi automata used to specify security policies that can be enforced by monitoring system execution. In this paper, we propose using CSP-OZ, ...
David A. Basin, Ernst-Rüdiger Olderog, Paul E...
125
Voted
CONCUR
2007
Springer
15 years 7 months ago
Pushdown Module Checking with Imperfect Information
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...
Benjamin Aminof, Aniello Murano, Moshe Y. Vardi