IACR
2011
12 years 10 months ago
2011
The contribution of this paper is twofold. First we present a new simple electronic voting scheme having standard re-encryption mix net back-end, which allows to cast a ballot and ...
TSE
2011
13 years 5 months ago
2011
— We present an integrated method for program proving, testing, and debugging. Using the concept of metamorphic relations, we select necessary properties for target programs. For...
TCS
2011
13 years 5 months ago
2011
We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a...
IPPS
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...
VLDB
2010
ACM
13 years 9 months ago
2010
ACM
According to the database outsourcing model, a data owner delegates database functionality to a thirdparty service provider, which answers queries received from clients. Authentic...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The F5 algorithm is presented by Faug`ere in 2002. However, Faug`ere have not provide the rigorous proofs so far. In this paper, we will give a new complete proof and hence reveal ...
ENTCS
2008
13 years 11 months ago
2008
We report in this paper on the formal verification of a simple compiler for the C-like programming language C0. The compiler correctness proof meets the special requirements of pe...
DSD
2007
IEEE
13 years 11 months ago
2007
IEEE
The universal underlying assumption made today is that Systems on chip must maintain 100% correctness regardless of the application. This work advocates the concept that some appl...
ICECCS
2010
IEEE
13 years 11 months ago
2010
IEEE
Abstract—Transactional Memory (TM) is a promising technique that addresses the difficulty of parallel programming. Since TM takes responsibility for all concurrency control, TM ...