Sciweavers

4666 search results - page 562 / 934
» Equations on Timed Languages
Sort
View
EUROCRYPT
2012
Springer
13 years 9 months ago
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
Jean-Charles Faugère, Ludovic Perret, Chris...
SIGSOFT
2005
ACM
16 years 7 months ago
Dynamically discovering architectures with DiscoTect
One of the challenges for software architects is ensuring that an implemented system faithfully represents its architecture. We describe and demonstrate a tool, called DiscoTect, ...
Bradley R. Schmerl, David Garlan, Hong Yan
POPL
2002
ACM
16 years 7 months ago
CCured: type-safe retrofitting of legacy code
In this paper we propose a scheme that combines type inference and run-time checking to make existing C programs type safe. We describe the CCured type system, which extends that ...
George C. Necula, Scott McPeak, Westley Weimer
SIGMOD
2003
ACM
115views Database» more  SIGMOD 2003»
16 years 7 months ago
Temporal Coalescing with Now, Granularity, and Incomplete Information
This paper presents a novel strategy for temporal coalescing. Temporal coalescing merges the temporal extents of value-equivalent tuples. A temporal extent is usually coalesced of...
Curtis E. Dyreson
PLDI
2010
ACM
16 years 4 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger