1204 search results - page 138 / 241 » Termination of Polynomial Programs |
106
click to vote
KBSE
2007
IEEE
15 years 7 months ago
2007
IEEE
Programmers have long used assertions to characterize properties of code. An assertion violation signals a corruption in the program state. At such a state, it is standard to term...
127
click to vote
TACAS
2012
Springer
13 years 8 months ago
2012
Springer
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
101
Voted
EUROCRYPT
2005
Springer
15 years 6 months ago
2005
Springer
The Lenstra-Lenstra-Lov´asz lattice basis reduction algorithm (LLL or L3 ) is a very popular tool in public-key cryptanalysis and in many other fields. Given an integer d-dimensi...
143
click to vote
HASKELL
2009
ACM
15 years 7 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
117
Voted
IFL
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Tracing a computation is a key method for program comprehension and debugging. Hat is a tracing system for Haskell 98 programs. During a computation a trace is recorded i...