Sciweavers

7103 search results - page 402 / 1421
» Program Generation and Components
Sort
View
166
Voted
ACL
1990
15 years 5 months ago
The Computational Complexity of Avoiding Conversational Implicatures
Referring expressions and other object descriptions should be maximal under the Local Brevity, No Unnecessary Components, and Lexical Preference preference rules; otherwise, they ...
Ehud Reiter
EMSOFT
2003
Springer
15 years 9 months ago
Schedule-Carrying Code
We introduce the paradigm of schedule-carrying code (SCC). A hard real-time program can be executed on a given platform only if there exists a feasible schedule for the real-time t...
Thomas A. Henzinger, Christoph M. Kirsch, Slobodan...
CADE
2009
Springer
16 years 4 months ago
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
Stephan Falke, Deepak Kapur
IWPC
2009
IEEE
15 years 10 months ago
Intensions are a key to program comprehension
The classical comprehension theories study relations between extensions, intensions, and names. Originally developed in linguistics and mathematics, these theories are applicable ...
Václav Rajlich
SPLC
2010
15 years 5 months ago
A Hybrid Approach to Feature-Oriented Programming in XVCL
Feature-Oriented Programming (FOP) is a programming paradigm for developing programs by composing features. It is especially useful for software product line development, as each p...
Hongyu Zhang, Stan Jarzabek