Sciweavers

502 search results - page 66 / 101
» An empirical study on program comprehension with reactive pr...
Sort
View
ICS
2003
Tsinghua U.
14 years 27 days ago
Selecting long atomic traces for high coverage
This paper performs a comprehensive investigation of dynamic selection for long atomic traces. It introduces a classification of trace selection methods and discusses existing and...
Roni Rosner, Micha Moffie, Yiannakis Sazeides, Ron...
CP
2007
Springer
14 years 1 months ago
Hierarchical Hardness Models for SAT
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
Lin Xu, Holger H. Hoos, Kevin Leyton-Brown
LICS
2005
IEEE
14 years 1 months ago
Model Checking Vs. Generalized Model Checking: Semantic Minimizations for Temporal Logics
Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions g...
Patrice Godefroid, Michael Huth
CONCUR
2004
Springer
14 years 1 months ago
Open Maps, Alternating Simulations and Control Synthesis
Abstract. Control synthesis is slowly transcending its traditional application domain within engineering to find interesting and useful applications in computer science. Synthesis...
Paulo Tabuada
LICS
1997
IEEE
13 years 11 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...