Sciweavers

1291 search results - page 57 / 259
» Arithmetic program paths
Sort
View
FASE
2004
Springer
15 years 7 months ago
Automated Debugging Using Path-Based Weakest Preconditions
Abstract. Software debugging is the activity of locating and correcting erroneous statements in programs. Automated tools to locate and correct the erroneous statements in a progra...
Haifeng He, Neelam Gupta
122
Voted
JUCS
2010
142views more  JUCS 2010»
15 years 19 days ago
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
Eduardo Camponogara, Ricardo Boveto Shima
119
Voted
WCET
2010
15 years 1 days ago
A Code Policy Guaranteeing Fully Automated Path Analysis
Calculating the worst-case execution time (WCET) of real-time tasks is still a tedious job. Programmers are required to provide additional information on the program flow, analyzi...
Benedikt Huber, Peter P. Puschner
HEURISTICS
2002
155views more  HEURISTICS 2002»
15 years 2 months ago
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
Marie-Christine Costa, Alain Hertz, Michel Mittaz
GLVLSI
2007
IEEE
166views VLSI» more  GLVLSI 2007»
15 years 6 months ago
Efficient pipelining for modular multiplication architectures in prime fields
This paper presents a pipelined architecture of a modular Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline implementation o...
Nele Mentens, Kazuo Sakiyama, Bart Preneel, Ingrid...