English
Related papers

Related papers: Software Cognitive Complexity Measure Based on Sco…

200 papers

These notes outline a formal method for program verification of numerical computation. It forms the basis of the software package VPC in its initial phase of development. Much of the style of presentation is in the form of notes that…

Mathematical Software · Computer Science 2014-01-08 Garry Pantelis

Control code is a concept that is closely related to a frequently occurring practitioner's view on what is a program: code that is capable of controlling the behaviour of some machine. We present a logical approach to explain issues…

Software Engineering · Computer Science 2009-09-02 J. A. Bergstra , C. A. Middelburg

Despite ample evidence that our concepts, our cognitive architecture, and mathematics itself are all deeply compositional, few models take advantage of this structure. We therefore propose a radically compositional approach to computational…

Neurons and Cognition · Quantitative Biology 2019-11-18 Toby B. St Clere Smithe

To solve hard problems, AI relies on a variety of disciplines such as logic, probabilistic reasoning, machine learning and mathematical programming. Although it is widely accepted that solving real-world problems requires an integration…

Artificial Intelligence · Computer Science 2020-01-14 Vaishak Belle , Luc De Raedt

A measure of complexity based on a probabilistic description of physical systems is proposed. This measure incorporates the main features of the intuitive notion of such a magnitude. It can be applied to many physical situations and to…

Chaotic Dynamics · Physics 2009-11-07 Ricardo Lopez-Ruiz , Hector Mancini , Xavier Calbet

Code summarization is the task of generating readable summaries that are semantically meaningful and can accurately describe the presumed task of a software. Program comprehension has become one of the most tedious tasks for knowledge…

Software Engineering · Computer Science 2021-03-08 Piyush Shrivastava

A desired but challenging property of compiler verification is compositionality, in the sense that the compilation correctness of a program can be deduced incrementally from that of its substructures ranging from statements, functions, and…

Programming Languages · Computer Science 2026-03-31 Zhang Cheng , Jiyang Wu , Di Wang , Qinxiang Cao

A constraint satisfaction problem (CSP) is a computational problem where the input consists of a finite set of variables and a finite set of constraints, and where the task is to decide whether there exists a satisfying assignment of values…

Computational Complexity · Computer Science 2019-04-23 Manuel Bodirsky

Answer Set Programming (ASP) is a problem modeling and solving framework for several problems in KR with growing industrial applications. Also for studies of computational complexity and deeper insights into the hardness and its sources,…

Logic in Computer Science · Computer Science 2023-01-19 Markus Hecher

We consider the basic features of complex dynamical and control systems. Special attention is paid to the problems of synthesis of dynamical models of complex systems, construction of efficient control models, and to the development of…

Computational Engineering, Finance, and Science · Computer Science 2009-07-03 Armen Bagdasaryan

Partial correctness of imperative or functional programming divides in logic programming into two notions. Correctness means that all answers of the program are compatible with the specification. Completeness means that the program produces…

Logic in Computer Science · Computer Science 2025-08-26 Włodzimierz Drabent

Many machine learning algorithms represent input data with vector embeddings or discrete codes. When inputs exhibit compositional structure (e.g. objects built from parts or procedures from subroutines), it is natural to ask whether this…

Machine Learning · Computer Science 2019-04-09 Jacob Andreas

Abstraction is a fundamental tool for reasoning about complex systems. Program abstraction has been utilized to great effect for analyzing deterministic programs. At the heart of program abstraction is the relationship between a concrete…

Artificial Intelligence · Computer Science 2017-07-17 Steven Holtzen , Todd Millstein , Guy Van den Broeck

The definition of complexity through Statistical Complexity Measures (SCM) has recently seen major improvements. Mostly, effort is concentrated in measures on time series. We propose a SCM definition for spatial dynamical systems. Our…

Statistical Mechanics · Physics 2015-06-17 A. Arbona , C. Bona , B. Miñano , A. Plastino

Quantum Computing is a new paradigm that enables several advances which are impossible using classical technology. With the rise of quantum computers, the software is also invited to change so that it can better fit this new computation…

Software Engineering · Computer Science 2024-03-19 Paulo Eduardo Zanni Junior , Valter Vieira de Camargo

Complexity is a multi-faceted phenomenon, involving a variety of features including disorder, nonlinearity, and self-organisation. We use a recently developed rigorous framework for complexity to understand measures of complexity. We…

Adaptation and Self-Organizing Systems · Physics 2020-09-22 Karoline Wiesner , James Ladyman

Program synthesis aims to automatically construct human-readable programs that satisfy given task specifications, such as input/output pairs or demonstrations. Recent works have demonstrated encouraging results in a variety of domains, such…

Software Engineering · Computer Science 2023-03-13 Linghan Zhong , Ryan Lindeborg , Jesse Zhang , Joseph J. Lim , Shao-Hua Sun

Spreadsheets are widely used in industry, even for critical business processes. This implies the need for proper risk assessment in spreadsheets to evaluate the reliability and validity of the spreadsheet's outcome. As related research has…

Software Engineering · Computer Science 2017-04-06 Thomas Reschenhofer , Bernhard Waltl , Klym Shumaiev , Florian Matthes

A good process model is expected not only to reflect the behavior of the process, but also to be as easy to read and understand as possible. Because preferences vary across different applications, numerous measures provide ways to reflect…

Formal Languages and Automata Theory · Computer Science 2024-08-23 Patrizia Schalk , Adam Burke , Robert Lorenz

Problems in program analysis can be solved by developing novel program semantics and deriving abstractions conventionally. For over thirty years, higher-order program analysis has been sold as a hard problem. Its solutions have required…

Programming Languages · Computer Science 2011-05-03 Sam Tobin-Hochstadt , David Van Horn
‹ Prev 1 4 5 6 7 8 10 Next ›