![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Science of Computer Programming, Volume 70
Volume 70, Number 1, January 2008
- Ralf Lämmel
:
Google's MapReduce programming model - Revisited. 1-30 - Zhenhua Duan, Xiaoxiao Yang, Maciej Koutny:
Framed temporal logic programming. 31-61 - Antonio Cicchetti
, Davide Di Ruscio
:
Decoupling web application concerns through weaving operations. 62-86
Volume 70, Numbers 2-3, February 2008
- Markus Aleksy
, Ralf Gitzel, John Waldron, James F. Power
:
PPPJ 2006 special issue - foreword. 87-88 - Feng Xian, Witawas Srisa-an, Hong Jiang:
Garbage collection: Java application servers' Achilles heel. 89-110 - Jeremy Singer
, Chris C. Kirkham:
Dynamic analysis of Java program concepts for visualization and profiling. 111-126 - Bernd Mathiske, Doug Simon, Dave Ungar:
An assembler and disassembler framework for JavaTMprogrammers. 127-148 - Yuji Chiba:
Java heap protection for debugging native methods. 149-167 - Chih-Chieh Yang, Chung-Kai Chen, Yu-Hao Chang, Kai-Hsin Chung, Jenq Kuen Lee:
Software architecture design for streaming Java RMI. 168-184 - Heinz Kredel:
On a Java computer algebra system, its performance and applications. 185-207 - Matthias Merz:
Enabling declarative security through the use of Java Data Objects. 208-220 - Raffaele Quitadamo, Giacomo Cabri
, Letizia Leonardi
:
Mobile JikesRVM: A framework to support transparent Java thread migration. 221-240
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.