Sciweavers

8644 search results - page 1726 / 1729
» On the Composition of Secure Systems
Sort
View
VSTTE
2010
Springer
13 years 5 months ago
Towards Scalable Modular Checking of User-Defined Properties
Abstract. Theorem-prover based modular checkers have the potential to perform scalable and precise checking of user-defined properties by combining pathsensitive intraprocedural re...
Thomas Ball, Brian Hackett, Shuvendu K. Lahiri, Sh...
HIPC
2009
Springer
13 years 5 months ago
Highly scalable algorithm for distributed real-time text indexing
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...
Ankur Narang, Vikas Agarwal, Monu Kedia, Vijay K. ...
CORR
2010
Springer
155views Education» more  CORR 2010»
13 years 5 months ago
A Proof Theoretic Analysis of Intruder Theories
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...
Alwen Tiu, Rajeev Goré, Jeremy E. Dawson
IANDC
2011
129views more  IANDC 2011»
13 years 2 months ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 2 months ago
Data Cleaning and Query Answering with Matching Dependencies and Matching Functions
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
Leopoldo E. Bertossi, Solmaz Kolahi, Laks V. S. La...
« Prev « First page 1726 / 1729 Last » Next »