Sciweavers

31 search results - page 4 / 7
» Abstract interpretation for constraint handling rules
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
A hierarchical and contextual model for aerial image understanding
In this paper we present a novel method for parsing aerial images with a hierarchical and contextual model learned in a statistical framework. We learn hierarchies at the scene an...
Jake Porway, Kristy Wang, Benjamin Yao, Song Chun ...
GLOBECOM
2007
IEEE
14 years 1 months ago
Utilizing Semantic Tags for Policy Based Networking
Abstract— Policy based networks provide high levels of flexibility by allowing definition of packet handling rules within a network, resource allocation strategies, network man...
Sethuram Balaji Kodeswaran, Olga Ratsimor, Anupam ...
CSCLP
2006
Springer
13 years 11 months ago
Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
Marc Meister, Khalil Djelloul, Thom W. Frühwi...
TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
12 years 3 months ago
Compositional Termination Proofs for Multi-threaded Programs
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
Corneliu Popeea, Andrey Rybalchenko
WCET
2003
13 years 8 months ago
Fully Automatic, Parametric Worst-Case Execution Time Analysis
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...
Björn Lisper