The Experts below are selected from a list of 135 Experts worldwide ranked by ideXlab platform
Jack W. Davidson - One of the best experts on this subject based on the ideXlab platform.
-
Automatic detection and diagnosis of faults in generated code for procedure calls
IEEE Transactions on Software Engineering, 2003Co-Authors: Mark W. Bailey, Jack W. DavidsonAbstract:In this paper, we present a compiler testing technique that closes the gap between existing compiler implementations and correct compilers. Using formal specifications of procedure-Calling conventions, we have built a target-sensitive test suite generator that builds test cases for a specific aspect of compiler code generators: the procedure-Calling Sequence generator. By exercising compilers with these specification-derived target-specific test suites, our automated testing tool has exposed bugs in every compiler tested on the MIPS and one compiler on the SPARC. These compilers include some that have been in heavy use for many years. Once a fault has been detected, the system can often suggest the nature of the problem. The testing system is an invaluable tool for detecting, isolating, and correcting faults in today's compilers.
-
Target-sensitive construction of diagnostic programs for procedure Calling Sequence generators
ACM SIGPLAN Notices, 1996Co-Authors: Mark W. Bailey, Jack W. DavidsonAbstract:Building compilers that generate correct code is difficult. In this paper we present a compiler testing technique that closes the gap between actual compiler implementations and correct compilers. Using formal specifications of procedure Calling conventions, we have built a target-sensitive test suite generator that builds test cases for a specific aspect of compiler code generators the procedure Calling Sequence generator. By exercising compilers with these target-specific test suites, our automated testing tool has exposed bugs in every compiler tested. These compilers include ones that have been in heavy use for many years. The detected bugs cause more than 14,000 test cases to fail.
-
PLDI - Target-sensitive construction of diagnostic programs for procedure Calling Sequence generators
Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation - PLDI '96, 1996Co-Authors: Mark W. Bailey, Jack W. DavidsonAbstract:Building compilers that generate correct code is difficult. In this paper we present a compiler testing technique that closes the gap between actual compiler implementations and correct compilers. Using formal specifications of procedure Calling conventions, we have built a target-sensitive test suite generator that builds test cases for a specific aspect of compiler code generators the procedure Calling Sequence generator. By exercising compilers with these target-specific test suites, our automated testing tool has exposed bugs in every compiler tested. These compilers include ones that have been in heavy use for many years. The detected bugs cause more than 14,000 test cases to fail.
Mark W. Bailey - One of the best experts on this subject based on the ideXlab platform.
-
Automatic detection and diagnosis of faults in generated code for procedure calls
IEEE Transactions on Software Engineering, 2003Co-Authors: Mark W. Bailey, Jack W. DavidsonAbstract:In this paper, we present a compiler testing technique that closes the gap between existing compiler implementations and correct compilers. Using formal specifications of procedure-Calling conventions, we have built a target-sensitive test suite generator that builds test cases for a specific aspect of compiler code generators: the procedure-Calling Sequence generator. By exercising compilers with these specification-derived target-specific test suites, our automated testing tool has exposed bugs in every compiler tested on the MIPS and one compiler on the SPARC. These compilers include some that have been in heavy use for many years. Once a fault has been detected, the system can often suggest the nature of the problem. The testing system is an invaluable tool for detecting, isolating, and correcting faults in today's compilers.
-
Target-sensitive construction of diagnostic programs for procedure Calling Sequence generators
ACM SIGPLAN Notices, 1996Co-Authors: Mark W. Bailey, Jack W. DavidsonAbstract:Building compilers that generate correct code is difficult. In this paper we present a compiler testing technique that closes the gap between actual compiler implementations and correct compilers. Using formal specifications of procedure Calling conventions, we have built a target-sensitive test suite generator that builds test cases for a specific aspect of compiler code generators the procedure Calling Sequence generator. By exercising compilers with these target-specific test suites, our automated testing tool has exposed bugs in every compiler tested. These compilers include ones that have been in heavy use for many years. The detected bugs cause more than 14,000 test cases to fail.
-
PLDI - Target-sensitive construction of diagnostic programs for procedure Calling Sequence generators
Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation - PLDI '96, 1996Co-Authors: Mark W. Bailey, Jack W. DavidsonAbstract:Building compilers that generate correct code is difficult. In this paper we present a compiler testing technique that closes the gap between actual compiler implementations and correct compilers. Using formal specifications of procedure Calling conventions, we have built a target-sensitive test suite generator that builds test cases for a specific aspect of compiler code generators the procedure Calling Sequence generator. By exercising compilers with these target-specific test suites, our automated testing tool has exposed bugs in every compiler tested. These compilers include ones that have been in heavy use for many years. The detected bugs cause more than 14,000 test cases to fail.
Huang He-jie - One of the best experts on this subject based on the ideXlab platform.
-
Malicious Code Behavior Analysis Based on DynamoRIO
Computer Engineering, 2011Co-Authors: Huang He-jieAbstract:This paper proposes a method based on dynamic binary analysis to analyze malicious code behavior and designs and implements a prototype malicious behavior analysis system based on DynamoRIO.Experimental results show that the system can capture Application Programming Interface(API) functions Calling Sequence and transfer parameter information completely.Based on correlative analysis of the Calling Sequence and the parameter information,malicious behaviors which cover files,the registry,services,processes,threads and so on are identified.
Slaven Glumac - One of the best experts on this subject based on the ideXlab platform.
-
Calling Sequence calculation for sequential co simulation master
Principles of Advanced Discrete Simulation, 2018Co-Authors: Slaven Glumac, Zdenko KovacicAbstract:This paper explores the improvement of non-iterative co-simulation master. A simple hybrid system is depicted and analyzed. Based on this analysis guidelines for calculating the Calling Sequence are introduced. Guidelines allow the implementation of a new constraint programming algorithm. This algorithm allows better Calling Sequence selection based solely on information about connecting the co-simulation network. The algorithm is confirmed by the example of co-simulation of a hybrid electric vehicle. In this example, the constraint programming algorithm found a subjectively good Calling Sequence without any involvement of the model developer.
-
SIGSIM-PADS - Calling Sequence Calculation for Sequential Co-simulation Master
Proceedings of the 2018 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, 2018Co-Authors: Slaven Glumac, Zdenko KovačićAbstract:This paper explores the improvement of non-iterative co-simulation master. A simple hybrid system is depicted and analyzed. Based on this analysis guidelines for calculating the Calling Sequence are introduced. Guidelines allow the implementation of a new constraint programming algorithm. This algorithm allows better Calling Sequence selection based solely on information about connecting the co-simulation network. The algorithm is confirmed by the example of co-simulation of a hybrid electric vehicle. In this example, the constraint programming algorithm found a subjectively good Calling Sequence without any involvement of the model developer.
Nenad Mladenović - One of the best experts on this subject based on the ideXlab platform.
-
Routing of barge container ships by mixed-integer programming heuristics
Applied Soft Computing, 2013Co-Authors: Vladislav Maras, Jasmina Lazić, Tatjana Davidović, Nenad MladenovićAbstract:Abstract We investigate the optimization of transport routes of barge container ships with the objective to maximize the profit of a shipping company. This problem consists of determining the upstream and downstream Calling Sequence and the number of loaded and empty containers transported between any two ports. We present a mixed integer linear programming (MILP) formulation for this problem. The problem is tackled by the commercial CPLEX MIP solver and improved variants of the existing MIP heuristics: Local Branching, Variable Neighborhood Branching and Variable Neighborhood Decomposition Search. It appears that our implementation of Variable Neighborhood Branching outperforms CPLEX MIP solver both regarding the solution quality and the computational time. All other studied heuristics provide results competitive with CPLEX MIP solver within a significantly shorter amount of time. Moreover, we present a detailed case study transportation analysis which illustrates how the proposed approach can be used by managers of barge shipping companies to make appropriate decisions and solve real life problems.
