Reasoning About Vote Counting Schemes Using Light-weight and Heavy-weight Methods
暂无分享,去创建一个
Bernhard Beckert | Thorsten Bormer | Rajeev Goré | Michael Kirsten | Tom Meumann | R. Goré | Bernhard Beckert | Thorsten Bormer | Michael Kirsten | Thomas Meumann
[1] Shin Nakajima,et al. Modular Checking of C Programs Using SAT-Based Bounded Model Checker , 2009, 2009 16th Asia-Pacific Software Engineering Conference.
[2] Nikolaj Bjørner,et al. Z3: An Efficient SMT Solver , 2008, TACAS.
[3] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[4] David L. Dill,et al. A Decision Procedure for Bit-Vectors and Arrays , 2007, CAV.
[5] K. Arrow. A Difficulty in the Concept of Social Welfare , 1950, Journal of Political Economy.
[6] Orna Grumberg,et al. Model checking and modular verification , 1994, TOPL.
[7] Piotr Faliszewski,et al. On the role of distances in defining voting rules , 2010, AAMAS.
[8] Carsten Sinz,et al. The bounded model checker LLBMC , 2013, 2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE).
[9] Alessandro Armando,et al. Bounded Model Checking of Software Using SMT Solvers Instead of SAT Solvers , 2006, SPIN.
[10] Bernhard Beckert,et al. Improving the Usability of Specification Languages and Methods for Annotation-Based Verification , 2010, FMCO.
[11] Ramana Kumar,et al. CakeML: a verified implementation of ML , 2014, POPL.
[12] Bor-Yuh Evan Chang,et al. Boogie: A Modular Reusable Verifier for Object-Oriented Programs , 2005, FMCO.
[13] Daniel Jackson,et al. Software Abstractions - Logic, Language, and Analysis , 2006 .
[14] Daniel Jackson,et al. Bounded Verification of Voting Software , 2008, VSTTE.
[15] Mark A. Hillebrand,et al. VCC: A Practical System for Verifying Concurrent C , 2009, TPHOLs.
[16] Bernhard Beckert,et al. Analysing Vote Counting Algorithms via Logic - And Its Application to the CADE Election Scheme , 2013, CADE.
[17] Bernhard Beckert,et al. Integration of Bounded Model Checking and Deductive Verification , 2011, FoVeOOS.