9626 search results - page 446 / 1926 » Invariant Based Programming |
139
click to vote
COMPSAC
2009
IEEE
15 years 11 months ago
2009
IEEE
Non-terminating programs are programs that legally perform unbounded computations. Though they are ubiquitous in real-world applications, testing these programs requires new theor...
191
click to vote
LPNMR
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Belief Logic Programming (BLP) is a novel form of quantitative logic programming in the presence of uncertain and inconsistent information, which was designed to be able ...
208
click to vote
CL
2000
Springer
15 years 11 months ago
2000
Springer
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...
145
click to vote
SAC
1999
ACM
15 years 11 months ago
1999
ACM
A computing using distributed objects provides a flexible and scalable programming on the distributed and parallel programming environment. People work together on a scientific re...
170
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Parallel programming continues to be difficult and error-prone, whether starting from specifications or from an existing sequential program. This paper presents (1) a methodology f...