Sciweavers

184 search results - page 9 / 37
» Integer Polyhedra for Program Analysis
Sort
View
CC
2004
Springer
142views System Software» more  CC 2004»
14 years 1 months ago
A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization
Abstract. Several mathematical frameworks for static analysis of programs have been developed in the past decades. Although these tools are quite useful, they have still many limit...
Philippe Clauss, Irina Tchoupaeva
ARC
2009
Springer
137views Hardware» more  ARC 2009»
14 years 2 months ago
Heterogeneous Architecture Exploration: Analysis vs. Parameter Sweep
This paper argues the case for the use of analytical models in FPGA architecture layout exploration. We show that the problem when simplified, is amenable to formal optimization t...
Asma Kahoul, George A. Constantinides, Alastair M....
SIAMJO
2010
121views more  SIAMJO 2010»
13 years 6 months ago
Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
Identifying small groups of lines, whose removal would cause a severe blackout, is critical for the secure operation of the electric power grid. We show how power grid vulnerabilit...
Ali Pinar, Juan Meza, Vaibhav Donde, Bernard C. Le...
IADIS
2003
13 years 9 months ago
Data Extraction from Web Database Query Result Pages via Tagsets and Integer Sequences
The World Wide Web is a collection of databases as well as web sites. Databases associated with web sites provide public access via query forms on web pages. They constitute an en...
Jerome Robinson
CORR
2007
Springer
68views Education» more  CORR 2007»
13 years 7 months ago
An Improved Tight Closure Algorithm for Integer Octagonal Constraints
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella