TAPSOFT
1997
Springer
13 years 9 months ago
1997
Springer
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...
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
TAPSOFT
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. Reasoning on programs and automated deduction often require the manipulation of in nite sets of objects. Many formalisms have been proposed to handle such sets. Here we d...