1077 search results - page 121 / 216 » Introducing Software Engineering by means of Extreme Program... |
120
click to vote
PLDI
2004
ACM
15 years 10 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
233
Voted
POPL
2009
ACM
16 years 5 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
168
click to vote
LCPC
1995
Springer
15 years 8 months ago
1995
Springer
V-cal is a calculus designed to support the compilation of data parallel languages that allows to describe program transformations and optimizations as semantics preserving rewrite...
135
click to vote
IWSAS
2001
Springer
15 years 9 months ago
2001
Springer
The Infrastructure of modern society is controlled by software systems that are vulnerable to attack. Successful attacks on these systems can lead to catastrophic results; the sur...
124
click to vote
PEPM
2007
ACM
15 years 10 months ago
2007
ACM
Having been convinced of the potential benefits of partial evaluation, we wanted to conduct some experiments in our favourite Computer Algebra System, Maple. Maple is a large lan...