4719 search results - page 566 / 944 » Newtonian program analysis |
157
click to vote
SCAM
2006
IEEE
16 years 25 days ago
2006
IEEE
Traditional program slicing requires two parameters: a program location and a variable, or perhaps a set of variables, of interest. Stop-list slicing adds a third parameter to the...
180
click to vote
ASPLOS
2004
ACM
16 years 8 days ago
2004
ACM
Sampling has been successfully used to identify performance optimization opportunities. We would like to apply similar techniques to check program correctness. Unfortunately, samp...
207
click to vote
ESOP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
193
click to vote
LFP
1992
15 years 8 months ago
1992
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
216
click to vote
SCP
1998
15 years 6 months ago
1998
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...