1147 search results - page 140 / 230 » Termination in language-based systems |
111
Voted
CSFW
1997
IEEE
15 years 4 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
105
click to vote
ICCAD
1997
IEEE
15 years 4 months ago
1997
IEEE
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...
92
Voted
CHI
1997
ACM
15 years 4 months ago
1997
ACM
Palplates are a collection of touch-screen terminals placed around the office enabling human-computer interactions at the point of need. Supporting a community of mobile authentic...
111
click to vote
CCL
1994
Springer
15 years 4 months ago
1994
Springer
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
93
Voted
APLAS
2007
ACM
15 years 4 months ago
2007
ACM
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...