632 search results - page 56 / 127 » Explicit Substitutions and Programming Languages |
PLDI
2004
ACM
14 years 1 months ago
2004
ACM
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
UAI
2004
13 years 9 months ago
2004
Defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning from incomplete and potentially inconsistent knowledge. ...
PEPM
1993
ACM
13 years 11 months ago
1993
ACM
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
CLIMA
2007
13 years 9 months ago
2007
Over the years, Logic Programming has proved to be a good and natural tool for expressing, querying and manipulating explicit knowledge in many areas of computer science. However, ...
ECOOP
2009
Springer
14 years 8 months ago
2009
Springer
The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annota...