Sciweavers

1914 search results - page 342 / 383
» Verification by Abstract Interpretation
Sort
View
SOFTVIS
2010
ACM
13 years 10 months ago
Towards anomaly comprehension: using structural compression to navigate profiling call-trees
Developers must often diagnose anomalies in programs they only have a partial knowledge of. As a result, they must simultaneously reverse engineer parts of the system they are unf...
Shen Lin 0003, François Taïani, Thomas...
AUTOMATICA
2007
179views more  AUTOMATICA 2007»
13 years 10 months ago
Approximate bisimulation relations for constrained linear systems
In this paper, we define the notion of approximate bisimulation relation between two continuous systems. While exact bisimulation requires that the observations of two systems ar...
Antoine Girard, George J. Pappas
CORR
2010
Springer
100views Education» more  CORR 2010»
13 years 10 months ago
Products of Weighted Logic Programs
Abstract. Weighted logic programming, a generalization of bottom-up logic programming, is a successful framework for specifying dynamic programming algorithms. In this setting, pro...
Shay B. Cohen, Robert J. Simmons, Noah A. Smith
JCT
2006
88views more  JCT 2006»
13 years 10 months ago
Multiplicative structures in additively large sets
Abstract. Previous research extending over a few decades has established that multiplicatively large sets (in any of several interpretations) must have substantial additive structu...
Mathias Beiglböck, Vitaly Bergelson, Neil Hin...
KI
2008
Springer
13 years 10 months ago
A Framework for Mobile Intention Recognition in Spatially Structured Environments
Abstract. Mobile intention recognition is the problem of inferring an agent's intentions from the spatio-temporal behavior she shows. We present a framework for mobile intenti...
Peter Kiefer, Klaus Stein