Sciweavers

164 search results - page 15 / 33
» Formal Device and Programming Model for a Serial Interface
Sort
View
PLDI
2006
ACM
14 years 1 months ago
Termination proofs for systems code
Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and conte...
Byron Cook, Andreas Podelski, Andrey Rybalchenko
ASPLOS
2011
ACM
12 years 11 months ago
Mnemosyne: lightweight persistent memory
New storage-class memory (SCM) technologies, such as phasechange memory, STT-RAM, and memristors, promise user-level access to non-volatile storage through regular memory instruct...
Haris Volos, Andres Jaan Tack, Michael M. Swift
FCT
2003
Springer
14 years 19 days ago
Membrane Computing
: In this paper a comparison is provided between the membrane computing systems and the graphical interfaces of operating systems. A membrane computing system is a computing model ...
Gheorghe Paun
TOOLS
2008
IEEE
14 years 1 months ago
Modeling of Component Environment in Presence of Callbacks and Autonomous Activities
Abstract. A popular approach to compositional verification of component-based applications is based on the assume-guarantee paradigm, where an assumption models behavior of an env...
Pavel Parizek, Frantisek Plasil
TACAS
2004
Springer
94views Algorithms» more  TACAS 2004»
14 years 22 days ago
A Tool for Checking ANSI-C Programs
Abstract. We present a tool for the formal verification of ANSI-C programs using Bounded Model Checking (BMC). The emphasis is on usability: the tool supports almost all ANSI-C la...
Edmund M. Clarke, Daniel Kroening, Flavio Lerda