Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant prop-agation, etc. Recursive state machines (RSMs) are standard mod-els for interprocedural analysis. We consider a general framework with RSMs where the transitions are labeled from a semiring, and path properties are algebraic with semiring operations. RSMs with algebraic path properties can model interprocedural dataflow anal-ysis problems, the shortest path problem, the most probable path problem, etc. The traditional algorithms for interprocedural analy-sis focus on path properties where the starting point is fixed as the entry point of a specific method. In this work, we consider pos-sible multiple queries as re...
We study algorithmic questions for concurrent systems where the transitions are labeled from a compl...
We study algorithmic questions for concurrent systems where the transitions are labeled from a com...
We propose a general formal model of isolated hierarchical parallel computations, and identify sever...
Interprocedural analysis is at the heart of numerous applications in programming languages, such as ...
Interprocedural analysis is at the heart of numerous applications in programming languages, such as ...
Interprocedural analysis is at the heart of numerous applications in programming languages, such as ...
Interprocedural analysis is at the heart of numerous applications in programming languages, such as ...
Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are stan...
We study algorithmic questions for concurrent systems where the transitions are labeled from a compl...
1 Introduction In traditional model checking, the model is a finite state machine whose vertices cor...
We study algorithmic questions for concurrent systems where the transitions are labeled from a compl...
We study algorithmic questions wrt algebraic path properties in concurrent systems, where the transi...
Recursive state machines (RSMs) enhance the power of ordinary state machines by allowing vertices to...
We present a literature review on the algebraic path problem and describe different sequential and s...
We study algorithmic questions for concurrent systems where the transitions are labeled from a compl...
We study algorithmic questions for concurrent systems where the transitions are labeled from a com...
We propose a general formal model of isolated hierarchical parallel computations, and identify sever...
Interprocedural analysis is at the heart of numerous applications in programming languages, such as ...
Interprocedural analysis is at the heart of numerous applications in programming languages, such as ...
Interprocedural analysis is at the heart of numerous applications in programming languages, such as ...
Interprocedural analysis is at the heart of numerous applications in programming languages, such as ...
Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are stan...
We study algorithmic questions for concurrent systems where the transitions are labeled from a compl...
1 Introduction In traditional model checking, the model is a finite state machine whose vertices cor...
We study algorithmic questions for concurrent systems where the transitions are labeled from a compl...
We study algorithmic questions wrt algebraic path properties in concurrent systems, where the transi...
Recursive state machines (RSMs) enhance the power of ordinary state machines by allowing vertices to...
We present a literature review on the algebraic path problem and describe different sequential and s...
We study algorithmic questions for concurrent systems where the transitions are labeled from a compl...
We study algorithmic questions for concurrent systems where the transitions are labeled from a com...
We propose a general formal model of isolated hierarchical parallel computations, and identify sever...