Sciweavers

5255 search results - page 657 / 1051
» Formal Methods for Privacy
Sort
View
MEMOCODE
2007
IEEE
16 years 1 months ago
VT Matrix Multiply Design for MEMOCODE '07
This design presents a system optimized for complex matrix multiplications on the XUP Virtex-II board. Utilizing the GEZEL HW/SW co-simulation environment, the resulting system ac...
Eric Simpson, Pengyuan Yu, Patrick Schaumont, Sumi...
ATAL
2007
Springer
16 years 1 months ago
A framework for reasoning about rational agents
We propose an extension of alternating-time temporal logic, that can be used for reasoning about the behavior and abilities of agents under various rationality assumptions. Catego...
Wojciech Jamroga, Nils Bulling
CAV
2007
Springer
120views Hardware» more  CAV 2007»
16 years 1 months ago
Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
Chao Wang, Zijiang Yang, Aarti Gupta, Franjo Ivanc...
CAV
2007
Springer
118views Hardware» more  CAV 2007»
16 years 1 months ago
C32SAT: Checking C Expressions
C32SAT is a tool for checking C expressions. It can check whether a given C expression can be satisfied, is tautological, or always defined according to the ISO C99 standard. C32...
Robert Brummayer, Armin Biere
CISC
2007
Springer
133views Cryptology» more  CISC 2007»
16 years 1 months ago
Unlinkable Randomizable Signature and Its Application in Group Signature
We formalize a generic method of constructing efficient group signatures, specifically, we define new notions of unlinkable randomizable signature, indirectly signable signature ...
Sujing Zhou, Dongdai Lin