Sciweavers

3653 search results - page 255 / 731
» On Recognizable Timed Languages
Sort
View
UIST
1998
ACM
15 years 11 months ago
Graphical Query Specification and Dynamic Result Previews for a Digital Library
Textual query languages based on Boolean logic are common amongst the search facilities of on-line information repositories. However, there is evidence to suggest that the syntact...
Steve Jones
ICCAD
1994
IEEE
65views Hardware» more  ICCAD 1994»
15 years 11 months ago
Incremental formal design verification
Language containment is a method for design verification that involves checking if the behavior of the system to be verified is a subset of the behavior of the specifications (pro...
Gitanjali Swamy, Robert K. Brayton
POPL
1990
ACM
15 years 11 months ago
Higher-Order Modules and the Phase Distinction
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
Robert Harper, John C. Mitchell, Eugenio Moggi
CCGRID
2001
IEEE
15 years 11 months ago
KelpIO: A Telescope-Ready Domain-Specific I/O Library for Irregular Block-Structured Applications
To ameliorate the need to spend significant programmer time modifying parallel programs to achieve highperformance, while maintaining compact, comprehensible source codes, this pa...
Bradley Broom, Robert J. Fowler, Ken Kennedy
ICLP
1995
Springer
15 years 10 months ago
Operational Semantics of Constraint Logic Programs with Coroutining
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
Andreas Podelski, Gert Smolka