Sciweavers

1710 search results - page 101 / 342
» High-Level Programs and Program Conditions
Sort
View
ECOOP
1998
Springer
14 years 11 days ago
The Complexity of Type Analysis of Object Oriented Programs
One of the price tags attached to the blessings that OO brings about is a drop in efficiency due to dynamic method dispatch. Much research effort is being spent on the problem of e...
Joseph Gil, Alon Itai
CRIWG
2004
13 years 9 months ago
Empirical Evaluation of Collaborative Support for Distributed Pair Programming
Pair programming is an Extreme Programming (XP) practice where two programmers work on a single computer to produce an artifact. Empirical evaluations have provided evidence that t...
Jesús Favela, Hiroshi Natsu, Cynthia B. P&e...
FPCA
1995
13 years 11 months ago
Constructing Functional Programs for Grammar Analysis Problems
This paper discusses the derivation of functional programs for grammar analysis problems, such as the Empty problem and the Reachable problem. Grammar analysis problems can be div...
Johan Jeuring, S. Doaitse Swierstra
POPL
2006
ACM
14 years 8 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand
PEPM
2007
ACM
14 years 2 months ago
Quasi-terminating logic programs for ensuring the termination of partial evaluation
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
Germán Vidal