Sciweavers

5904 search results - page 818 / 1181
» Requirements for a Composition Language
Sort
View
LISP
2008
105views more  LISP 2008»
15 years 6 months ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
LOGCOM
2008
133views more  LOGCOM 2008»
15 years 6 months ago
Linking Semantic and Knowledge Representations in a Multi-Domain Dialogue System
We describe a two-layer architecture for supporting semantic interpretation and domain reasoning in dialogue systems. Building systems that support both semantic interpretation an...
Myroslava Dzikovska, James F. Allen, Mary D. Swift
JSS
2006
99views more  JSS 2006»
15 years 6 months ago
A tunable hybrid memory allocator
Dynamic memory management can make up to 60% of total program execution time. Object oriented languages such as C++ can use 20 times more memory than procedural languages like C. ...
Yusuf Hasan, J. Morris Chang
SCP
2008
144views more  SCP 2008»
15 years 6 months ago
Implicit ownership types for memory management
Abstract. The Real-time Specification for Java (RTSJ) introduced a range of language features for explicit memory management. While the RTSJ gives programmers fine control over mem...
Tian Zhao, Jason Baker, James Hunt, James Noble, J...
IMCS
2007
78views more  IMCS 2007»
15 years 6 months ago
Usable set-up of runtime security policies
Setting up runtime security policies as required for firewalls or as envisioned by policy languages for the Semantic Web is a difficult task, especially for lay users who have l...
Almut Herzog, Nahid Shahmehri