1077 search results - page 127 / 216 » Introducing Software Engineering by means of Extreme Program... |
256
click to vote
POPL
2004
ACM
16 years 4 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
144
click to vote
POPL
1998
ACM
15 years 8 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
136
click to vote
SCAM
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we introduce 13 program slicing metrics for C language programs. These metrics use program slice information to measure the size, complexity, coupling, and cohesion...
151
click to vote
VMCAI
2009
Springer
15 years 11 months ago
2009
Springer
There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better...
131
click to vote
SIGSOFT
2007
ACM
16 years 5 months ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...