Sciweavers

2713 search results - page 78 / 543
» Parameterized Tree Systems
Sort
View
113
Voted
FMSD
2000
86views more  FMSD 2000»
15 years 18 days ago
Verifying Temporal Properties of Reactive Systems: A STeP Tutorial
We review a number of formal verification techniques supported by STeP, the Stanford Temporal Prover, describing how the tool can be used to verify properties of several versions o...
Nikolaj Bjørner, Anca Browne, Michael Col&o...
SAS
2009
Springer
175views Formal Methods» more  SAS 2009»
16 years 1 months ago
Automatic Parallelization and Optimization of Programs by Proof Rewriting
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
Clément Hurlin
96
Voted
VL
1993
IEEE
147views Visual Languages» more  VL 1993»
15 years 4 months ago
Fractal Approaches for Visualizing Huge Hierarchies
This paper describes fractal approaches to the problems which associate with visualizing huge hierarchies. The geometrical characteristic of a fractal, selfsimilarity, allows user...
Hideki Koike, Hirotaka Yoshihara
103
Voted
COMCOM
2006
120views more  COMCOM 2006»
15 years 25 days ago
Explicit routing in multicast overlay networks
Application Level Multicast is a promising approach to overcome the deployment problems of IP level multicast by establishing delivery trees using overlay links among end systems....
Torsten Braun, Vijay Arya, Thierry Turletti
88
Voted
SIGOPSE
2004
ACM
15 years 6 months ago
An approach to benchmarking configuration complexity
Configuration is the process whereby components are assembled or adjusted to produce a functional system that operates at a specified level of performance. Today, the complexity o...
Aaron B. Brown, Joseph L. Hellerstein