Sciweavers

277 search results - page 10 / 56
» Towards an automatic complexity analysis for generic program...
Sort
View
ESOP
2010
Springer
14 years 4 months ago
Amortized Resource Analysis with Polynomial Potential - A Static Inference of Polynomial Bounds for Functional Programs
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs. ...
Jan Hoffmann and Martin Hofmann
ESOP
2010
Springer
14 years 2 months ago
Amortized Resource Analysis with Polynomial Potential
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs....
Jan Hoffmann 0002, Martin Hofmann
CODES
2006
IEEE
14 years 1 months ago
Generic netlist representation for system and PE level design exploration
Designer productivity and design predictability are vital factors for successful embedded system design. Shrinking time-to-market and increasing complexity of these systems requir...
Bita Gorjiara, Mehrdad Reshadi, Pramod Chandraiah,...
ICISC
2009
169views Cryptology» more  ICISC 2009»
13 years 5 months ago
Generic One Round Group Key Exchange in the Standard Model
Minimizing complexity of group key exchange (GKE) protocols is an important milestone towards their practical deployment. An interesting approach to achieve this goal is to simplif...
M. Choudary Gorantla, Colin Boyd, Juan Manuel Gonz...
DMS
2010
147views Multimedia» more  DMS 2010»
13 years 5 months ago
Towards Security-aware Program Visualization for Analyzing In-lined Reference Monitors
In-lined Reference Monitoring frameworks are an emerging technology for enforcing security policies over untrusted, mobile, binary code. However, formulating correct policy specifi...
Aditi Patwardhan, Kevin W. Hamlen, Kendra Cooper