Sciweavers

506 search results - page 58 / 102
» A case for an SC-preserving compiler
Sort
View
ACSC
2004
IEEE
13 years 11 months ago
Strength Reduction for Loop-Invariant Types
Types are fundamental for enforcing levels of abstraction in modern high-level programming languages and their lower-level representations. However, some type-related features suc...
Phung Hua Nguyen, Jingling Xue
CAV
2000
Springer
125views Hardware» more  CAV 2000»
13 years 11 months ago
Efficient Reachability Analysis of Hierarchical Reactive Machines
Hierarchical state machines is a popular visual formalism for software specifications. To apply automated analysis to such specifications, the traditional approach is to compile th...
Rajeev Alur, Radu Grosu, Michael McDougall
ISMIS
2000
Springer
13 years 11 months ago
Top-Down Query Processing in First Order Deductive Databases under the DWFS
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
C. A. Johnson
TIC
2000
Springer
174views System Software» more  TIC 2000»
13 years 11 months ago
Alias Types for Recursive Data Structures
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a ...
David Walker, J. Gregory Morrisett
ICPR
2010
IEEE
13 years 10 months ago
A Bi-Modal Handwritten Text Corpus: Baseline Results
Handwritten text is generally captured through two main modalities: off-line and on-line. Smart approaches to handwritten text recognition (HTR) may take advantage of both modalit...
Moises Pastor, Alejandro Héctor Toselli, Francisc...