Sciweavers

16844 search results - page 327 / 3369
» How to Design Programs
Sort
View
POPL
2008
ACM
16 years 7 months ago
The design and implementation of typed scheme
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...
Sam Tobin-Hochstadt, Matthias Felleisen
DRM
2003
Springer
15 years 12 months ago
Obfuscation of design intent in object-oriented applications
Protection of digital data from unauthorized access is of paramount importance. In the past several years, much research has concentrated on protecting data from the standpoint of...
Mikhail Sosonkin, Gleb Naumovich, Nasir D. Memon
IFIP
1994
Springer
15 years 10 months ago
Domain-Oriented design Environments
Domain-oriented design environments are cooperative problem-solving systems that support designers in complex design tasks. In this paper we present the facilities and architectur...
Gerhard Fischer
SAS
2009
Springer
175views Formal Methods» more  SAS 2009»
16 years 7 months ago
Automatic Parallelization and Optimization of Programs by Proof Rewriting
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
Clément Hurlin
CPAIOR
2007
Springer
16 years 27 days ago
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal