Sciweavers

20175 search results - page 3951 / 4035
» Is abstraction the key to computing
Sort
View
ICFEM
2009
Springer
14 years 4 months ago
Approximate Model Checking of PCTL Involving Unbounded Path Properties
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
Samik Basu, Arka P. Ghosh, Ru He
ICMT
2009
Springer
14 years 4 months ago
A Simple Game-Theoretic Approach to Checkonly QVT Relations
Abstract. The QVT Relations (QVT-R) transformation language allows the definition of bidirectional model transformations, which are required in cases where a two (or more) models ...
Perdita Stevens
UM
2009
Springer
14 years 4 months ago
Performance Evaluation of a Privacy-Enhancing Framework for Personalized Websites
Abstract. Reconciling personalization with privacy has been a continuing interest in the user modeling community. In prior work, we proposed a dynamic privacy-enhancing user modeli...
Yang Wang 0005, Alfred Kobsa
ISSTA
2009
ACM
14 years 4 months ago
Exception analysis and points-to analysis: better together
Exception analysis and points-to analysis are typically done in complete separation. Past algorithms for precise exception analysis (e.g., pairing throw clauses with catch stateme...
Martin Bravenboer, Yannis Smaragdakis
SMA
2009
ACM
117views Solid Modeling» more  SMA 2009»
14 years 4 months ago
Discrete physics using metrized chains
Over the last fifty years, there have been numerous efforts to develop from first principles a comprehensive discrete formulation of geometric physics, including Whitney’s ge...
Antonio DiCarlo, Franco Milicchio, Alberto Paoluzz...
« Prev « First page 3951 / 4035 Last » Next »