Sciweavers

72 search results - page 11 / 15
» A Beginner's Course on Reasoning About Imperative Programs
Sort
View
VSTTE
2012
Springer
13 years 5 months ago
Deciding Functional Lists with Sublist Sets
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
Thomas Wies, Marco Muñiz, Viktor Kuncak
97
Voted
TCS
2008
14 years 9 months ago
Cryptographically-masked flows
Abstract. Cryptographic operations are essential for many security-critical systems. Reasoning about information flow in such systems is challenging because typical (noninterferenc...
Aslan Askarov, Daniel Hedin, Andrei Sabelfeld
JFP
2007
126views more  JFP 2007»
14 years 9 months ago
Engineering Software Correctness
Software engineering courses offer one of many opportunities for providing students with a significant experience in declarative programming. This report discusses some results fr...
Rex L. Page
CORR
2002
Springer
131views Education» more  CORR 2002»
14 years 9 months ago
Ownership Confinement Ensures Representation Independence for Object-Oriented Programs
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...
Anindya Banerjee, David A. Naumann
ACSC
2004
IEEE
15 years 1 months ago
Automatic Derivation of Loop Termination Conditions to Support Verification
This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for ...
Daniel Powell