Sciweavers

1883 search results - page 181 / 377
» Ordered theta graphs
Sort
View
LPAR
2005
Springer
14 years 1 months ago
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
Chao Wang, Franjo Ivancic, Malay K. Ganai, Aarti G...
VL
2003
IEEE
146views Visual Languages» more  VL 2003»
14 years 1 months ago
A reading algorithm for constraint diagrams
Constraint diagrams are a visual notation designed to complement the Unified Modeling Language in the development of software systems. They generalize Venn diagrams and Euler cir...
Andrew Fish, Jean Flower, John Howse
RTA
2011
Springer
12 years 11 months ago
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
Marc Brockschmidt, Carsten Otto, Jürgen Giesl
ICDE
2009
IEEE
144views Database» more  ICDE 2009»
14 years 9 months ago
Reachability Indexes for Relational Keyword Search
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Sp...
Alexander Markowetz, Yin Yang, Dimitris Papadias
ICPR
2006
IEEE
14 years 9 months ago
Object Localization Using Input/Output Recursive Neural Networks
Localizing objects in images is a difficult task and represents the first step to the solution of the object recognition problem. This paper presents a novel approach to the local...
Lorenzo Sarti, Marco Maggini, Monica Bianchini