Sciweavers

6315 search results - page 1103 / 1263
» Approximating Solution Structure
Sort
View
122
Voted
SAS
1999
Springer
116views Formal Methods» more  SAS 1999»
15 years 6 months ago
Decomposing Non-redundant Sharing by Complementation
Complementation, the inverse of the reduced product operation, is a technique for systemfinding minimal decompositions of abstract domains. Fil´e and Ranzato advanced the state ...
Enea Zaffanella, Patricia M. Hill, Roberto Bagnara
ISORC
1998
IEEE
15 years 6 months ago
Specification of Real-Time Interaction Constraints
We present a coordination language and its semantics for specification and implementation of object-oriented realtime systems. Real-time systems operate under real-time constraint...
Brian Nielsen, Shangping Ren, Gul Agha
CAV
1998
Springer
103views Hardware» more  CAV 1998»
15 years 6 months ago
You Assume, We Guarantee: Methodology and Case Studies
Assume-guarantee reasoning has long been advertised as an important method for decomposing proof obligations in system veri cation. Re nement mappings (homomorphisms) have long bee...
Thomas A. Henzinger, Shaz Qadeer, Sriram K. Rajama...
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 6 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
109
Voted
GD
1998
Springer
15 years 6 months ago
Using Graph Layout to Visualize Train Interconnection Data
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
Ulrik Brandes, Dorothea Wagner
« Prev « First page 1103 / 1263 Last » Next »