5506 search results - page 363 / 1102 » Minimal Logic Programs |
150
Voted
FAC
2008
15 years 5 months ago
2008
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
184
click to vote
CONCUR
1991
Springer
15 years 8 months ago
1991
Springer
Abstract. A syntax-directed formal system for the development of totally correct programs with respect to an (unfair) shared-state parallel programming language is proposed. The pr...
111
click to vote
FAC
2000
15 years 4 months ago
2000
Typically, program design involves constructing a program P that implements a given specification S; that is, the set P of executions of P is a subset of the set S of executions s...
139
click to vote
ENTCS
2002
15 years 4 months ago
2002
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
125
Voted
IJCAI
1989
15 years 6 months ago
1989
Fold-unfold is a well known program transformation technique. Its major drawback is that folding requires an Eureka step to invent new procedures. In the context of logic programm...