Sciweavers

4940 search results - page 559 / 988
» On the Complexity of Universal Programs
Sort
View
GI
1997
Springer
15 years 10 months ago
Persistent Object Systems: From Technology to Market
Abstract. This text describes how persistent object system technology developed in European basic research is being used by a small German startup software company to realize innov...
Andreas Gawecki, Florian Matthes, Joachim W. Schmi...
CAV
2008
Springer
122views Hardware» more  CAV 2008»
15 years 8 months ago
Thread Quantification for Concurrent Shape Analysis
In this paper we address the problem of shape analysis for concurrent programs. We present new algorithms, based on abstract interpretation, for automatically verifying properties ...
Josh Berdine, Tal Lev-Ami, Roman Manevich, G. Rama...
LREC
2008
112views Education» more  LREC 2008»
15 years 8 months ago
Linguistic Structure and Bilingual Informants Help Induce Machine Translation of Lesser-Resourced Languages
Producing machine translation (MT) for the many minority languages in the world is a serious challenge. Minority languages typically have few resources for building MT systems. Fo...
Christian Monson, Ariadna Font Llitjós, Vam...
USENIX
1993
15 years 8 months ago
The Nachos Instructional Operating System
In teaching operating systems at an undergraduate level, we believe that it is important to provide a project that is realistic enough to show how real operating systems work, yet...
Wayne A. Christopher, Steven J. Procter, Thomas E....
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 6 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon