Publicação
Modeling assembly program with constraints. A contribution to WCET problem
| dc.contributor.advisor | Barahona, Pedro | |
| dc.contributor.advisor | Cassez, Franck | |
| dc.contributor.author | Kafle, Bishoksan | |
| dc.date.accessioned | 2012-10-15T10:35:07Z | |
| dc.date.available | 2012-10-15T10:35:07Z | |
| dc.date.issued | 2012 | |
| dc.description | Dissertação para obtenção do Grau de Mestre em Lógica Computacional | por |
| dc.description.abstract | Model checking with program slicing has been successfully applied to compute Worst Case Execution Time (WCET) of a program running in a given hardware. This method lacks path feasibility analysis and suffers from the following problems: The model checker (MC) explores exponential number of program paths irrespective of their feasibility. This limits the scalability of this method to multiple path programs. And the witness trace returned by the MC corresponding to WCET may not be feasible (executable). This may result in a solution which is not tight i.e., it overestimates the actual WCET. This thesis complements the above method with path feasibility analysis and addresses these problems. To achieve this: we first validate the witness trace returned by the MC and generate test data if it is executable. For this we generate constraints over a trace and solve a constraint satisfaction problem. Experiment shows that 33% of these traces (obtained while computing WCET on standard WCET benchmark programs) are infeasible. Second, we use constraint solving technique to compute approximate WCET solely based on the program (without taking into account the hardware characteristics), and suggest some feasible and probable worst case paths which can produce WCET. Each of these paths forms an input to the MC. The more precise WCET then can be computed on these paths using the above method. The maximum of all these is the WCET. In addition this, we provide a mechanism to compute an upper bound of over approximation for WCET computed using model checking method. This effort of combining constraint solving technique with model checking takes advantages of their strengths and makes WCET computation scalable and amenable to hardware changes. We use our technique to compute WCET on standard benchmark programs from M¨alardalen University and compare our results with results from model checking method. | por |
| dc.identifier.uri | http://hdl.handle.net/10362/7968 | |
| dc.language.iso | eng | por |
| dc.publisher | Faculdade de Ciências e Tecnologia | por |
| dc.subject | Worst Case Execution Time (WCET) | por |
| dc.subject | Constraint solving | por |
| dc.subject | Model checking | por |
| dc.subject | Static analysis | por |
| dc.title | Modeling assembly program with constraints. A contribution to WCET problem | por |
| dc.type | master thesis | |
| dspace.entity.type | Publication | |
| rcaap.rights | openAccess | por |
| rcaap.type | masterThesis | por |