An overview of declarative process modelling using logic programming

1996 ◽  
Vol 11 (4) ◽  
pp. 303-316
Author(s):  
Paolo Ciancarini
Keyword(s):  
Logic Programming ◽  
Programming Languages ◽  
Development Process ◽  
Software Process ◽  
Process Modelling ◽  
Software Systems ◽  
Programming Environments ◽  
Rule Based ◽  
Coordination Language ◽  
Geographically Distributed

AbstractSoftware process modelling is the activity of formalising the production lifecycle of large software systems. Its aim is to formally describe a software development process, which is then effectively used and possibly enacted by an environment able to support the geographically distributed and coordinated activities involved in the process itself. I show that rule-based languages, especially logic programming languages, are an important technology for the specification, modelling, enactment and coordination of software processes. This is because most routine activities in any development process can be defined by rules. Some initial proposals aimed at simply simulating the software process by a Prolog-like program embedding some development rules. A further step toward the integration of rule-based languages in the software process has been taken using a dynamic knowledge base as project database, and a number of special primitives have been introduced to support process programs. Currently there is a trend toward more complex programming environments, called process-centred development environments. I show how some rule-based coordination language have been used to build an environment of this kind.

Traceability mining between unit test and source code based on textual analysis applied to software systems

2020 ◽  
Author(s):  
Amir Hossein Arshia ◽  
Amir Hossein Rasekh ◽  
Mohammad Reza Moosavi ◽  
Seyed Mostafa Fakhrahmad ◽  
Mohammad Hadi Sadreddini
Keyword(s):  
Development Process ◽  
Source Code ◽  
Software Systems ◽  
Software Development Process ◽  
Rule Based ◽  
Rule Based System ◽  
Develop Software ◽  
Measure Of Similarity ◽  
Regression Tests ◽  
Specific Part

Abstract Correctness of the designed system is one of the most important issues in the software development process. Therefore, various tests have been defined and designed to help software teams develop software with little or no problem. Finding a proper link between test class and the class under the test is an important but difficult task. Finding this relation helps the developers to conduct regression tests more efficiently. In this paper, we seek to propose a model for recovering traceable links between test classes and the classes under the test. The proposed method encompasses three parts: (1) method for extracting keywords and the measure of similarity of a specific part of code, (2) backward chain method based on a rule-based system, (3) using hybrid model to find traceable links between test classes and the code under test. This study uses three open-source and one industrial source projects to conduct experiments. The results are satisfactory compared to previous studies.

scholarly journals Analysis and Transformation of Constrained Horn Clauses for Program Verification

2021 ◽  
pp. 1-69
Author(s):  
EMANUELE DE ANGELIS ◽  
FABIO FIORAVANTI ◽  
JOHN P. GALLAGHER ◽  
MANUEL V. HERMENEGILDO ◽  
ALBERTO PETTOROSSI ◽  
...  
Keyword(s):  
Logic Programming ◽  
Programming Languages ◽  
Recent Work ◽  
Static Analysis ◽  
Program Verification ◽  
Software Systems ◽  
Transformation Techniques ◽  
Analysis Techniques ◽  
Future Developments ◽  
Horn Clauses

Abstract This paper surveys recent work on applying analysis and transformation techniques that originate in the field of constraint logic programming (CLP) to the problem of verifying software systems. We present specialization-based techniques for translating verification problems for different programming languages, and in general software systems, into satisfiability problems for constrained Horn clauses (CHCs), a term that has become popular in the verification field to refer to CLP programs. Then, we describe static analysis techniques for CHCs that may be used for inferring relevant program properties, such as loop invariants. We also give an overview of some transformation techniques based on specialization and fold/unfold rules, which are useful for improving the effectiveness of CHC satisfiability tools. Finally, we discuss future developments in applying these techniques.

Objects in concurrent logic programming languages

1986 ◽  
Vol 21 (11) ◽  
pp. 242-257 ◽  
Author(s):  
Kenneth Kahn ◽  
Eric Dean Tribble ◽  
Mark S. Miller ◽  
Daniel G. Bobrow
Keyword(s):  
Logic Programming ◽  
Programming Languages ◽  
Concurrent Logic Programming ◽  
Logic Programming Languages

Adding Prolog Rules and OOPs Inheritance to Legacy Databases

1991 ◽  
Author(s):  
Art Goldschmidt ◽  
Dipayan Gangopadhyay
Keyword(s):  
Logic Programming ◽  
Programming Language ◽  
Object Oriented ◽  
Database System ◽  
Storage Management ◽  
Complex Objects ◽  
Rule Based ◽  
System Product ◽  
Viable Approach ◽  
Trigger Mechanisms

Abstract We present a viable approach to add rules capability or object orientation to legacy databases. Using a combination of language compilation, run-time trigger mechanisms and inter-language call facility, we integrate an object-oriented logic programming language, called OOLP, with an existing CIM Database System Product, IBM’s CIM CDF. The result is a system that provides storage management of complex objects, rule-based validation, object oriented knowledge modelling and declarative query capability.

Sign in / Sign up

Export Citation Format

Share Document