Sciweavers

16844 search results - page 301 / 3369
» How to Design Programs
Sort
View
ACSAC
2003
IEEE
15 years 12 months ago
A Failure to Learn from the Past
On the evening of 2 November 1988, someone “infected” the Internet with a worm program. That program exploited flaws in utility programs in systems based on BSD-derived versi...
Eugene H. Spafford
JAVA
1999
Springer
15 years 11 months ago
Dynamic Denotational Semantics of Java
This chapter presents a dynamic denotational semantics of the Java programming language. This semantics covers almost the full range of the base language, excluding only concurrenc...
Jim Alves-Foss, Fong Shing Lam
ICLP
2010
Springer
15 years 10 months ago
Using Generalized Annotated Programs to Solve Social Network Optimization Problems
Abstract. Reasoning about social networks (labeled, directed, weighted graphs) is becoming increasingly important and there are now models of how certain phenomena (e.g. adoption o...
Paulo Shakarian, V. S. Subrahmanian, Maria Luisa S...
RE
2002
Springer
15 years 6 months ago
Extreme Programming Modified: Embrace Requirements Engineering Practices
Extreme Programming (XP) is an agile (lightweight) software development methodology and it becomes more and more popular. XP proposes many interesting practices, but it also has s...
Jerzy R. Nawrocki, Michal Jasiñski, Bartosz...
CPAIOR
2010
Springer
15 years 5 months ago
Automatically Exploiting Subproblem Equivalence in Constraint Programming
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
Geoffrey Chu, Maria Garcia de la Banda, Peter J. S...