2218 search results - page 118 / 444 » Testing Expressibility Is Hard |
CADE
2008
Springer
14 years 9 months ago
2008
Springer
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
ISORC
2008
IEEE
14 years 3 months ago
2008
IEEE
Conditional real-time task models, which are generalizations of periodic, sporadic, and multi-frame tasks, represent real world applications more accurately. These models can be c...
WMTE
2006
IEEE
14 years 3 months ago
2006
IEEE
Ubiquitous computing, as a subfield of computer science, has traditionally been associated with a set of principles expressed (loosely but tellingly) with terms like transparency,...
ACL
2006
13 years 10 months ago
2006
Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unificati...
IGPL
2006
13 years 9 months ago
2006
Abstract. This paper addresses the problem of establishing temporal properties of programs written in languages, such as Java, that make extensive use of the heap to allocate-and d...