TAPSOFT
1997
Springer
14 years 3 days ago
1997
Springer
This paper presents a type system which guarantees that well-typed programs in a procedural programming language satisfy a noninterference security property. With all program input...
TAPSOFT
1997
Springer
14 years 3 days ago
1997
Springer
Prospects for research in theoretical computer science are discussed. The maintenance of a genuine link between theory and practice is seen as key to the future health of both.
TAPSOFT
1997
Springer
14 years 3 days 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...
TAPSOFT
1997
Springer
14 years 3 days 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...
TAPSOFT
1997
Springer
14 years 3 days ago
1997
Springer
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
TAPSOFT
1997
Springer
14 years 3 days ago
1997
Springer
TAPSOFT
1997
Springer
14 years 3 days ago
1997
Springer
TAPSOFT
1997
Springer
14 years 3 days ago
1997
Springer
We show how the formal description language LOTOS can be used to de ne software architectures and how patterns over LOTOS can serve to characterize architectural styles. We charact...
TAPSOFT
1997
Springer
14 years 3 days ago
1997
Springer
TAPSOFT
1997
Springer
14 years 3 days ago
1997
Springer
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...