Sciweavers

1675 search results - page 161 / 335
» Some thoughts on teaching programming and programming langua...
Sort
View
ICLP
2005
Springer
15 years 10 months ago
Techniques for Scaling Up Analyses Based on Pre-interpretations
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
129
Voted
SCAM
2003
IEEE
15 years 10 months ago
The Java System Dependence Graph
The Program Dependence Graph was introduced by Ottenstein and Ottenstein in 1984. It was suggested to be a suitable internal program representation for monolithic programs, for th...
Neil Walkinshaw, Marc Roper, Murray Wood
147
Voted
ECOOP
2010
Springer
15 years 9 months ago
Self-Replicating Objects for Multicore Platforms
The paper introduces Self-Replicating Objects (SROs), a new nt programming abstraction. An SRO is implemented and used much like an ordinary .NET object and can expose arbitrary us...
Krzysztof Ostrowski, Chuck Sakoda, Ken Birman
APLAS
2000
ACM
15 years 9 months ago
An Open Environment for Cooperative Equational Solving
We describe a system called CFLP which aims at the integration of the best features of functional logic programming (FLP), cooperative constraint solving (CCS), and distributed co...
Tetsuo Ida, Mircea Marin
139
Voted
PLILP
1992
Springer
15 years 9 months ago
Unfold/fold Transformations Preserving Termination Properties
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
Torben Amtoft