AbstractWe address the problem of generating a minimal state graph from a program, without building the whole state graph. Minimality is considered here with respect to bisimulation. A generation algorithm is derived and illustrated. Applications concern program verification and control synthesis in reactive program compilation
In this paper, behaviors with equal input and output cardinalities and with lossless positive real t...
AbstractMany optimizing compilers use interprocedural analysis to determine how the source program u...
In this paper we present an intermediate program representation, called the program dependence graph...
AbstractWe address the problem of generating a minimal state graph from a program, without building ...
Abstract: GP (for Graph Programs) is a rule-based, nondeterministic program-ming language for solvin...
A fundamental issue in the automated analysis of communicating systems is the efficient generation o...
In this paper we develop an algorithm, based on abstract interpretation, for source specialisation o...
A fundamental issue in the automated analysis of communicating systems is the efficient generation o...
Graphs may be used as representations of system states in operational semantics and model checking; ...
Abstract. In software engineering, graphical formalisms, like state-transition tables and automata, ...
Abstract. In software engineering, graphical formalisms, like state-transition tables and automata, ...
Graphs may be used as representations of system states in operational semantics and model checking; ...
A simple procedure for the state minimization of an incompletely specified sequential machine whose ...
In this paper, behaviors with equal input and output cardinalities and with lossless positive real t...
AbstractGraphs may be used as representations of system states in operational semantics and model ch...
In this paper, behaviors with equal input and output cardinalities and with lossless positive real t...
AbstractMany optimizing compilers use interprocedural analysis to determine how the source program u...
In this paper we present an intermediate program representation, called the program dependence graph...
AbstractWe address the problem of generating a minimal state graph from a program, without building ...
Abstract: GP (for Graph Programs) is a rule-based, nondeterministic program-ming language for solvin...
A fundamental issue in the automated analysis of communicating systems is the efficient generation o...
In this paper we develop an algorithm, based on abstract interpretation, for source specialisation o...
A fundamental issue in the automated analysis of communicating systems is the efficient generation o...
Graphs may be used as representations of system states in operational semantics and model checking; ...
Abstract. In software engineering, graphical formalisms, like state-transition tables and automata, ...
Abstract. In software engineering, graphical formalisms, like state-transition tables and automata, ...
Graphs may be used as representations of system states in operational semantics and model checking; ...
A simple procedure for the state minimization of an incompletely specified sequential machine whose ...
In this paper, behaviors with equal input and output cardinalities and with lossless positive real t...
AbstractGraphs may be used as representations of system states in operational semantics and model ch...
In this paper, behaviors with equal input and output cardinalities and with lossless positive real t...
AbstractMany optimizing compilers use interprocedural analysis to determine how the source program u...
In this paper we present an intermediate program representation, called the program dependence graph...
DOI
Add to ORKG