The design and implementation of a certifying compiler
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Sequential abstract-state machines capture sequential algorithms
ACM Transactions on Computational Logic (TOCL)
A semantic approach to secure information flow
Science of Computer Programming - Special issue on mathematics of program construction
Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Ownership types for safe region-based memory management in real-time Java
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Abstract State Machines: A Method for High-Level System Design and Analysis
Abstract State Machines: A Method for High-Level System Design and Analysis
Compiling with proofs
Formal specification and verification of the C# thread model
Theoretical Computer Science - Formal methods for components and objects
Towards a logic for abstract metafinite state machines
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
| Hi-index | 0.00 |
We extend the logic for abstract state machines by a read predicate that allows to make precise statements about the accesses of locations of an ASM. The logic can be used to prove security properties of ASMs like that the machine does not read locations containing critical information or that all accesses of the machine to the abstract memory are permitted. The new read predicate is also useful for proving refinements of parallel ASMs to sequential C-like programs. The logic is complete for hierarchical ASMs and still sound for turbo ASMs. It is integrated in the ASMKeY theorem prover.