Results 11 to 20 of about 414,553 (176)
Algorithmic debugging for complex lazy functional programs [PDF]
, 2017 An algorithmic debugger finds defects in programs by systematic search. It relies on the programmer to direct the search by answering a series of yes/no questions about the correctness of specific function applications and their results. Existing algorithmic debuggers for a lazy functional language work well for small simple programs but cannot be used
Maarten Faddegon
openaire +1 more source
An Analysis of the Current Program Slicing and Algorithmic Debugging Based Techniques
, 2008 This thesis presents a classification of program slicing based techniques. The classification allows us to identify the differences between existing techniques, but it also allows us to predict new slicing techniques. The study identifies and compares the dimensions that influence current techniques.
Josep Silva
+5 more sources
Probabilistic Analysis Based On Symbolic Game Semantics and Model Counting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Probabilistic program analysis aims to quantify the probability that a given program satisfies a required property. It has many potential applications, from program understanding and debugging to computing program reliability, compiler optimizations and ...
Aleksandar S. Dimovski
doaj +1 more source
Distributed Quantum Computing with QMPI [PDF]
International Conference for High Performance Computing, Networking, Storage and Analysis, 2021 Practical applications of quantum computers require millions of physical qubits and it will be challenging for individual quantum processors to reach such qubit numbers.
Thomas Häner +3 more
semanticscholar +1 more source
IET Power Electronics, EarlyView., 2022 This paper introduces the research on the inductance‐capacitor‐capacitor‐inductance grid‐connected inverter using active disturbance rejection and grid voltage feedforward coordinated control technology. The pade approximation is performed on the inductance‐capacitor‐capacitor‐inductance filter to derive the first‐order discretization mathematical ...
Guang‐Xin Zhong +4 more
wiley +1 more source
Compositional Explanation of Types and Algorithmic Debugging of Type Errors [PDF]
, 2001 The type systems of most typed functional programming languages are based on the Hindley-Milner type system. A practical problem with these type systems is that it is often hard to understand why a program is not type correct or a function does not have ...
Bernstein K. +14 more
core +2 more sources
Program development using abstract interpretation (and the ciao system preprocessor) [PDF]
, 2003 The technique of Abstract Interpretation has allowed the development of very sophisticated global program analyses which are at the same time provably correct and practical.
Bueno Carrillo, Francisco +3 more
core +2 more sources
Through (Tracking) Their Eyes: Abstraction and Complexity in Program Comprehension
ACM Transactions on Computing Education, 2021 Previous studies on writing and understanding programs presented evidence that programmers beyond a novice stage utilize plans or plan-like structures.
Philipp Kather +2 more
semanticscholar +1 more source
A language extension set to generate adaptive versions automatically
Oil & Gas Science and Technology, 2018 A large part of the development effort of compute-intensive applications is devoted to optimization, i.e., achieving the computation within a finite budget of time, space or energy.
Schmitt Maxime +2 more
doaj +1 more source
Report on a User Test and Extension of a Type Debugger for Novice Programmers
, 2014 A type debugger interactively detects the expressions that cause type errors. It asks users whether they intend the types of identifiers to be those that the compiler inferred.
Asai, Kenichi, Ishii, Yuki
core +4 more sources