Sciweavers

1392 search results - page 182 / 279
» Staging generic programming
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 9 months ago
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
Roberto Bagnara, Fred Mesnard, Andrea Pescetti, En...
ENDM
2000
116views more  ENDM 2000»
13 years 9 months ago
Conceptual Models for Combined Planning and Scheduling
Planning and scheduling attracts an unceasing attention of computer science community. Several research areas like Artificial Intelligence, Operations Research and Constraint Prog...
Roman Barták
OOPSLA
2010
Springer
13 years 7 months ago
A simple inductive synthesis methodology and its applications
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...
Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Moo...
GPCE
2009
Springer
13 years 6 months ago
Generating safe template languages
Template languages are widely used within generative programming, because they provide intuitive means to generate software artefacts expressed in a specific object language. Howe...
Florian Heidenreich, Jendrik Johannes, Mirko Seife...
ECOOP
2011
Springer
12 years 9 months ago
An Empirical Study of Object Protocols in the Wild
Abstract. An active area of research in computer science is the prevention of violations of object protocols, i.e., restrictions on temporal orderings of method calls on an object....
Nels E. Beckman, Duri Kim, Jonathan Aldrich