Sciweavers

1528 search results - page 101 / 306
» Performance Assertion Checking
Sort
View
ASPLOS
2010
ACM
14 years 5 months ago
Dynamic filtering: multi-purpose architecture support for language runtime systems
This paper introduces a new abstraction to accelerate the readbarriers and write-barriers used by language runtime systems. We exploit the fact that, dynamically, many barrier exe...
Tim Harris, Sasa Tomic, Adrián Cristal, Osm...
CVPR
1997
IEEE
15 years 3 days ago
Global Training of Document Processing Systems Using Graph Transformer Networks
We propose a new machine learning paradigm called Graph Transformer Networks that extends the applicability of gradient-based learning algorithms to systems composed of modules th...
Léon Bottou, Yoshua Bengio, Yann LeCun
LCN
2007
IEEE
14 years 4 months ago
Detecting Black Hole Attacks in Tactical MANETs using Topology Graphs
Abstract— Black Hole Attacks are a serious threat to communication in tactical MANETs. In this work we present TOGBAD a new centralised approach, using topology graphs to identif...
Elmar Gerhards-Padilla, Nils Aschenbruck, Peter Ma...
FMCAD
2007
Springer
14 years 4 months ago
Induction in CEGAR for Detecting Counterexamples
— Induction has been studied in model checking for proving the validity of safety properties, i.e., showing the absence of counterexamples. To our knowledge, induction has not be...
Chao Wang, Aarti Gupta, Franjo Ivancic
CHARME
2005
Springer
120views Hardware» more  CHARME 2005»
14 years 3 months ago
How Thorough Is Thorough Enough?
Abstraction is the key for effectively dealing with the state explosion in model-checking. Unfortunately, finding abstractions which are small and yet enable us to get conclusive ...
Arie Gurfinkel, Marsha Chechik