Sciweavers

2880 search results - page 35 / 576
» Types are calling conventions
Sort
View
ACSC
2004
IEEE
15 years 3 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
TACAS
2005
Springer
106views Algorithms» more  TACAS 2005»
15 years 5 months ago
Dependent Types for Program Understanding
Abstract. Weakly-typed languages such as Cobol often force programrepresent distinct data abstractions using the same low-level physical type. In this paper, we describe a techniqu...
Raghavan Komondoor, Ganesan Ramalingam, Satish Cha...
APLAS
2007
ACM
15 years 3 months ago
Type-Based Verification of Correspondence Assertions for Communication Protocols
Gordon and Jeffrey developed a type system for checking correspondence assertions. The correspondence assertions, proposed by Woo and Lam, state that when a certain event (called a...
Daisuke Kikuchi, Naoki Kobayashi
PPSWR
2004
Springer
15 years 5 months ago
Towards a Multi-calendar Temporal Type System for (Semantic) Web Query Languages
Abstract. Time is omnipresent on the (Semantic) Web. However, formalism like XML, XML Schema, RDF, OWL and (Semantic) Web query languages have, if any, only very limited notions of...
François Bry, Stephanie Spranger
FLOPS
2008
Springer
15 years 1 months ago
On-Demand Refinement of Dependent Types
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
Hiroshi Unno, Naoki Kobayashi