Semantic Correctness of Dependence-based Slicing for Interprocedural, Possibly Nonterminating Programs

2021 ◽  
Vol 42 (4) ◽  
pp. 1-56
Author(s):  
Abu Naser Masud ◽  
Björn Lisper
Keyword(s):  
1977 ◽  
Vol 1 (1) ◽  
pp. 93-119
Author(s):  
Lech Banachowski

The present paper contains investigations concerning the semantic correctness of programs. Presented methods of analysis of programs are appropriate for every domain of computation. Algorithmic logic extended by classical quantifiers is a fundamental mathematical tool used in the paper. Interrelations between properties of programs and properties of descriptions of programs are studied (a description of a program is a mathematical model of the notion of a documentation of a program).


Author(s):  
Changwoo Min ◽  
Sanidhya Kashyap ◽  
Byoungyoung Lee ◽  
Chengyu Song ◽  
Taesoo Kim
Keyword(s):  

Author(s):  
Ana Sofia Vieira

Abstract One of the main problems to be solved in design-by-features is to preserve the semantic correctness of feature-based models. Currently, feature-based parametric design (FbPD) is being used as one of the most powerful approaches for solving this problem. In this paper, a fundamental principle of this approach is introduced. Three aspects stated, are: FbPD deals with functional design primitives, it solves the automatic generation of model variations, and it offers the basis for the development of a mechanism to check the semantic correctness of feature-based models. Several concepts for the definition of semantic constraints are presented. They instigate the classification of semantic constraints in four different categories, based on the constraint evaluation-time, purpose, behaviour, and representation. Sinfonia, a system for feature-based parametric design, is presented as a testbed environment for design-by-features applications. One of its modules, the Consistency Handler, uses the constraint concepts introduced in order to preserve the semantic consistency of the models. Several examples illustrate the different types of constraints. In addition, an algorithm applied for the process of a consistent feature modification is presented.


Erkenntnis ◽  
2021 ◽  
Author(s):  
Indrek Reiland

AbstractEver since the publication of Kripke’s Wittgenstein on Rules and Private Language, there’s been a raging debate in philosophy of language over whether meaning and thought are, in some sense, normative. Most participants in the normativity wars seem to agree that some uses of meaningful expressions are semantically correct while disagreeing over whether this entails anything normative. But what is it to say that a use of an expression is semantically correct? On the so-called orthodox construal, it is to say that it doesn’t result in a factual mistake, that is, in saying or thinking something false. On an alternative construal it is instead to say that it doesn’t result in a distinctively linguistic mistake, that is, in misusing the expression. It is natural to think that these two construals of semantic correctness are simply about different things and not necessarily in competition with each other. However, this is not the common view. Instead, several philosophers who subscribe to the orthodox construal have argued that the alternative construal of correctness as use in accordance with meaning doesn’t make any sense, partly because there are no clear cases of linguistic mistakes (Whiting in Inquiry, 59:219–238, 2016, Wikforss in Philos Stud 102:203–226, 2001). In this paper I develop and defend the idea that there’s a distinctively linguistic notion of correctness as use in accordance with meaning and argue that there are clear cases of linguistic mistakes.


2014 ◽  
Vol 94 (5) ◽  
pp. 1-6
Author(s):  
Priso Essawe-Ndedi ◽  
Marcel Fouda-Ndjodo
Keyword(s):  

2009 ◽  
pp. 212-220 ◽  
Author(s):  
Hendrik Decker ◽  
Davide Martinenghi

Integrity constraints (or simply “constraints”) are formal representations of invariant conditions for the semantic correctness of database records. Constraints can be expressed in declarative languages such as datalog, predicate logic, or SQL. This article highlights the historical background of integrity constraints and the essential features of their simplified incremental evaluation. It concludes with an outlook on future trends.


Author(s):  
Hendrik Decker

Integrity constraints (hereafter, sometimes simply ‘constraints’) are formal representations of conditions for the semantic correctness of database records. In science, constraints are usually expressed in declarative knowledge representation languages such as datalog or predicate logic. In commercial databases, they are usually expressed by distinguished SQL statements.


Sign in / Sign up

Export Citation Format

Share Document