Dorel Lucanu | Universitatea Alexandru Ioan Cuza Iasi (original) (raw)

Uploads

Papers by Dorel Lucanu

Research paper thumbnail of On bisimimulation in hiddenCCS

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Classes and Objects in Hidden Algebra

Bookmarks Related papers MentionsView impact

Research paper thumbnail of A Logical Foundation of the OWL Languages

Bookmarks Related papers MentionsView impact

Research paper thumbnail of CIRC prover

Bookmarks Related papers MentionsView impact

Research paper thumbnail of The k primer (version 3.3)

Bookmarks Related papers MentionsView impact

Research paper thumbnail of On Abstractions for Timing Analysis in the\ mathbb {K} Framework

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

Research paper thumbnail of Concurrent object composition in CafeOBJ

Bookmarks Related papers MentionsView impact

Research paper thumbnail of The K primer (version 2.5)

Bookmarks Related papers MentionsView impact

Research paper thumbnail of CinKโ€“an exercise on how to think in K

Bookmarks Related papers MentionsView impact

Research paper thumbnail of The K primer (version 2.5)

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Language-Independent Program Verification Using Symbolic Execution

Bookmarks Related papers MentionsView impact

Research paper thumbnail of K Semantics for OCL-a Proposal for a Formal Definition for OCL

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Model checking recursive programs interacting via the heap

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

Research paper thumbnail of Bounded Model Checking of Recursive Programs with Pointers in K

Lecture Notes in Computer Science, 2013

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Interacting via the Heap in the Presence of Recursion

Electronic Proceedings in Theoretical Computer Science, 2012

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Behavioral Rewrite Systems and Behavioral Productivity

Lecture Notes in Computer Science, 2014

Bookmarks Related papers MentionsView impact

Research paper thumbnail of A <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi mathvariant="double-struck">K</mi></mrow><annotation encoding="application/x-tex">\mathbb{K}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6889em;"></span><span class="mord mathbb">K</span></span></span></span> -Based Formal Framework for Domain-Specific Modelling Languages

Lecture Notes in Computer Science, 2012

Bookmarks Related papers MentionsView impact

Research paper thumbnail of A Generic Framework for Symbolic Execution

Lecture Notes in Computer Science, 2013

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Towards a Semantics for OCL

Electronic Notes in Theoretical Computer Science, 2014

Bookmarks Related papers MentionsView impact

Research paper thumbnail of On Automation of OTS/CafeOBJ Method

Lecture Notes in Computer Science, 2014

Bookmarks Related papers MentionsView impact

Research paper thumbnail of On bisimimulation in hiddenCCS

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Classes and Objects in Hidden Algebra

Bookmarks Related papers MentionsView impact

Research paper thumbnail of A Logical Foundation of the OWL Languages

Bookmarks Related papers MentionsView impact

Research paper thumbnail of CIRC prover

Bookmarks Related papers MentionsView impact

Research paper thumbnail of The k primer (version 3.3)

Bookmarks Related papers MentionsView impact

Research paper thumbnail of On Abstractions for Timing Analysis in the\ mathbb {K} Framework

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

Research paper thumbnail of Concurrent object composition in CafeOBJ

Bookmarks Related papers MentionsView impact

Research paper thumbnail of The K primer (version 2.5)

Bookmarks Related papers MentionsView impact

Research paper thumbnail of CinKโ€“an exercise on how to think in K

Bookmarks Related papers MentionsView impact

Research paper thumbnail of The K primer (version 2.5)

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Language-Independent Program Verification Using Symbolic Execution

Bookmarks Related papers MentionsView impact

Research paper thumbnail of K Semantics for OCL-a Proposal for a Formal Definition for OCL

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Model checking recursive programs interacting via the heap

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

Research paper thumbnail of Bounded Model Checking of Recursive Programs with Pointers in K

Lecture Notes in Computer Science, 2013

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Interacting via the Heap in the Presence of Recursion

Electronic Proceedings in Theoretical Computer Science, 2012

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Behavioral Rewrite Systems and Behavioral Productivity

Lecture Notes in Computer Science, 2014

Bookmarks Related papers MentionsView impact

Research paper thumbnail of A <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi mathvariant="double-struck">K</mi></mrow><annotation encoding="application/x-tex">\mathbb{K}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6889em;"></span><span class="mord mathbb">K</span></span></span></span> -Based Formal Framework for Domain-Specific Modelling Languages

Lecture Notes in Computer Science, 2012

Bookmarks Related papers MentionsView impact

Research paper thumbnail of A Generic Framework for Symbolic Execution

Lecture Notes in Computer Science, 2013

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Towards a Semantics for OCL

Electronic Notes in Theoretical Computer Science, 2014

Bookmarks Related papers MentionsView impact

Research paper thumbnail of On Automation of OTS/CafeOBJ Method

Lecture Notes in Computer Science, 2014

Bookmarks Related papers MentionsView impact

Log In