Sciweavers

329 search results - page 36 / 66
» Automatic Proofs for Scalecharts
Sort
View
CSFW
2008
IEEE
13 years 10 months ago
Automated Verification of Remote Electronic Voting Protocols in the Applied Pi-Calculus
We present a general technique for modeling remote electronic voting protocols in the applied pi-calculus and for automatically verifying their security. In the first part of this...
Michael Backes, Catalin Hritcu, Matteo Maffei
CADE
2010
Springer
13 years 9 months ago
Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
Markus Aderhold
ENTCS
2008
94views more  ENTCS 2008»
13 years 8 months ago
A Formal Model of Memory Peculiarities for the Verification of Low-Level Operating-System Code
This paper presents our solutions to some problems we encountered in an ongoing attempt to verify the micro-hypervisor currently developed within the Robin project. The problems t...
Hendrik Tews, Tjark Weber, Marcus Völp
CORR
2002
Springer
95views Education» more  CORR 2002»
13 years 8 months ago
Qualitative Visualization of Distance Information
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
Jobst Heitzig
ENTCS
2007
123views more  ENTCS 2007»
13 years 8 months ago
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
Beatriz Alarcón, Raúl Gutiérr...