Filters








4,772 Hits in 6.5 sec

Coverage-Directed Test Generation Automated by Machine Learning -- A Review

Charalambos Ioannides, Kerstin I. Eder
2012 ACM Transactions on Design Automation of Electronic Systems  
In fact, recent advances demonstrate that embedding Machine Learning techniques into a Coverage Directed Test Generation framework can effectively automate the test generation process, making it more effective  ...  The generation of tests for simulation-based verification can be guided by Machine Learning techniques.  ...  Inductive Logic Programming Approach This approach, as presented in (Eder et al. 2007) , uses an Inductive Logic Programming (ILP) learning algorithm in order to close the loop between coverage analysis  ... 
doi:10.1145/2071356.2071363 fatcat:57elmvxbr5h2zgqki4gjtem4oq

Survey on Machine Learning Algorithms Enhancing the Functional Verification Process

Khaled A. Ismail, Mohamed A. Abd El Ghany
2021 Electronics  
Current research of deploying different (ML) models prove to be promising in areas such as stimulus constraining, test generation, coverage collection and bug detection and localization.  ...  An example of deploying artificial neural network (ANN) in test generation shows 24.5× speed up in functionally verifying a dual-core RISC processor specification.  ...  The work in [7] applied ML by using inductive logic programming ILP in guiding the stimulus generator to produce inputs that target unhit cover items based on the history of coverage analysis.  ... 
doi:10.3390/electronics10212688 fatcat:ic2ub7423rcf3exbjatizaoofu

Inductive Programming: A Survey of Program Synthesis Techniques [chapter]

Emanuel Kitzelmann
2010 Lecture Notes in Computer Science  
Inductive programming-the use of inductive reasoning methods for programming, algorithm design, and software development-is a currently emerging research field.  ...  , and functional programming.  ...  several generate-and-test based approaches to the induction of functional programs (Sec. 5).  ... 
doi:10.1007/978-3-642-11931-6_3 fatcat:6pgz2ml2inchhoqdafea5kcv6a

Automation of Processor Verification Using Recurrent Neural Networks [article]

Martin Fajcik, Marcela Zachariasova, Pavel Smrz
2018 arXiv   pre-print
The results of experiments show that not only the coverage closure is achieved much sooner, but we are able to isolate a small set of stimuli with high coverage that can be used for running regression  ...  coverage of its functionality in order to determine verification completeness.  ...  uses PRG generating programs.  ... 
arXiv:1803.09810v1 fatcat:yqnhqbdvrnae3pw5xrxrujxoz4

Logical Languages for Data Mining [chapter]

Fosca Giannotti, Giuseppe Manco, Jef Wijsen
2004 Logics for Emerging Applications of Databases  
At the end, we indicate the potential use of logic for unifying different existing data mining formalisms.  ...  In the field of machine learning, inductive logic programming has broadened its scope toward extending standard data mining tasks from the usual attribute-value setting to a multirelational setting.  ...  Induction of Logic Programs Initially, inductive logic programming (ILP) focused on using a collection of relations to infer a clausal theory.  ... 
doi:10.1007/978-3-642-18690-5_9 fatcat:6s6zu676szbsbjlxyxllv3qtzm

Programming Type-Safe Transformations Using Higher-Order Abstract Syntax [chapter]

Olivier Savary-Belanger, Stefan Monnier, Brigitte Pientka
2013 Lecture Notes in Computer Science  
In this paper, we exploit higher-order abstract syntax (HOAS) to implement a type-preserving compiler for the simply-typed lambda-calculus, including transformations such as closure conversion and hoisting  ...  Our work demonstrates that HOAS encodings offer substantial benefits to certified programming.  ...  We thank Mathieu Boespflug for his feedback and work on the implementation of Beluga, and anonymous referees for helpful suggestions and comments on an earlier version of this paper.  ... 
doi:10.1007/978-3-319-03545-1_16 fatcat:ldg2cszrpbfbhhdjbbjvpvmjqm

Semantics-based plausible reasoning to extend the knowledge coverage of medical knowledge bases for improved clinical decision support

Hossein Mohammadhassanzadeh, William Van Woensel, Samina Raza Abidi, Syed Sibte Raza Abidi
2017 BioData Mining  
To extend the coverage of incomplete medical knowledge-based systems beyond their deductive closure, and thus enhance their decision-support capabilities, we argue that innovative, multi-strategy reasoning  ...  Plausible reasoning mechanisms include inductive reasoning, which generalizes the commonalities among the data to induce new rules, and analogical reasoning, which is guided by data similarities to infer  ...  his work as Guest Editor for this submission.  ... 
doi:10.1186/s13040-017-0123-y pmid:28203277 pmcid:PMC5303296 fatcat:yhynsn6pfbardc5d5izjedtlau

Zap: Automated Theorem Proving for Software Analysis [chapter]

Thomas Ball, Shuvendu K. Lahiri, Madanlal Musuvathi
2005 Lecture Notes in Computer Science  
We describe our desiderata for such an interface to an ATP, the logics (theories) that an ATP for program analysis should support, and present how we have incorporated many of these ideas in Zap, an ATP  ...  Automated theorem provers (ATPs) are a key component that many software verification and program analysis tools rely on.  ...  In general, we wish to generate a test input to a program to meet some coverage criteria (such as executing a certain statement or covering a certain control path in the program).  ... 
doi:10.1007/11591191_2 fatcat:uczhvijn6vew3bmwpaqhaxrkzy

On the Nature of Symbolic Execution

Frank S. de Boer, Marcello M. Bonsangue
2019 2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)  
We first introduce such a formal model for a basic programming language with a statically fixed number of programming variables.  ...  This model is extended to a programming language with recursive procedures which are called by a call-by-value parameter mechanism.  ...  This work arose out of our Foundation of Testing master course (LIACS) in 2018, and we thank the master students for their valuable comments.  ... 
doi:10.1109/synasc49474.2019.00009 dblp:conf/synasc/BoerB19 fatcat:fcr7q5wslbgilhwiatsfsykppa

Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming [chapter]

Giorgio Delzanno, Roberto Giacobazzi, Francesco Ranzato
2010 Lecture Notes in Computer Science  
This motivates the use of logic programming as a natural and intelligible environment where abstract domain transformers can be tested and applied for a very first practical use, and characterized the  ...  It is important to notice that the subsumption test between nonground atoms can be used as termination test for this type of symbolic fixpoint computation.  ... 
doi:10.1007/978-3-642-14309-0_7 fatcat:pi5k44jpdfenzpf65lwfm3n5cm

On Combining Backward and Forward Chaining in Constraint Logic Programming

Rémy Haemmerlé
2014 Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming - PPDP '14  
Following the approach of Constraint Logic Programming, we define a class of programming languages that generalize both Constraint Logic and Concurrent Constraint Programming.  ...  The assumption of program confluence is the crux on which both the committed choice strategy and the logical completeness of the languages rely.  ...  Acknowledgments We would like to thank the reviewers for their useful comments.  ... 
doi:10.1145/2643135.2643144 dblp:conf/ppdp/Haemmerle14 fatcat:t7yw5mbjbzdj7p44p3haz5yyni

Mining library specifications using inductive logic programming

Sriram Sankaranarayanan, Franjo Ivanči, Aarti Gupta
2008 Proceedings of the 13th international conference on Software engineering - ICSE '08  
We propose a methodology for learning interface specifications using Inductive Logic Programming (ILP).  ...  Software libraries organize useful functionalities in order to promote modularity and code reuse.  ...  The key learning tool used by our approach is called Inductive Logic Programming(ILP) [14] .  ... 
doi:10.1145/1368088.1368107 dblp:conf/icse/SankaranarayananIG08 fatcat:l6snxfyu6felbfkwqjc676ywum

A Refinement Operator for Description Logics [chapter]

Liviu Badea, Shan -Hwei Nienhuys-Cheng
2000 Lecture Notes in Computer Science  
Unlike most approaches to learning in description logics, which provide bottom-up (and typically overly speci c) least generalizations of the examples, this paper addresses learning in DLs using downward  ...  While the problem of learning logic programs has been extensively studied in ILP, the problem of learning in description logics (DLs) has been tackled mostly by empirical means.  ...  The rst author is grateful to Doina T ilivea for discussions. Thanks are also due to the anonymous reviewers for their suggestions and constructive criticism.  ... 
doi:10.1007/3-540-44960-4_3 fatcat:22ixsf4knnbyxpxk2rnxnnsrvi

Forthcoming papers

1997 Artificial Intelligence  
Freund, Preferential reasoning in the perspective of Poole default logic The sceptical inference relation associated with a Poole system without constraints is known to have a simple semantic representation  ...  In the framework of conditional knowledge bases and default extensions, it implies that any rational inference relation may be considered as the rational closure of a minimal knowledge base.  ...  Tit&ham, Schema induction for logic program synthesis Prolog program synthesis can be made more efficient by using schemata which capture similarities in previously-seen programs.  ... 
doi:10.1016/s0004-3702(97)90001-1 fatcat:zcjn5iiajrfzxov5eqjyac34s4

Limitations and challenges of computer-aided design technology for CMOS VLSI

R.E. Bryant, Kwang-Ting Cheng, A.B. Kahng, K. Keutzer, W. Maly, R. Newton, L. Pileggi, J.M. Rabaey, A. Sangiovanni-Vincentelli
2001 Proceedings of the IEEE  
For example, there is a need to design correct and testable chips in a very short time frame and for these chips to meet a competitive requirement.  ...  Design technology (DT) is concerned with the automated or semiautomated conception, synthesis, verification, and eventual testing of microelectronic systems.  ...  Not only is most of the test logic coming from functional logic, but the same test hardware can be used to perform a multitude of test functions.  ... 
doi:10.1109/5.915378 fatcat:jocv62sorfbnjp53u7b76j4mdi
« Previous Showing results 1 — 15 out of 4,772 results