Filters








75 Hits in 4.2 sec

Test Data Generation of Bytecode by CLP Partial Evaluation [chapter]

Elvira Albert, Miguel Gómez-Zamalloa, Germán Puebla
2009 Lecture Notes in Computer Science  
We employ existing partial evaluation (PE) techniques developed for Constraint Logic Programming (CLP) in order to automatically generate test-case generators for glass-box testing of bytecode.  ...  in order to supervise the generation of test-cases by execution of the CLP decompiled program.  ...  Generating Test Data Generators The final objective of a partial evaluator is to generate optimized residual code.  ... 
doi:10.1007/978-3-642-00515-2_2 fatcat:7i3yvts3ljc2jasrxw7ubnaewy

PET

Elvira Albert, Miguel Gómez-Zamalloa, Germán Puebla
2010 Proceedings of the ACM SIGPLAN 2010 workshop on Partial evaluation and program manipulation - PEPM '10  
It performs white-box test generation by means of two consecutive Partial Evaluations (PE).  ...  PET is a prototype Partial Evaluation-based Test case generation tool for a subset of Java bytecode programs.  ...  Acknowledgments This work was funded in part by the Information Society Technologies program of the European Commission, Future and Emerging Technologies under the IST-231620 HATS project, by the MEC under  ... 
doi:10.1145/1706356.1706363 dblp:conf/pepm/AlbertGP10 fatcat:sywvgcxktnberms7myhcmqdqfe

On the Generation of Test Data for Prolog by Partial Evaluation [article]

Miguel Gomez-Zamalloa, Elvira Albert, German Puebla
2009 arXiv   pre-print
In recent work, we have proposed an approach to Test Data Generation (TDG) of imperative bytecode by partial evaluation (PE) of CLP which consists in two phases: (1) the bytecode program is first transformed  ...  into an equivalent CLP program by means of interpretive compilation by PE, (2) a second PE is performed in order to supervise the generation of test-cases by execution of the CLP decompiled program.  ...  A General Scheme to TDG of Imperative Languages by PE In recent work, we have proposed an approach to Test Data Generation (TDG) by PE of CLP [2] and used it for TDG of bytecode.  ... 
arXiv:0903.2199v1 fatcat:p3odglgy3bfddntntjagauod5m

Test case generation for object-oriented imperative languages in CLP

MIGUEL GÓMEZ-ZAMALLOA, ELVIRA ALBERT, GERMÁN PUEBLA
2010 Theory and Practice of Logic Programming  
Test Case Generation (TCG) is the process of automatically generating a collection of test-cases which are applied to a system under test.  ...  We will support our claim by developing a fully CLP-based framework to TCG of an OO imperative language, and by assessing it on a corresponding implementation on a set of challenging Java programs.  ...  In this approach, the CLP-(de)compilation is obtained by partially evaluating an interpreter for the OO language written in CLP.  ... 
doi:10.1017/s1471068410000347 fatcat:z5cqxxtn3vfy3gnhltqmfgkvy4

Resource-Driven CLP-Based Test Case Generation [chapter]

Elvira Albert, Miguel Gómez-Zamalloa, José Miguel Rojas
2012 Lecture Notes in Computer Science  
Test Data Generation (TDG) aims at automatically obtaining test inputs which can then be used by a software testing tool to validate the functional behaviour of the program.  ...  Interestingly, given a resource policy, TDG is guided to generate test cases that adhere to the policy and avoid the generation of test cases which violate it. 3 The application of this approach to TDG  ...  Introduction Test data generation (TDG) is the process of automatically generating test inputs for interesting test coverage criteria.  ... 
doi:10.1007/978-3-642-32211-2_3 fatcat:p4dw2svg5zfbdlkxlyckxj4jwu

Compositional CLP-Based Test Data Generation for Imperative Languages [chapter]

Elvira Albert, Miguel Gómez-Zamalloa, José Miguel Rojas, Germán Puebla
2011 Lecture Notes in Computer Science  
Glass-box test data generation (TDG) is the process of automatically generating test input data for a program by considering its internal structure.  ...  The main idea in CLP-based TDG is to translate imperative programs into equivalent CLP ones and then rely on the standard evaluation mechanism of CLP to symbolically execute the imperative program.  ...  , by the Spanish Ministry of Science and Innovation (MICINN) under the TIN-2008-05624 DOVES project, the HI2008-0153 (Acción Integrada) project, the UCM-BSCH-GR58/08-910502 Research Group and by the Madrid  ... 
doi:10.1007/978-3-642-20551-4_7 fatcat:66o4wbi37nb3bnzv4q65vmbpgu

A Framework for Guided Test Case Generation in Constraint Logic Programming [chapter]

José Miguel Rojas, Miguel Gómez-Zamalloa
2013 Lecture Notes in Computer Science  
Performing test case generation by symbolic execution on large programs becomes quickly impracticable due to the path explosion problem.  ...  A common limitation that this problem poses is the generation of unnecessarily large number of possibly irrelevant or redundant test cases even for medium-size programs.  ...  program is translated into an equivalent CLP program by means of partial evaluation [7] .  ... 
doi:10.1007/978-3-642-38197-3_12 fatcat:7b45yzzxyvbp7hll636jj5lnvy

Analytical Inductive Functional Programming [chapter]

Emanuel Kitzelmann
2009 Lecture Notes in Computer Science  
Acknowledgement The author would like to thank anonymous reviewers for their constructive and useful comments on the previous version of the paper.  ...  Generating Test Data Generators The final objective of a partial evaluator is to generate optimized residual code.  ...  We employ existing partial evaluation (PE) techniques developed for Constraint Logic Programming (CLP) in order to automatically generate test-case generators for glass-box testing of bytecode.  ... 
doi:10.1007/978-3-642-00515-2_7 fatcat:r3xkzawlibfcpluopvlz7ukp4y

Constraint-logic object-oriented programming for test case generation

Hendrik Winkelmann, Laura Troost, Herbert Kuchen
2022 Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing  
The mentioned extension of Muli allows to automatically and systematically generate JUnit tests. We aim at a (nearly) minimal set of test cases achieving data-flow coverage.  ...  More precisely, Muli can symbolically execute Java bytecode as generated from languages such as Java, Scala or Kotlin.  ...  The Partial Evaluation-based Test case generation (PET) tool is an approach for constraint-logic object-oriented test case generation on Java Bytecode [1] .  ... 
doi:10.1145/3477314.3507015 fatcat:er324grfxbdfvhoflbbkkgtpvy

Prolog for Verification, Analysis and Transformation Tools

Michael Leuschel
2020 Electronic Proceedings in Theoretical Computer Science  
Guided by experience in teaching and the development of verification tools like ProB or specialisation tools like ECCE and LOGEN, the article presents an assessment of various aspects of Prolog and provides  ...  The article shows the usefulness of a few key Prolog features. In particular, it discusses how to deal with negation at the level of the object programs being verified or analysed.  ...  Acknowledgements I would like to thank Laurent Fribourg for his useful feedback on an earlier version of the article.  ... 
doi:10.4204/eptcs.320.6 fatcat:4ptzbt4pyfcirbfq6r7luzt6uq

Verification of Java Bytecode using Analysis and Transformation of Logic Programs [article]

Elvira Albert, Miguel Gómez-Zamalloa, Laurent Hubert, German Puebla
2010 arXiv   pre-print
More precisely, we propose to partially evaluate a JVML interpreter implemented in LP together with (an LP representation of) a JVML program and then analyze the residual program.  ...  We are not aware of any other system which is able to verify such advanced properties of Java bytecode.  ...  Acknowledgments This work was funded in part by the Information Society Technologies program of the European Commission, Future and Emerging Technologies under the IST-15905 MOBIUS project, by the Spanish  ... 
arXiv:1007.3250v1 fatcat:nsbjwvptyjem7d2u2tjq4kruna

Non-Termination Analysis of Java Bytecode [article]

Étienne Payet, Fred Mesnard, Fausto Spoto
2014 arXiv   pre-print
We have compared the results of Julia on a set of 113 programs with those provided by AProVE and Invel, the only freely usable non-termination analysers comparable to ours that we are aware of.  ...  Our approach can handle method calls; to the best of our knowledge, it is the first static approach for Java bytecode able to prove the existence of infinite recursions.  ...  So when the generated CLP program falls into this class, we could replace our general non-termination test by a decision procedure for non-termination.  ... 
arXiv:1401.5292v1 fatcat:r64sblzjfngrnhsa5tp7d6zeqm

Towards a framework for algorithm recognition in binary code

Frédéric Mesnard, Étienne Payet, Wim Vanhoof
2016 Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming - PPDP '16  
Then we consider programs as implementing the same algorithm if their Horn clause representations can be reduced to a single common set of Horn clauses by means of a sequence of transformations.  ...  For this paper, we have chosen the Dalvik Virtual Machine (DVM) bytecode.  ...  This interpreter together with a term representation of the imperative program to be analyzed is partially evaluated.  ... 
doi:10.1145/2967973.2968600 dblp:conf/ppdp/MesnardPV16 fatcat:4emlx5zylbcv5nk2ym26anlmyy

Lightweight compilation of (C)LP to JavaScript

JOSE F. MORALES, RÉMY HAEMMERLÉ, MANUEL CARRO, MANUEL V. HERMENEGILDO
2012 Theory and Practice of Logic Programming  
We demonstrate the maturity of the compiler by testing it with complex code such as a CLP(FD) library written in Prolog with attributed variables.  ...  Finally, we validate our proposal by measuring the performance of some LP and CLP(FD) benchmarks running on top of major JavaScript engines.  ...  Conclusions and future work We believe our system makes a significant contribution towards the practical feasibility of client-side Web applications based (fully or partially) on (constraint) logic programming  ... 
doi:10.1017/s1471068412000336 fatcat:reuxpfqs6bbotlgfcg6dp5j6ia

Software Model Checking by Program Specialization

Emanuele De Angelis, Marc Herbstritt
2012 International Conference on Logic Programming  
We introduce a general verification framework based on program specialization to prove properties of the runtime behaviour of imperative programs.  ...  , (ii) specializing I and S with respect to P and ϕ, and (iii) analysing the specialized program by performing a further specialization.  ...  Software Model Checking by Program Specialization Another challenging issue is the extension of the set of properties which can be proved.  ... 
doi:10.4230/lipics.iclp.2012.439 dblp:conf/iclp/Angelis12 fatcat:37jeza5ccbbhbgwbqpghzjfi4y
« Previous Showing results 1 — 15 out of 75 results