Sciweavers

254 search results - page 36 / 51
» An abstract framework for reasoning about trust
Sort
View
IFM
2010
Springer
133views Formal Methods» more  IFM 2010»
13 years 5 months ago
Towards Probabilistic Modelling in Event-B
Abstract. Event-B provides us with a powerful framework for correctby-construction system development. However, while developing dependable systems we should not only guarantee the...
Anton Tarasyuk, Elena Troubitsyna, Linas Laibinis
CADE
1998
Springer
13 years 11 months ago
System Description: card TAP: The First Theorem Prover on a Smart Card
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
Rajeev Goré, Joachim Posegga, Andrew Slater...
POPL
2007
ACM
14 years 7 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
CAV
2010
Springer
192views Hardware» more  CAV 2010»
13 years 11 months ago
Invariant Synthesis for Programs Manipulating Lists with Unbounded Data
We address the issue of automatic invariant synthesis for sequential programs manipulating singly-linked lists carrying data over infinite data doe define for that a framework ba...
Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, A...
CAV
2004
Springer
130views Hardware» more  CAV 2004»
13 years 11 months ago
Global Model-Checking of Infinite-State Systems
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
Nir Piterman, Moshe Y. Vardi