Sciweavers

276 search results - page 36 / 56
» E-learning by Doing with Computational Logic
Sort
View
ACSAC
2003
IEEE
15 years 3 months ago
Efficient Minimum-Cost Network Hardening Via Exploit Dependency Graphs
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
Steven Noel, Sushil Jajodia, Brian O'Berry, Michae...
RECONFIG
2009
IEEE
172views VLSI» more  RECONFIG 2009»
15 years 4 months ago
Combined SCA and DFA Countermeasures Integrable in a FPGA Design Flow
Abstract—The main challenge when implementing cryptographic algorithms in hardware is to protect them against attacks that target directly the device. Two strategies are customar...
Shivam Bhasin, Jean-Luc Danger, Florent Flament, T...
CCS
2007
ACM
15 years 4 months ago
A simple and expressive semantic framework for policy composition in access control
In defining large, complex access control policies, one would like to compose sub-policies, perhaps authored by different organizations, into a single global policy. Existing po...
Glenn Bruns, Daniel S. Dantas, Michael Huth
116
Voted
ESOP
2000
Springer
15 years 1 months ago
Compile-Time Debugging of C Programs Working on Trees
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Jacob Elgaard, Anders Møller, Michael I. Sc...
DAC
2003
ACM
15 years 10 months ago
Making cyclic circuits acyclic
Cyclic circuits that do not hold state or oscillate are often the most convenient representation for certain functions, such as arbiters, and can easily be produced inadvertently ...
Stephen A. Edwards