3653 search results - page 493 / 731 » On Recognizable Timed Languages |
184
click to vote
TAPSOFT
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We present a new constraint system called INES. Its constraints are conjunctions of inclusions t1 t2 between rst-order terms (without set operators) which are interpreted...
184
click to vote
TAPSOFT
1997
Springer
15 years 10 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
146
click to vote
UIST
1993
ACM
15 years 10 months ago
1993
ACM
This paper describes Bramble, a toolkit for constructing graphical editing applications. The primary focus of Bramble is improve support for graphical manipulation by employing di...
177
click to vote
VLDB
1993
ACM
15 years 10 months ago
1993
ACM
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
141
click to vote
CONCUR
1990
Springer
15 years 10 months ago
1990
Springer
In this paper we describe the calculus TCCS, an extension of the process algebra CCS with temporal constructs. The calculus is useful for the formal analysis of the timing aspects...