<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>South African Computer Journal 1997(19)</title>
<link>https://ir.unisa.ac.za/handle/10500/23892</link>
<description/>
<pubDate>Fri, 19 Jun 2026 20:23:50 GMT</pubDate>
<dc:date>2026-06-19T20:23:50Z</dc:date>
<item>
<title>WOFACS '96: Workshop on formal and applied Computer Science</title>
<link>https://ir.unisa.ac.za/handle/10500/25449</link>
<description>WOFACS '96: Workshop on formal and applied Computer Science
Brink, C
</description>
<pubDate>Wed, 01 Jan 1997 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://ir.unisa.ac.za/handle/10500/25449</guid>
<dc:date>1997-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>Verification of finite state systems with temporal logic model checking</title>
<link>https://ir.unisa.ac.za/handle/10500/24260</link>
<description>Verification of finite state systems with temporal logic model checking
Schlingloff, B
These tutorial notes contain an introduction to the logical theory and computational aspects of computer aided verification of finite state reactive systems with linear and branching temporal logic model checking. As a general recipe, computer science applications and algorithms are derived from logical notions and proofs. First, the expressivity of various temporal logics is compared to first and second order logic, and to w-automata and formal languages. Then, temporal safety and liveness properties are reviewed. From the completeness proof for natural and tree models, local and global decision procedures are developed. These in turn give rise to the corresponding model checking procedures. Various modelling techniques for reactive systems are presented. Finally, symbolic techniques for global model checking with binary decision diagrams, and partial order techniques for local model checking with stubborn sets are discussed.
</description>
<pubDate>Wed, 01 Jan 1997 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://ir.unisa.ac.za/handle/10500/24260</guid>
<dc:date>1997-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>Test automation of safety-critical reactive systems</title>
<link>https://ir.unisa.ac.za/handle/10500/24259</link>
<description>Test automation of safety-critical reactive systems
Peleska, J; Siegel, M
This article focuses on test automation for safety-critical reactive systems.  In the first part of the paper we introduce a methodology for specification, design and verification of fault-tolerant systems allowing to combine different methods in a systematic and consistent way, provided that these methods are compositional. The methodology indicates how to "switch" between formal verification and testing during the construction of (possibly large) reactive systems. We introduce the basic notions of testing as far as relevant in the context of reactive systems and relate them to the verification methodology. Part II formally describes our test automation method which is based on Hoare's CSP and takes Hennessy's testing theory as a starting point. It is indicated how this specific method fits into the general approach described in Part I. We introduce CSP test drivers which are trustworthy in the sense that they "approximate" refinement proofs, converging to a full proof with the increasing (possibly infinite) number of tests successfully executed. These drivers have been implemented in the VVT-RT (Verification, Validation and Test for Reactive Real-Time Systems) tool developed at Bremen University in cooperation with the University of Kiel, JP Software-Consulting  and ELPRO LET GmbH. The presentation of this article is based on the lectures given by the first author during the WOFACS '96 workshop at the University of Cape Town.
</description>
<pubDate>Wed, 01 Jan 1997 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://ir.unisa.ac.za/handle/10500/24259</guid>
<dc:date>1997-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>Application-oriented program semantics</title>
<link>https://ir.unisa.ac.za/handle/10500/24258</link>
<description>Application-oriented program semantics
McIver, AK; Morgan, C; Sanders, JW
This paper abridges lecture notes from WOFACS 96. It provides semantic models for a variety of programming and development formalisms, showing how different models for the same formalism are related by Galois connections. The formalisms are: the language of guarded commands and its refinement calculus; communicating sequential processes; and probabilistic imperative code. The semantic models include: binary relations; predicate transformers; traces; failures; and distributions. In each case, denotations of code are characterised, in the more general specification space, by the healthiness conditions they satisfy. Models are evaulated for their elegance, expressive power and calculational facility.&#13;
Expanded notes containing proofs, an extra chapter on data refinement and exercises for each chapter, are available from the au­thors.
</description>
<pubDate>Wed, 01 Jan 1997 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://ir.unisa.ac.za/handle/10500/24258</guid>
<dc:date>1997-01-01T00:00:00Z</dc:date>
</item>
</channel>
</rss>
