Sciweavers

1536 search results - page 270 / 308
» The Underlying Logic of Hoare Logic
Sort
View
IFIP
2009
Springer
15 years 3 months ago
Finite Models in FOL-Based Crypto-Protocol Verification
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
Jan Jürjens, Tjark Weber
CACM
2010
97views more  CACM 2010»
15 years 3 months ago
Certified software
Certified software consists of a machine-executable program plus a formal machine-checkable proof that the software is free of bugs with respect to a claim of dependability. The c...
Zhong Shao
ENTCS
2010
103views more  ENTCS 2010»
15 years 3 months ago
Model Testing Asynchronously Communicating Objects using Modulo AC Rewriting
Testing and verification of asynchronously communicating objects in open environments are challenging due to non-determinism. We explore a formal approach for black-box testing by...
Olaf Owe, Martin Steffen, Arild B. Torjusen
TVCG
2011
100views more  TVCG 2011»
15 years 1 months ago
Tugging Graphs Faster: Efficiently Modifying Path-Preserving Hierarchies for Browsing Paths
—Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place t...
Daniel Archambault, Tamara Munzner, David Auber
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
15 years 25 days ago
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eri...