1776 search results - page 157 / 356 » Using a Logic Programming Language with Persistence and Cont... |
175
click to vote
POPL
2011
ACM
14 years 6 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
103
Voted
TPHOL
2007
IEEE
15 years 9 months ago
2007
IEEE
Cminor is a mid-level imperative programming language; there are proved-correct optimizing compilers from C to Cminor and from Cminor to machine language. We have redesigned Cminor...
110
click to vote
FLOPS
2010
Springer
15 years 10 months ago
2010
Springer
Disproof can be as important as proof in studying programs and programming languages. In particular, side conditions in a statement about program behavior are sometimes best unders...
111
click to vote
FASE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Software is often tested with unit tests, in which each procedure is executed in isolation, and its result compared with an expected value. Individual tests correspond to...
133
click to vote
PPDP
2004
Springer
15 years 8 months ago
2004
Springer
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry. Tracing computations is a difficult task due...