Sciweavers

88 search results - page 15 / 18
» Event Structure Semantics for Dynamic Graph Grammars
Sort
View
COMPGEOM
2010
ACM
13 years 11 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
FASE
1998
Springer
13 years 11 months ago
Specifying and Analyzing Dynamic Software Architectures
A critical issue for complex component-based systems design is the modeling and analysis of architecture. One of the complicating factors in developing architectural models is acc...
Robert Allen, Rémi Douence, David Garlan
ASWEC
2005
IEEE
14 years 10 days ago
A Formal Method for Program Slicing
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
Yingzhou Zhang, Baowen Xu, José Emilio Labr...
FM
2006
Springer
146views Formal Methods» more  FM 2006»
13 years 10 months ago
Formal Modeling of Communication Protocols by Graph Transformation
Formal modeling is a crucial first step in the analysis of safety critical communication protocols such as IP Telephony. These protocols are notoriously resistant to formal modelin...
Zarrin Langari, Richard J. Trefler
ICSE
2001
IEEE-ACM
13 years 11 months ago
Encoding Program Executions
Dynamic analysis is based on collecting data as the program runs. However, raw traces tend to be too voluminous and too unstructured to be used directly for visualization and unde...
Steven P. Reiss, Manos Renieris