Sciweavers

212 search results - page 36 / 43
» Completeness and Complexity of Bounded Model Checking
Sort
View
PLDI
2009
ACM
14 years 2 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
CISIS
2010
IEEE
14 years 2 months ago
Integrating Production Automation Expert Knowledge Across Engineering Stakeholder Domains
— The engineering of complex production automation systems involves experts from several backgrounds, such as mechanical, electrical, and software engineering. The production aut...
Thomas Moser, Stefan Biffl, Wikan Danar Sunindyo, ...
IJDST
2011
117views more  IJDST 2011»
12 years 10 months ago
Integrating Production Automation Expert Knowledge Across Engineering Domains
The engineering of complex production automation systems involves experts from several backgrounds, such as mechanical, electrical, and software engineering. The production automa...
Thomas Moser, Stefan Biffl, Wikan Danar Sunindyo, ...
DAGSTUHL
2006
13 years 8 months ago
Efficient multi-step query processing for EMD-based similarity
Abstract. Similarity search in large multimedia databases requires efficient query processing based on suitable similarity models. Similarity models consist of a feature extraction...
Ira Assent, Thomas Seidl
LICS
1998
IEEE
13 years 11 months ago
Existential Second-Order Logic over Strings
d abstract) T. Eiter G. Gottlob Y. Gurevich Institut fur Informatik Institut fur Informationssysteme EECS Department Universitat Gie en Technische Universitat Wien University of Mi...
Thomas Eiter, Georg Gottlob, Yuri Gurevich