Sciweavers

309 search results - page 41 / 62
» Termination proofs for systems code
Sort
View
ESOP
2007
Springer
14 years 1 months ago
A Complete Guide to the Future
Abstract We present the semantics and proof system for an objectoriented language with active objects, asynchronous method calls, and futures. The language, based on Creol, disting...
Frank S. de Boer, Dave Clarke, Einar Broch Johnsen
TII
2010
166views Education» more  TII 2010»
13 years 2 months ago
Source-to-Source Architecture Transformation for Performance Optimization in BIP
Behavior, Interaction, Priorities (BIP) is a component framework for constructing systems from a set of atomic components by using two kinds of composition operators: interactions ...
Marius Bozga, Mohamad Jaber, Joseph Sifakis
ICS
2010
Tsinghua U.
14 years 5 months ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
IJCAI
2003
13 years 9 months ago
Automated Reasoning: Past Story and New Trends
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
Andrei Voronkov
ERSHOV
1999
Springer
14 years 11 hour ago
Binding-Time Analysis in Partial Evaluation: One Size Does Not Fit All
Abstract. Existing partial evaluators usually fix the strategy for binding-time analysis. But a single strategy cannot fulfill all goals without leading to compromises regarding ...
Niels H. Christensen, Robert Glück, Sø...