2231 search results - page 255 / 447 » Alternation as a programming paradigm |
192
click to vote
DOOD
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. We present a well-founded semantics for deductive objectoriented database (dood) languages by applying the alternating- xpoint characterization of the well-founded model ...
143
click to vote
ICALP
1997
Springer
15 years 11 months ago
1997
Springer
We propose a general approach for defining behavioural preorders over process terms as the maximal pre–congruences induced by basic observables. We will consider three of these...
155
click to vote
ICLP
1994
Springer
15 years 10 months ago
1994
Springer
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
173
click to vote
MICRO
1992
IEEE
15 years 10 months ago
1992
IEEE
This paper describes a single chip Multiple Instruction Stream Computer (MISC) capable of extracting instruction level parallelism from a broad spectrum of programs. The MISC arch...
155
click to vote
CAV
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the ...