16 search results - page 3 / 4 » tapsoft 1997 |
TAPSOFT
1997
Springer
13 years 9 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...
TAPSOFT
1997
Springer
13 years 9 months 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
13 years 9 months ago
1997
Springer
This paper presents an approach for specifying complex, structured systems with Evolving Algebras by means of aggregation and composition. Evolving algebras provide a formal method...
TAPSOFT
1997
Springer
13 years 9 months 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...
TAPSOFT
1997
Springer
13 years 9 months ago
1997
Springer
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...