Filters








23,040 Hits in 4.1 sec

Towards More Reliable Automated Program Repair by Integrating Static Analysis Techniques [article]

Omar I. Al-Bataineh and Anastasiia Grishina and Leon Moonen
2021 arXiv   pre-print
A long-standing open challenge for automated program repair is the overfitting problem, which is caused by having insufficient or incomplete specifications to validate whether a generated patch is correct  ...  The integration combines automated program repair with static analysis techniques in such a way that bug detection patterns can be synthesized into specifications that the repair system can use.  ...  We will refer to the class of logical bugs in programs that lead to non-terminating loops as termination bugs and analyze the conditions under which they can be automatically repaired. A.  ... 
arXiv:2111.05713v1 fatcat:eadhsd57xzdtrj43jkusmra4hq

Page 1538 of Mathematical Reviews Vol. , Issue 2002C [page]

2002 Mathematical Reviews  
Press, New York, 1994; MR 95f:68226] the ideas behind the definitions, applies plausible logic to an ex- ample, and proves a coherence result which indicates that plausible logic is well behaved.  ...  The rele- vance of this calculus, to programming with DFOL, automated program analysis including loop invariant detection, and natural language semantics, is described.  ... 

Page 201 of Radiology Vol. 55, Issue 2 [page]

1950 Radiology  
The most plausible explanation appears to be the exclusion of hydrochloric acid, which is the best physio- logic stimulus for the secretion of pancreatic juice with high buffer value, from contact with  ...  D Gastro-entero-colic fistula detected twenty years after gastro-enterostomy. F.  ... 

Structural Resolution with Co-inductive Loop Detection

Yue Li
2017 Electronic Proceedings in Theoretical Computer Science  
A way to combine co-SLD style loop detection with structural resolution was found and is introduced in this work, to extend structural resolution with co-induction.  ...  development of a productivity decision algorithm that uses loop detection, which in turn will prepare even further algorithm development that goes beyond loop detection.  ...  On the one hand, it inherits loop detection from co-SLD, which is a simpler co-inductive reasoning mechanism compared with the co-inductive mechanism of co-algebraic logic programming.  ... 
doi:10.4204/eptcs.258.4 fatcat:ib2ufdsinvhu5em6lxncqkbp2y

Unfold/fold transformations and loop optimization of logic programs

S. K. Debray
1988 SIGPLAN notices  
In the process, we show that the properties of unification and logical variables can sometimes be used to generalize, from traditional languages, the conditions under which these optimizations may be carried  ...  In this paper, we examine the application of unfold/fold transformations to three kinds of loop optimization for logic programming languages: recursion removal, loop fusion and code motion out of loops  ...  In logic programs, loop invariant computations can often be detected simply by using unfold/fold transformations at the source level. This is illustrated by the following example.  ... 
doi:10.1145/960116.54020 fatcat:x27pprv445alpe2xf532wkr5rm

Unfold/fold transformations and loop optimization of logic programs

S. K. Debray
1988 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation - PLDI '88  
In the process, we show that the properties of unification and logical variables can sometimes be used to generalize, from traditional languages, the conditions under which these optimizations may be carried  ...  In this paper, we examine the application of unfold/fold transformations to three kinds of loop optimization for logic programming languages: recursion removal, loop fusion and code motion out of loops  ...  In logic programs, loop invariant computations can often be detected simply by using unfold/fold transformations at the source level. This is illustrated by the following example.  ... 
doi:10.1145/53990.54020 dblp:conf/pldi/Debray88 fatcat:cspq2pafczatfaiwsfhoj4onta

On Fallacies in Neuroscience

Christophe Bernard
2020 eNeuro  
The real danger is to transform something plausible into a truth.  ...  In contrast, Euclidian geometry relies on five axioms, from which you can derive a deductive and logical system. In everyday life, Euclidian geometry is enough.  ... 
doi:10.1523/eneuro.0491-20.2020 pmid:33303561 pmcid:PMC7729298 fatcat:6dburj5lovefne2e27ms7ws4le

A NEW CONTROL STRATEGY FOR A SEMI-ACTIVE DIFFERENTIAL (PART I)

Federico Cheli, Michele Giaramita, Marco Pedrinelli, Germano Sandoni, Gian Claudio Travaglio
2005 IFAC Proceedings Volumes  
The system presented in the paper comes out from the cooperation of Ferrari, MAGNA STEYR and Politecnico di Milano in the development of a semi-active differential.  ...  In the paper a description of either the physical layout of the system, its capabilities, and of the control software is given. Experimental results on an existent vehicle are shown.  ...  functionality of the logic a internal loop, of the pressure proportional valve, make the dynamics of the output pressure Pd faster.  ... 
doi:10.3182/20050703-6-cz-1902.01911 fatcat:kimspdwsabgnzehoafeun2luga

The perceptual loop theory not disconfirmed: A reply to MacKay

Willem J.M Levelt
1992 Consciousness and Cognition  
In the masking condition speakers can use only their internal loop, and this loop is shorter than the external loop; this corresponds to shorter error detection latencies (and, of course, less detections  ...  This is even a "logical inconsistency" in the theory, it is said. How does MacKay suppose a listener recognizes that a word is correctly used?  ... 
doi:10.1016/1053-8100(92)90062-f fatcat:ujycxqumnvdkdcsjpsf6jxb2ie

Large-scale integration from the user's point of view

M. G. Smith, W. A. Notz
1967 Proceedings of the November 14-16, 1967, fall joint computer conference on - AFIPS '67 (Fall)  
Is it a large or small system; is there a high or low market volume expected; is it a high or low performance application; are there particularly sensitive cost, power or reliability requirements; what  ...  INTRODUCTION The potential LSI user views LSI promise with a great deal of anticipation, but LSI' problems with some trepidation.  ...  As indicated, not all the functions have to be in the m~in iterative loops and, in fact, it is really these loops which the user worries about the most, namely, the loops which he may have to go through  ... 
doi:10.1145/1465611.1465623 dblp:conf/afips/SmithN67 fatcat:idayt2wy55etjgvsywy7gpf4mu

A Defeasible Logic for Clauses [chapter]

David Billington
2011 Lecture Notes in Computer Science  
A new non-monotonic logic called clausal defeasible logic (CDL) is defined and explained.  ...  CDL is the latest in the family of defeasible logics, which, it is argued, is important for knowledge representation and reasoning.  ...  Acknowledgement The author wishes to thank Andrew Rock, René Hexel, and Vladimir Estivill-Castro for their assistance and advice; and Michael Maher and Kewen Wang for their comments on a draft of an earlier  ... 
doi:10.1007/978-3-642-25832-9_48 fatcat:f2hakmikoretvbihmdw44t2g3i

What is neurophilosophy: Do we need a non-reductive form?

Philipp Klar
2020 Synthese  
which aims for a bidirectional connection of both disciplines.  ...  Neurophilosophy is a controversial scientific discipline lacking a broadly accepted definition and especially a well-elaborated methodology.  ...  Consequently, a re-defined empirically plausible concept arises, which is then given as output and is additionally investigated concerning its philosophical plausibility, which is its conceptual-logical  ... 
doi:10.1007/s11229-020-02907-6 fatcat:wmwsnuqg5ve7te6o4hz5atqyxa

A Cognitive Approach to Relevant Argument Generation [chapter]

Jean-Louis Dessalles
2016 Lecture Notes in Computer Science  
It relies on a very small number of operations that are systematically performed: logical conflict detection, abduction and negation.  ...  The aim is to produce a minimal cognitive procedure that generates logically relevant arguments at the right time. Such a procedure is proposed as a proof of principle.  ...  In a nutshell, the procedure tries to detect a logical conflict, and then explores various ways to solve it.  ... 
doi:10.1007/978-3-319-46218-9_1 fatcat:vtepncrr7zduzavsisc4ps4yoq

ESPR: Efficient Security Scheme for Position-Based Routing in Vehicular Ad Hoc Networks

Nizar Alsharif, Albert Wasef, Xuemin Shen
2010 2010 IEEE Global Telecommunications Conference GLOBECOM 2010  
Furthermore, it defines a set of plausibility checks that enables network members to detect and avoid PBR attacks autonomously.  ...  However, there are many security challenges and various routing attacks which may prevent the deployment of PBR protocols.  ...  ESPR: Plausibility and Monitoring Checks Plausibility checks are a set of logical tests and corresponding procedures to ensure that the received message follows some logical rules, and the sent messages  ... 
doi:10.1109/glocom.2010.5684052 dblp:conf/globecom/AlsharifWS10 fatcat:kpjgknhghzduleziiys3ps4qfa

Logic and Learning [chapter]

Nina Gierasimczuk, Vincent F. Hendricks, Dick de Jongh
2014 Outstanding Contributions to Logic  
be obvious that a connective ⇒ which satisfies Loop need not be as strong as the material conditional of classical logic.  ...  For instance, a particular pattern of neural wiring may implement an algorithm which performs the computational function of detecting edges at a particular orientation.  ... 
doi:10.1007/978-3-319-06025-5_10 fatcat:m64rmwd22zdajb2bfb2ogsi4wq
« Previous Showing results 1 — 15 out of 23,040 results