Sciweavers

945 search results - page 88 / 189
» Graph Types
Sort
View
ADAEUROPE
2008
Springer
15 years 8 months ago
A Framework for CFG-Based Static Program Analysis of Ada Programs
Abstract. The control flow graph is the basis for many code optimisation and analysis techniques. We introduce a new framework for the construction of powerful CFG-based represent...
Raul Fechete, Georg Kienesberger, Johann Blieberge...
ACSD
2005
IEEE
90views Hardware» more  ACSD 2005»
15 years 8 months ago
Improved Decomposition of STGs
Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a...
Walter Vogler, Ben Kangsah
WCRE
2005
IEEE
15 years 8 months ago
Toward an Infrastructure to Support Interoperability in Reverse Engineering
In this paper we present an infrastructure that supports interoperability among various reverse engineering tools and applications. We include an Application Programmer’s Interf...
Nicholas A. Kraft, Brian A. Malloy, James F. Power
ICDT
2003
ACM
121views Database» more  ICDT 2003»
15 years 7 months ago
Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
Floris Geerts, Bart Kuijpers
ICALP
2010
Springer
15 years 7 months ago
The Downward-Closure of Petri Net Languages
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
Peter Habermehl, Roland Meyer, Harro Wimmel