Filters








16,452 Hits in 1.9 sec

Towards Bounded Infeasible Code Detection [article]

Jürgen Christ, Jochen Hoenicke, Martin Schäf
2012 arXiv   pre-print
In this paper, we present a formal method to automatically compute test cases for this purpose based on the idea of a bounded infeasible code detection.  ...  A first step towards more reliable software is to execute each statement and each control-flow path in a method once.  ...  In this paper, we discuss a bounded approach towards infeasible code detection that generates test cases that cover all statements which have feasible executions within a given (bounded) number of loop  ... 
arXiv:1205.6527v1 fatcat:hnclvkwk2nh4thf7kz4kaudqqu

Computer Codes for the Analysis of Infeasible Linear Program

John W Chinneck
1996 Journal of the Operational Research Society  
Simple bound-tightening presolve routines, readily available for years, are often unable to detect infeasibility or to provide useful guidance if infeasibility is detected.  ...  CPLEX also has a built-in presolve that includes bound-tightening, which can sometimes detect infeasibility.  ... 
doi:10.1057/palgrave.jors.0470106 fatcat:yr3aahq4nnhordkuuneopvduf4

Computer Codes for the Analysis of Infeasible Linear Programs

John W. Chinneck
1996 Journal of the Operational Research Society  
Simple bound-tightening presolve routines, readily available for years, are often unable to detect infeasibility or to provide useful guidance if infeasibility is detected.  ...  CPLEX also has a built-in presolve that includes bound-tightening, which can sometimes detect infeasibility.  ... 
doi:10.1057/jors.1996.6 fatcat:zpcvx4au6bdofgcsfe6edivibq

Interior-point methods for nonconvex nonlinear programming: regularization and warmstarts

Hande Y. Benson, David F. Shanno
2007 Computational optimization and applications  
Dual Infeasibility Detection. As discussed in the previous section, the primal-dual penalty approach can be used to detect dual infeasible problems.  ...  We will discuss results of dual infeasibility detection later in this section. argauss himmelbd lewispol Table 5 . Primal infeasible problems identified by the hybrid code. Table 7 .  ... 
doi:10.1007/s10589-007-9089-x fatcat:s6gccg54ovfhrfsvvmdiwyyvyu

Program Semantics in Model-Based WCET Analysis: A State of the Art Perspective

Mihail Asavoae, Claire Maiza, Pascal Raymond, Marc Herbstritt
2013 Worst-Case Execution Time Analysis  
When the application is a hard real-time program, such guarantees could be deadlines, thus making the computation of worst-case execution time (WCET) bounds mandatory.  ...  Infeasible Paths Detection The ability to detect infeasible execution paths greatly influences the precision of a WCET analysis.  ...  The detection of loop bounds [16, 28] or infeasible paths [18, 29, 50] generate flow facts which are directly expressible into integer linear programming.  ... 
doi:10.4230/oasics.wcet.2013.32 dblp:conf/wcet/AsavoaeMR13 fatcat:oabyuwtwmvdkhakzwq5dgzmkee

Targeting Infeasibility Questions on Obfuscated Codes [article]

Robin David, Sébastien Bardin, Jean-Yves Marion
2016 arXiv   pre-print
Many issues arising during reverse, e.g. detecting protection schemes such as opaque predicates fall into the category of infeasibility questions.  ...  In this article, we present the Backward-Bounded DSE, a generic, precise, efficient and robust method for solving infeasibility questions.  ...  BACKWARD-BOUNDED DSE We present in this section the new Backward-Bounded DSE technique dedicated to solving infeasibility queries on binary codes.  ... 
arXiv:1612.05675v1 fatcat:u7k5owg4avb37o3pvier7kcd74

Performance debugging of Esterel specifications

Lei Ju, Bach Khoa Huynh, Abhik Roychoudhury, Samarjit Chakraborty
2008 Proceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis - CODES/ISSS '08  
Abstract Syntax Tree (AST) C-Esterel mapping WCET analysis (w/ infeasible path elimination)  ...  In this paper we perform WCET analysis on sequential C code and exploit the structure of the code generated from Esterel specifications to obtain tight WCET estimates.  ...  Our first step towards maintaining backwards traceability is to provide a mapping from assembly to C code.  ... 
doi:10.1145/1450135.1450175 dblp:conf/codes/JuHRC08 fatcat:4p7fgczwireglhxw2rnea5lorm

Performance debugging of Esterel specifications

Lei Ju, Bach Khoa Huynh, Abhik Roychoudhury, Samarjit Chakraborty
2012 Real-time systems  
Abstract Syntax Tree (AST) C-Esterel mapping WCET analysis (w/ infeasible path elimination)  ...  In this paper we perform WCET analysis on sequential C code and exploit the structure of the code generated from Esterel specifications to obtain tight WCET estimates.  ...  Our first step towards maintaining backwards traceability is to provide a mapping from assembly to C code.  ... 
doi:10.1007/s11241-012-9155-z fatcat:wg5bdizyk5fefgdhdh7wagd4mu

Infeasible Code Detection [chapter]

Cristiano Bertolini, Martin Schäf, Pascal Schweitzer
2012 Lecture Notes in Computer Science  
We develop an algorithm for the automatic detection of all infeasible code in a program.  ...  A piece of code in a computer program is infeasible if it cannot be part of any normally-terminating execution of the program.  ...  However, infeasible code detection only detects non-termination if any execution entering the loop must run forever. Examples of Infeasible Code The program ex02 has infeasible code in line 3.  ... 
doi:10.1007/978-3-642-27705-4_24 fatcat:2cxxwqqt3vfxtaosltttjzm6je

Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming [chapter]

Hande Y. Benson
2011 IMA Volumes in Mathematics and its Applications  
However, traditionally, infeasible primal-dual interior-point methods have had two main perceived deficiencies: (1) lack of infeasibility detection capabilities, and (2) poor performance after a warmstart  ...  Additional benefits include robustness due to regularization and infeasibility detection capabilities.  ...  If a feasible solution is found, the algorithm proceeds toward the optimum from there. Otherwise, a certificate of infeasibility is issued.  ... 
doi:10.1007/978-1-4614-1927-3_7 fatcat:ewip4pylxjdzjgvtq34okwxxim

Improving WCET Evaluation using Linear Relation Analysis

Pascal Raymond, Claire Maiza, Catherine Parent-Vigouroux, Erwan Jahier, Nicolas Halbwachs, Fabienne Carrier, Mihail Asavoae, Rémy Boutonnet
2017 Leibniz Transactions on Embedded Systems  
The precision of a worst case execution time (WCET) evaluation tool on a given program is highly dependent on how the tool is able to detect and discard semantically infeasible executions of the program  ...  The approach towards computing loop bounds is not general, but it handles loop patterns.  ...  On Example 1, Chronos is unable to detect dead code 5 .  ... 
doi:10.4230/lites-v006-i001-a002 dblp:journals/lites/RaymondMPJHCAB19 fatcat:ay5jjbthkfhedngdftpfqo5tty

Reconstructing Paths for Reachable Code [chapter]

Stephan Arlt, Zhiming Liu, Martin Schäf
2013 Lecture Notes in Computer Science  
The challenge for an infeasible code detection algorithm is to find executions that cover all statements with feasible executions as fast as possible. The remaining statements are infeasible code.  ...  Infeasible code has proved to be an interesting target for static analysis.  ...  ., [1] ) that can be used for bounded, and inter-procedural infeasible code detection.  ... 
doi:10.1007/978-3-642-41202-8_28 fatcat:jpqpvdyql5bznouye23bizlue4

Mixed integer nonlinear programming using interior-point methods

Hande Y. Benson
2011 Optimization Methods and Software  
The approach combines a branch-and-bound algorithm in the outer iterations and an infeasible interior-point method in the inner iterations.  ...  of infeasible subproblems, and present numerical results on a standard problem library.  ...  Also in a branch-and-bound approach, subproblems may become infeasible, and it is important to detect such cases early and reliably.  ... 
doi:10.1080/10556781003799303 fatcat:n7t2v5s4hnabfjz3zfkk4uegau

Influence of procedure cloning on WCET prediction

Paul Lokuciejewski, Heiko Falk, Martin Schwarzer, Peter Marwedel, Henrik Theiling
2007 Proceedings of the 5th IEEE/ACM international conference on Hardware/software codesign and system synthesis - CODES+ISSS '07  
This paper presents the effect of procedure cloning applied at the source-code level on worst-case execution time.  ...  Procedure cloning helps by making such data-dependent loops explicit within the source code, thus making them accessible for high-precision WCET analyses.  ...  We carefully examine how cloning influences the specification and consideration of precise loop bounds and the detection of infeasible paths during WCET analysis.  ... 
doi:10.1145/1289816.1289852 dblp:conf/codes/LokuciejewskiFSMT07 fatcat:wzukjafibbdkxo665syahorxa4

Towards Efficient Data-flow Test Data Generation [article]

Ting Su, Chengyu Zhang, Yichen Yan, Lingling Fan, Geguang Pu, Yang Liu, Zhoulai Fu, Zhendong Su
2019 arXiv   pre-print
Data-flow testing (DFT) aims to detect potential data interaction anomalies by focusing on the points at which variables receive values and the points at which these values are used.  ...  open-source and industrial program subjects shows (1) our SE-based approach can improve DFT performance by 15∼48 and (2) our combined approach can further reduce testing time by 20.1∼93.6 eliminating infeasible  ...  Detecting Infeasible Test Objectives As for detecting infeasible test objectives, early work uses constraint-based technique [45, 78] [68] also use weakest precondition to identify polluting test  ... 
arXiv:1803.10431v2 fatcat:cprh4dx44fhtfl2itbagcqovby
« Previous Showing results 1 — 15 out of 16,452 results