Sciweavers

1226 search results - page 98 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
15 years 8 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
107
Voted
DCOSS
2010
Springer
15 years 8 months ago
Tables: A Spreadsheet-Inspired Programming Model for Sensor Networks
Abstract. Current programming interfaces for sensor networks often target experienced developers and lack important features. Tables is a spreadsheet inspired programming environme...
James Horey, Eric Nelson, Arthur B. Maccabe
FORTE
2008
15 years 4 months ago
An SMT Approach to Bounded Reachability Analysis of Model Programs
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
Margus Veanes, Nikolaj Bjørner, Alexander R...
IJMMS
2008
90views more  IJMMS 2008»
15 years 3 months ago
Pair programming and the mysterious role of the navigator
Computer programming is generally understood to be highly challenging and since its inception a wide range of approaches, tools and methodologies have been developed to assist in ...
Sallyann Bryant, Pablo Romero, Benedict du Boulay
JSW
2006
98views more  JSW 2006»
15 years 3 months ago
A Jxta Based Asynchronous Peer-to-Peer Implementation of Genetic Programming
Abstract-- Solving complex real-world problems using evolutionary computation is a CPU time-consuming task that requires a large amount of computational resources. Peerto-Peer (P2P...
Gianluigi Folino, Agostino Forestiero, Giandomenic...