3653 search results - page 356 / 731 » On Recognizable Timed Languages |
327
click to vote
POPL
2002
ACM
16 years 7 months ago
2002
ACM
In this paper we propose a scheme that combines type inference and run-time checking to make existing C programs type safe. We describe the CCured type system, which extends that ...
172
click to vote
SIGMOD
2003
ACM
16 years 7 months ago
2003
ACM
This paper presents a novel strategy for temporal coalescing. Temporal coalescing merges the temporal extents of value-equivalent tuples. A temporal extent is usually coalesced of...
177
click to vote
PLDI
2010
ACM
16 years 4 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
180
click to vote
KBSE
2009
IEEE
16 years 1 months ago
2009
IEEE
—Ruby on Rails (or just “Rails”) is a popular web application framework built on top of Ruby, an objectoriented scripting language. While Ruby’s powerful features such as d...
272
click to vote
HASKELL
2009
ACM
16 years 1 months ago
2009
ACM
Functional reactive programming (FRP) has simple and powerful semantics, but has resisted efficient implementation. In particular, most past implementations have used demand-driv...