Sciweavers

309 search results - page 16 / 62
» Termination proofs for systems code
Sort
View
FC
2008
Springer
133views Cryptology» more  FC 2008»
13 years 9 months ago
A Proof of Concept Attack against Norwegian Internet Banking Systems
Abstract. The banking industry in Norway has developed a new security infrastructure for conducting commerce on the Internet. The initiative, called BankID, aims to become a nation...
Yngve Espelid, Lars-Helge Netland, André N....
USS
2008
13 years 10 months ago
Pre-Election Testing and Post-Election Audit of Optical Scan Voting Terminal Memory Cards
Optical scan electronic voting machines employ software components that are customized for each specific election. Such software components are critical from a security and integr...
Seda Davtyan, Sotiris Kentros, Aggelos Kiayias, La...
PPDP
2007
Springer
14 years 1 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana
CSL
2007
Springer
14 years 1 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
Arnold Beckmann
FSTTCS
2004
Springer
14 years 1 months ago
A Decidable Fragment of Separation Logic
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn