1071 search results - page 116 / 215 » Programming with enumerable sets of structures |
191
Voted
POPL
2006
ACM
16 years 28 days ago
2006
ACM
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
PLSA
1994
15 years 4 months ago
1994
Computer language paradigms offer linguistic abstractions and proof theories for expressing program implementations. Similarly, system architectures offer the hardware abstractions...
115
Voted
CPHYSICS
2006
15 years 20 days ago
2006
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
FECS
2008
15 years 2 months ago
2008
We report on the successful process of transitioning a 4th-year university software engineering capstone course from a waterfall approach to an iterative, more agile model. The se...
87
Voted
ICFP
2005
ACM
16 years 18 days ago
2005
ACM
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...