Sciweavers

1407 search results - page 167 / 282
» Using Use Cases in Executable Z
Sort
View
ESOP
2005
Springer
15 years 9 months ago
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Véronique Cortier, Bogdan Warinschi
IFM
1999
Springer
15 years 8 months ago
Retrenchment and Punctured Simulation
: Some of the shortcomings of using refinement alone as the means of passing from high level simple models to actual detailed implementations are reviewed. Retrenchment is presente...
Richard Banach, Michael Poppleton
DATE
1997
IEEE
89views Hardware» more  DATE 1997»
15 years 8 months ago
Cone-based clustering heuristic for list-scheduling algorithms
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
Sriram Govindarajan, Ranga Vemuri
INFOCOM
1997
IEEE
15 years 8 months ago
An Algorithm to Compute Collusion Paths
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...
Steven H. Low, Nicholas F. Maxemchuk
CASES
2006
ACM
15 years 8 months ago
Efficient architectures through application clustering and architectural heterogeneity
Customizing architectures for particular applications is a promising approach to yield highly energy-efficient designs for embedded systems. This work explores the benefits of arc...
Lukasz Strozek, David Brooks