Sciweavers

3591 search results - page 6 / 719
» Typing linear constraints
Sort
View
LICS
1997
IEEE
14 years 2 months ago
The Complexity of Subtype Entailment for Simple Types
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
Fritz Henglein, Jakob Rehof
SCP
2008
144views more  SCP 2008»
13 years 10 months ago
Implicit ownership types for memory management
Abstract. The Real-time Specification for Java (RTSJ) introduced a range of language features for explicit memory management. While the RTSJ gives programmers fine control over mem...
Tian Zhao, Jason Baker, James Hunt, James Noble, J...
WIOPT
2010
IEEE
13 years 8 months ago
Delay efficient scheduling via redundant constraints in multihop networks
Abstract--We consider the problem of delay-efficient scheduling in general multihop networks. While the class of max-weight type algorithms are known to be throughput optimal for t...
Longbo Huang, Michael J. Neely
SAS
2004
Springer
134views Formal Methods» more  SAS 2004»
14 years 3 months ago
Towards Declarative Programming for Web Services
ness Refinement in Abstract Symbolic Trajectory Evaluation . . . . 38 Mila Dalla Preda Constraint-Based Linear-Relations Analysis . . . . . . . . . . . . . . . . . . . . . . . . ....
Sheila A. McIlraith
JFP
2010
142views more  JFP 2010»
13 years 8 months ago
Linear type theory for asynchronous session types
Session types support a type-theoretic formulation of structured patterns of communication, so that the communication behaviour of agents in a distributed system can be verified ...
Simon J. Gay, Vasco Thudichum Vasconcelos