Sciweavers

1559 search results - page 204 / 312
» Some Group Theory Problems
Sort
View
FSTTCS
2006
Springer
15 years 1 months ago
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
Gary Wassermann, Zhendong Su
CCS
2008
ACM
14 years 12 months ago
On the protocol composition logic PCL
A recent development in formal security protocol analysis is the Protocol Composition Logic (PCL). We identify a number of problems with this logic as well as with extensions of t...
Cas J. F. Cremers
DM
2008
77views more  DM 2008»
14 years 8 months ago
Perfect Skolem sets
A Skolem sequence is a sequence s1, s2, . . . , s2n (where si A = {1 . . . n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apar...
Gustav Nordh
SYNTHESE
2010
102views more  SYNTHESE 2010»
14 years 8 months ago
Coherent choice functions under uncertainty
We discuss several features of coherent choice functions – where the admissible options in a decision problem are exactly those which maximize expected utility for some probabil...
Teddy Seidenfeld, Mark J. Schervish, Joseph B. Kad...
ICDT
2011
ACM
270views Database» more  ICDT 2011»
14 years 1 months ago
On the equivalence of distributed systems with queries and communication
Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluate some query. We study...
Serge Abiteboul, Balder ten Cate, Yannis Katsis