107 search results - page 14 / 22 » Program comprehension as fact finding |
110
Voted
AAAI
2006
15 years 1 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
116
click to vote
EMNLP
2010
14 years 9 months ago
2010
We present a new syntactic parser that works left-to-right and top down, thus maintaining a fully-connected parse tree for a few alternative parse hypotheses. All of the commonly ...
CACM
1998
14 years 11 months ago
1998
rigorous, and abstract— clearly defined and generally agreed—type inheritance model. To quote an article by Taivalsaari: “The basic idea of inheritance is quite simple ... [a...
99
Voted
SBACPAD
2005
IEEE
15 years 5 months ago
2005
IEEE
The time required to simulate a complete benchmark program using the cycle-accurate model of a microprocessor can be prohibitively high. One of the proposed methodologies, represe...
176
click to vote
POPL
2008
ACM
15 years 12 months ago
2008
ACM
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...