Sciweavers

1463 search results - page 120 / 293
» Model Checking Implicit-Invocation Systems
Sort
View
FM
2005
Springer
112views Formal Methods» more  FM 2005»
15 years 7 months ago
Dynamic Component Substitutability Analysis
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
Natasha Sharygina, Sagar Chaki, Edmund M. Clarke, ...
ISDA
2009
IEEE
15 years 8 months ago
From Local Patterns to Global Models: Towards Domain Driven Educational Process Mining
Educational process mining (EPM) aims at (i) constructing complete and compact educational process models that are able to reproduce all observed behavior (process model discovery...
Nikola Trcka, Mykola Pechenizkiy
160
Voted
RV
2010
Springer
220views Hardware» more  RV 2010»
14 years 11 months ago
Runtime Verification with the RV System
The RV system is the first system to merge the benefits of Runtime Monitoring with Predictive Analysis. The Runtime Monitoring portion of RV is based on the successful Monitoring O...
Patrick O'Neil Meredith, Grigore Rosu
124
Voted
PRDC
2007
IEEE
15 years 8 months ago
An Automatic Real-Time Analysis of the Time to Reach Consensus
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
Tatsuhiro Tsuchiya, André Schiper
LICS
2009
IEEE
15 years 8 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...