scholarly journals Reducing Total Correctness to Partial Correctness by a Transformation of the Language Semantics

2019 ◽  
Vol 289 ◽  
pp. 1-16
Author(s):  
Andrei-Sebastian Buruiană ◽  
Ştefan Ciobâcă
Author(s):  
Pauline Jacobson

This chapter examines the currently fashionable notion of ‘experimental semantics’, and argues that most work in natural language semantics has always been experimental. The oft-cited dichotomy between ‘theoretical’ (or ‘armchair’) and ‘experimental’ is bogus and should be dropped form the discourse. The same holds for dichotomies like ‘intuition-based’ (or ‘thought experiments’) vs. ‘empirical’ work (and ‘real experiments’). The so-called new ‘empirical’ methods are often nothing more than collecting the large-scale ‘intuitions’ or, doing multiple thought experiments. Of course the use of multiple subjects could well allow for a better experiment than the more traditional single or few subject methodologies. But whether or not this is the case depends entirely on the question at hand. In fact, the chapter considers several multiple-subject studies and shows that the particular methodology in those cases does not necessarily provide important insights, and the chapter argues that some its claimed benefits are incorrect.


1981 ◽  
Vol 4 (4) ◽  
pp. 975-995
Author(s):  
Andrzej Szałas

A language is considered in which the reader can express such properties of block-structured programs with recursive functions as correctness and partial correctness. The semantics of this language is fully described by a set of schemes of axioms and inference rules. The completeness theorem and the soundness theorem for this axiomatization are proved.


1980 ◽  
Vol 3 (4) ◽  
pp. 419-431
Author(s):  
Stefan Sokołowski

Predicates describing the states of computation may be regarded as functions into the Boolean algebra {false, true} and programs as transformers of those functions. If we do not restrict ourselves to this algebra, we get instead terms describing the states of computation and programs transforming the terms. In many cases this approach turns out to be more natural. This paper is a mathematical study of partial correctness and termination of programs in the language of term transformations.


2005 ◽  
Vol 28 (1) ◽  
pp. 73-116
Author(s):  
Michael Mccord ◽  
Arendse Bernth

2015 ◽  
Vol 27 (4) ◽  
pp. 459-459
Author(s):  
ACHIM JUNG ◽  
GUO-QIANG ZHANG

The International Symposium on Domain Theory (ISDT) is a conference series intended to be a forum for researchers in domain theory and its applications. Topics include topological and logical aspects of domains; categories of domains and powerdomains; continuous posets and their representations; partial orders, lattice theory and metric spaces; types, process algebra and concurrency; non-classical and partial logics; programming language semantics; applications in computer science and mathematics. This conference series was founded by Yingming Liu, Yixiang Chen, Klaus Keimel, and Guo-Qiang Zhang. All ISDT events have taken place in China. The first ISDT was held in Shanghai, October 17–24, 1999; the second ISDT was held in Chengdu, October 22–26, 2001; the third ISDT occurred in Xi'an, China, May 10–14, 2004; the fourth ISDT was held in Changsha, June 2–6, 2006; and the fifth ISDT took place in Shanghai, September 11–14, 2009.


Sign in / Sign up

Export Citation Format

Share Document