102 search results - page 14 / 21 » Implementing logic spreadsheets in LESS |
PPDP
2009
Springer
14 years 5 months ago
2009
Springer
We propose a novel type-based model checking algorithm for higher-order recursion schemes. As shown by Kobayashi, verification problems of higher-order functional programs can ea...
ICFP
2009
ACM
14 years 11 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
DAC
2004
ACM
14 years 12 months ago
2004
ACM
Just-in-time (JIT) compilation has previously been used in many applications to enable standard software binaries to execute on different underlying processor architectures. Howev...
DLOG
2007
14 years 1 months ago
2007
Abstract. Concept approximation is an inference service for Description Logics that provides “translations” of concept descriptions from one DL to a less expressive DL. In [4] ...
ICDE
2004
IEEE
15 years 7 days ago
2004
IEEE
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...