Sciweavers

130 search results - page 4 / 26
» Efficiently Verifiable Escape Analysis
Sort
View
ICCAD
1994
IEEE
82views Hardware» more  ICCAD 1994»
14 years 16 days ago
A timing analysis algorithm for circuits with level-sensitive latches
For a logic design with level-sensitive latches, we need to validate timing signal paths which may flush through several latches. We developed efficient algorithms based on the mo...
Jin-fuw Lee, Donald T. Tang, C. K. Wong
AMAST
2008
Springer
13 years 10 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
CVPR
1998
IEEE
14 years 10 months ago
Efficient Multiple Model Recognition in Cluttered 3-D Scenes
We present a 3-D shape-based object recognition system for simultaneous recognition of multiple objects in scenes containing clutter and occlusion. Recognition is based on matchin...
Andrew Edie Johnson, Martial Hebert
JALC
2006
87views more  JALC 2006»
13 years 8 months ago
A Team Automaton Scenario for the Analysis of Security Properties of Communication Protocols
Formal methods are a popular means to specify and verify security properties of a variety of communication protocols. In this article we take a step towards the use of team automa...
Maurice H. ter Beek, Gabriele Lenzini, Marinella P...
DBSEC
2009
124views Database» more  DBSEC 2009»
13 years 9 months ago
Towards System Integrity Protection with Graph-Based Policy Analysis
Abstract. Identifying and protecting the trusted computing base (TCB) of a system is an important task, which is typically performed by designing and enforcing a system security po...
Wenjuan Xu, Xinwen Zhang, Gail-Joon Ahn