590 search results - page 69 / 118 » Non-Failure Analysis for Logic Programs |
144
click to vote
POPL
2011
ACM
14 years 5 months ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
127
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Quantum computer programming is emerging as a new subject domain from multidisciplinary research in quantum computing, computer science, mathematics (especially quantum logic, lamb...
239
click to vote
POPL
2007
ACM
16 years 3 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
157
click to vote
CADE
2009
Springer
16 years 3 months ago
2009
Springer
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...
166
click to vote
POPL
2010
ACM
16 years 9 days ago
2010
ACM
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...