4257 search results - page 520 / 852 » The Logical Modularity of Programs |
179
click to vote
ENTCS
2007
15 years 6 months ago
2007
There have been several research works that analyze and optimize programs using temporal logic. However, no evaluation of optimization time or execution time of these implementati...
155
click to vote
FM
2009
Springer
16 years 1 months ago
2009
Springer
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
192
click to vote
LOPSTR
2009
Springer
16 years 1 months ago
2009
Springer
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...
231
click to vote
EPIA
2003
Springer
16 years 1 days ago
2003
Springer
Modern information retrieval systems need the capability to reason about the knowledge conveyed by text bases. In this paper a methodology to automatically create ontologies and cl...
162
click to vote
IFL
2001
Springer
15 years 11 months ago
2001
Springer
A programming language with subtyping can be translated into a language without subtyping by inserting conversion functions. Previous studies of this interpretation showed only the...