3221 search results - page 152 / 645 » Termination of Linear Programs |
155
click to vote
EMSOFT
2004
Springer
15 years 11 months ago
2004
Springer
We present a type system for E code, which is an assembly language that manages the release, interaction, and termination of real-time tasks. E code specifies a deadline for each...
131
click to vote
TCS
2010
15 years 4 months ago
2010
We define a program semantics that is preserved by dependence-based slicing algorithms. It is a natural extension, to non-terminating programs, of the semantics introduced by Wei...
158
click to vote
ESWS
2009
Springer
16 years 25 days ago
2009
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin...
167
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...
146
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...