16844 search results - page 244 / 3369 » How to Design Programs |
182
click to vote
SAS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
187
click to vote
IWPC
2005
IEEE
16 years 6 days ago
2005
IEEE
Program comprehension research can be characterized by both the theories that provide rich explanations about how programmers comprehend software, as well as the tools that are us...
155
click to vote
SPIN
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Model checking real programs has recently become an active research area. Programs however exhibit two characteristics that make model checking di cult: the complexity of...
173
click to vote
PLDI
2003
ACM
15 years 12 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
181
click to vote
ECOOP
1998
Springer
15 years 11 months ago
1998
Springer
This paper will lead you into the world of mobile agents, an emerging technology that makes it very much easier to design, implement, and maintain distributed systems. You will fin...