174 search results - page 11 / 35 » Loop Calculus for Satisfiability |
CIE
2008
Springer
13 years 9 months ago
2008
Springer
Having principal typings (for short PT) is an important property of type systems. This property guarantees the possibility of type deduction which means it is possible to develop a...
ACTA
2005
13 years 7 months ago
2005
A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type g...
SIGPLAN
2002
13 years 7 months ago
2002
We describe the design of a rule-based language for expressing changes to Haskell programs in a systematic and reliable way. The update language essentially offers update commands...
CCS
2007
ACM
14 years 1 months ago
2007
ACM
er presents a novel approach for concisely abstracting authentication s and for subsequently analyzing those abstractions in a sound manner, i.e., deriving authentication guarante...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We consider a queueing system with controllable service rate; for example, a transmitter whose rate can be controlled by varying the transmission power. For such a system we ob...