Sciweavers

1494 search results - page 78 / 299
» Less Extreme Programming
Sort
View
224
Voted
ICFP
2009
ACM
16 years 3 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
OOPSLA
2005
Springer
15 years 7 months ago
Ercatons and organic programming: say good-bye to planned economy
Organic programming (OP) is our proposed and already emerging programming model which overcomes some of the limitations of current practice in software development in general and ...
Oliver Imbusch, Falk Langhammer, Guido von Walter
124
Voted
LPKR
1997
Springer
15 years 6 months ago
Knowledge Representation with Logic Programs
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
Gerhard Brewka, Jürgen Dix
OOPSLA
2004
Springer
15 years 7 months ago
The garbage collection advantage: improving program locality
As improvements in processor speed continue to outpace improvements in cache and memory speed, poor locality increasingly degrades performance. Because copying garbage collectors ...
Xianglong Huang, Stephen M. Blackburn, Kathryn S. ...
ESEC
1999
Springer
15 years 6 months ago
Yesterday, My Program Worked. Today, It Does Not. Why?
Imagine some program and a number of changes. If none of these changes is applied (“yesterday”), the program works. If all changes are applied (“today”), the program does n...
Andreas Zeller