Dorel Lucanu | Universitatea Alexandru Ioan Cuza Iasi (original) (raw)
Uploads
Papers by Dorel Lucanu
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
ABSTRACT Low-level WCET analysis consists of two subproblems: the path analysis and the processor... more ABSTRACT Low-level WCET analysis consists of two subproblems: the path analysis and the processor behavior analysis. A successful approach uses an integer linear programming (ILP) solution for the former and an abstract interpretation (AI) solution for the latter. This paper advocates, for this particular ILP + AI approach, the use of a specialized rewrite-based framework, called ๐. We define this methodology in ๐, starting from the formal executable semantics of the language and the concrete, parametric, description of the underlying micro-architecture (i.e. instruction cache). The latter is designed to facilitate specification reusability in the abstraction definition. We also analyze the definitional methodology of the ILP + AI approach, from the design perspective.
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Science of Computer Programming, 2015
ABSTRACT Almost all modern imperative programming languages include operations for dynamically ma... more ABSTRACT Almost all modern imperative programming languages include operations for dynamically manipulating the heap, for example by allocating and deallocating objects, and by updating reference fields. In the presence of recursive procedures and local variables, the interactions of a program with the heap can become rather complex, as an unbounded number of objects can be allocated either on the call stack using local variables, or, anonymously, on the heap using reference fields. As such, a static analysis for recursive programs with dynamic manipulation of the heap is, in general, undecidable.
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2013
Bookmarks Related papers MentionsView impact
Electronic Proceedings in Theoretical Computer Science, 2012
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2014
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2012
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2013
Bookmarks Related papers MentionsView impact
Electronic Notes in Theoretical Computer Science, 2014
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2014
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
ABSTRACT Low-level WCET analysis consists of two subproblems: the path analysis and the processor... more ABSTRACT Low-level WCET analysis consists of two subproblems: the path analysis and the processor behavior analysis. A successful approach uses an integer linear programming (ILP) solution for the former and an abstract interpretation (AI) solution for the latter. This paper advocates, for this particular ILP + AI approach, the use of a specialized rewrite-based framework, called ๐. We define this methodology in ๐, starting from the formal executable semantics of the language and the concrete, parametric, description of the underlying micro-architecture (i.e. instruction cache). The latter is designed to facilitate specification reusability in the abstraction definition. We also analyze the definitional methodology of the ILP + AI approach, from the design perspective.
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Science of Computer Programming, 2015
ABSTRACT Almost all modern imperative programming languages include operations for dynamically ma... more ABSTRACT Almost all modern imperative programming languages include operations for dynamically manipulating the heap, for example by allocating and deallocating objects, and by updating reference fields. In the presence of recursive procedures and local variables, the interactions of a program with the heap can become rather complex, as an unbounded number of objects can be allocated either on the call stack using local variables, or, anonymously, on the heap using reference fields. As such, a static analysis for recursive programs with dynamic manipulation of the heap is, in general, undecidable.
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2013
Bookmarks Related papers MentionsView impact
Electronic Proceedings in Theoretical Computer Science, 2012
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2014
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2012
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2013
Bookmarks Related papers MentionsView impact
Electronic Notes in Theoretical Computer Science, 2014
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2014
Bookmarks Related papers MentionsView impact