Sciweavers

256 search results - page 24 / 52
» Application-Only Call Graph Construction
Sort
View
IPPS
2009
IEEE
14 years 4 months ago
Deadlock prevention by turn prohibition in interconnection networks
Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa
ENTCS
2006
109views more  ENTCS 2006»
13 years 10 months ago
Specifications via Realizability
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
Andrej Bauer, Christopher A. Stone
DCG
2007
125views more  DCG 2007»
13 years 9 months ago
Alcoved Polytopes, I
The aim of this paper is to initiate the study of alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many clas...
Thomas Lam, Alexander Postnikov
CONCUR
2006
Springer
13 years 11 months ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
TVCG
2008
140views more  TVCG 2008»
13 years 9 months ago
Efficient Morse Decompositions of Vector Fields
Vector field analysis plays a crucial role in many engineering applications, such as weather prediction, tsunami and hurricane study, and airplane and automotive design. Existing ...
Guoning Chen, Konstantin Mischaikow, Robert S. Lar...