Sciweavers

1163 search results - page 107 / 233
» Concurrent Subspaces Analysis
Sort
View
103
Voted
TACAS
2005
Springer
78views Algorithms» more  TACAS 2005»
15 years 9 months ago
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
Amir Pnueli, Andreas Podelski, Andrey Rybalchenko
139
Voted
VISSYM
2007
15 years 6 months ago
Integrating Local Feature Detectors in the Interactive Visual Analysis of Flow Simulation Data
We present smooth formulations of common vortex detectors that allow a seamless integration into the concept of interactive visual analysis of flow simulation data. We express the...
Raphael Buerger, Philipp Muigg, Martin Ilcí...
117
Voted
FMOODS
2007
15 years 5 months ago
On Formal Analysis of OO Languages Using Rewriting Logic: Designing for Performance
Rewriting logic provides a powerful, flexible mechanism for language definition and analysis. This flexibility in design can lead to problems during analysis, as different desi...
Mark Hills, Grigore Rosu
139
Voted
CMMR
2005
Springer
138views Music» more  CMMR 2005»
15 years 5 months ago
Music Analysis and Modeling Through Petri Nets
Petri Nets are a formal tool for studying systems that are concurrent, asynchronous, distributed, parallel, nondeterministic, and/or stochastic. They were used in a number of real-...
Adriano Baratè, Goffredo Haus, Luca A. Ludo...
115
Voted
VMCAI
2009
Springer
15 years 10 months ago
Towards Automatic Stability Analysis for Rely-Guarantee Proofs
The Rely-Guarantee approach is a well-known compositional method for proving Hoare logic properties of concurrent programs. In this approach, predicates in the proof must be proved...
Hasan Amjad, Richard Bornat