A number p is a safe prime if both p and (p − 1)/2 are prime. This note describes a method of generating safe primes that is considerably faster than repeatedly generating random primes q until p = 2q + 1 is also prime.

What: We are developing a tool to track variables and their values in C programs as they change at runtime. Because of the low-level, unrestricted memory access the language allows, the challenge lies in collecting accurate information without disrupting the program’s execution. Our approach combines techniques from profiling with memory tracking to analyze dynamic allocation throughout the lif...

This paper describes a new approach to the analysis of dependencies in complex, pointer-based data structures. Structural information is provided by the programmer in the form of two-variable finite state automata (2FSA). Our method extracts data dependencies. For restricted forms of recursion, the data dependencies can be exact; however in general, we produce approximate, yet safe (i.e. overes...

Equivalent transformation has been proposed as a method ology for providing programs with appropriate data structures For in stance logic programs which use lists are transformed into equivalent programs that use di erence lists However lists and di erence lists are both usual terms and in this sense no new data structures are introduced in the transformation Since logic programming has xed dat...

„his p—per ™onsiders the pro˜lem of gener—ting ™oni™tEfree movement s™hedules for — set of vehi™les th—t —re oper—ting simult—neously in — ™ommon —irsp—™eF sn ˜oth ™ivili—n —ir tr—™ m—n—gement —nd milit—ry —ir ™—mp—ign pl—nning ™ontextsD it is ™ru™i—l th—t the movements of dierent vehi™les ˜e ™oordin—ted so —s to —void ™ollisions —nd ne—r missesF yur —ppro—™h st—rts from — view of —irsp—™e m—n—...