Sciweavers

198 search results - page 23 / 40
» Lightweight reasoning about program correctness
Sort
View
BIRTHDAY
2009
Springer
14 years 18 days ago
Modular Verification of Strongly Invasive Aspects
An extended specification for aspects, and a new verification method based on model checking are used to establish the correctness of strongly-invasive aspects, independently of a...
Emilia Katz, Shmuel Katz
POPL
2010
ACM
13 years 8 months ago
Nested interpolants
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
Matthias Heizmann, Jochen Hoenicke, Andreas Podels...
CAV
2009
Springer
150views Hardware» more  CAV 2009»
14 years 9 months ago
Automated Analysis of Java Methods for Confidentiality
We address the problem of analyzing programs such as J2ME midlets for mobile devices, where a central correctness requirement concerns confidentiality of data that the user wants t...
Pavol Cerný, Rajeev Alur
MSCS
2006
106views more  MSCS 2006»
13 years 8 months ago
LQP: the dynamic logic of quantum information
We present a dynamic logic for reasoning about information flow in quantum programs. In particular, we give a finitary syntax and a relational semantics for a Logic of Quantum Pro...
Alexandru Baltag, Sonja Smets
DFG
2004
Springer
14 years 2 months ago
A Unifying Semantics for Sequential Function Charts
Programmable Logic Controllers (PLC) are widely used as device controllers for assembly lines, chemical processes, or power plants. Sequential Function Charts (SFC) form one of the...
Nanette Bauer, Ralf Huuck, Ben Lukoschus, Sebastia...