Sciweavers

394 search results - page 65 / 79
» An Abstract Domain of Uninterpreted Functions
Sort
View
CP
2001
Springer
14 years 4 days ago
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
Rina Dechter, Kalev Kask, Javier Larrosa
INAP
2001
Springer
14 years 2 days ago
Towards Reconciling Use Cases via Controlled Language and Graphical Models
Abstract. In requirements engineering use cases are employed to describe the ow of events and the occurrence of states in a future information system. Use cases consist of a set of...
Kathrin Böttger, Rolf Schwitter, Diego Moll&a...
VLDB
1999
ACM
131views Database» more  VLDB 1999»
13 years 12 months ago
High-Performance Extensible Indexing
Today’s object-relational DBMSs (ORDBMSs) are designed to support novel application domains by providing an extensible architecture, supplemented by domain-specific database ex...
Marcel Kornacker
SP
2010
IEEE
140views Security Privacy» more  SP 2010»
13 years 11 months ago
Inspector Gadget: Automated Extraction of Proprietary Gadgets from Malware Binaries
Abstract—Unfortunately, malicious software is still an unsolved problem and a major threat on the Internet. An important component in the fight against malicious software is the...
Clemens Kolbitsch, Thorsten Holz, Christopher Krue...
FM
2006
Springer
126views Formal Methods» more  FM 2006»
13 years 11 months ago
Towards Modularized Verification of Distributed Time-Triggered Systems
Abstract. The correctness of a system according to a given specification is essential, especially for safety-critical applications. One such typical application domain is the autom...
Jewgenij Botaschanjan, Alexander Gruler, Alexander...