467 search results - page 5 / 94 » Program fields for continuous software |
CSEE
2010
Springer
14 years 7 months ago
2010
Springer
This paper shares the experiences and lessons learned from conducting an NSF-sponsored eight-week summer research program for ten undergraduate students from multiple universities...
111
click to vote
AISC
2010
Springer
15 years 29 days ago
2010
Springer
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
Workflow enactment systems are becoming an effective solution to ease programming, deployment and execution of distributed applications in several domains such as telecommunicatio...
ECOOPWEXCEPTION
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. This paper describes a scheme of manipulating (partial) continuations in imperative languages such as Java and C++ in a portable manner, where the portability means that ...
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...