Sciweavers

581 search results - page 35 / 117
» On the Verifiability of Programs Written in the Feature Lang...
Sort
View
POPL
2007
ACM
14 years 8 months ago
Types, bytes, and separation logic
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
Harvey Tuch, Gerwin Klein, Michael Norrish
HASKELL
2006
ACM
14 years 1 months ago
Strongly typed memory areas programming systems-level data structures in a functional language
Modern functional languages offer several attractive features to support development of reliable and secure software. However, in our efforts to use Haskell for systems programmin...
Iavor S. Diatchki, Mark P. Jones
ASIAN
2009
Springer
363views Algorithms» more  ASIAN 2009»
13 years 8 months ago
A Logic for Formal Verification of Quantum Programs
Abstract. This paper provides a Hoare-style logic for quantum computation. While the usual Hoare logic helps us to verify classical deterministic programs, our logic supports quant...
Yoshihiko Kakutani
CAV
2009
Springer
209views Hardware» more  CAV 2009»
14 years 8 months ago
Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamari...
DLS
2005
101views Languages» more  DLS 2005»
13 years 9 months ago
Flexible object encapsulation for ambient-oriented programming
In the emerging field of Ambient Intelligence (AmI), software is deployed in wireless open networks of mobile devices. Such open networks require stringent security measures as u...
Wolfgang De Meuter, Éric Tanter, Stijn Most...