1901 search results - page 39 / 381 » Predicting Program Properties from |
CHARME
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. Unbounded model checking of invariant properties is typically solved using symbolic reachability. However, BDD based reachability methods suffer from lack of robustness ...
98
Voted
IJCAI
2003
15 years 9 days ago
2003
In this paper, we propose a novel method to infer the web user’s Information Content (IC), which is the information that the user must examine to complete her task. In particula...
87
Voted
CAISE
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. This paper presents a method to compute metrics that predict maintainability of a system with respect to its event processing. The metrics reflect the complexity of event...
GECCO
2003
Springer
15 years 4 months ago
2003
Springer
This paper presents a hypothesis about an undiscovered class of mechanisms that exist in standard GP. Rather than being intentionally designed, these mechanisms would be an uninten...
63
Voted
FORMATS
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. In this paper we propose a novel technique for constructing timed automata from properties expressed in the logic MTL, under bounded-variability assumptions. We handle fu...