Sciweavers

1620 search results - page 98 / 324
» eg 2010
Sort
View
ENTCS
2006
125views more  ENTCS 2006»
15 years 4 months ago
An Even Closer Integration of Linear Arithmetic into Inductive Theorem Proving
To broaden the scope of decision procedures for linear arithmetic, they have to be integrated into theorem provers. Successful approaches e.g. in NQTHM or ACL2 suggest a close int...
Tobias Schmidt-Samoa
ENTCS
2006
168views more  ENTCS 2006»
15 years 4 months ago
Case Study: Model Transformations for Time-triggered Languages
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...
Tivadar Szemethy
ENTCS
2006
173views more  ENTCS 2006»
15 years 4 months ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal
DSS
2007
111views more  DSS 2007»
15 years 4 months ago
Applying question answering technology to locating malevolent online content
We have empirically compared two classes of technologies capable of locating potentially malevolent online content: 1) popular keyword searching, currently widely used by law enfo...
Dmitri Roussinov, Jose Antonio Robles-Flores
ECCC
2007
144views more  ECCC 2007»
15 years 4 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III