Sciweavers

2137 search results - page 52 / 428
» Proving Abstract Non-interference
Sort
View
119
Voted
CSR
2006
Springer
15 years 6 months ago
Expressiveness of Metric Modalities for Continuous Time
Abstract. We prove a conjecture by A. Pnueli and strengthen it showing a sequence of "counting modalities" none of which is expressible in the temporal logic generated by...
Yoram Hirshfeld, Alexander Moshe Rabinovich
143
Voted
ASM
2010
ASM
15 years 5 months ago
Automatic Verification for a Class of Proof Obligations with SMT-Solvers
Abstract. Software development in B and Event-B generates proof obligations that have to be discharged using theorem provers. The cost of such developments therefore depends direct...
David Déharbe
106
Voted
WOTUG
2008
15 years 4 months ago
Mechanical Verification of a Two-Way Sliding Window Protocol
Abstract. We prove the correctness of a two-way sliding window protocol with piggybacking, where the acknowledgments of the latest received data are attached to the next data trans...
Bahareh Badban, Wan Fokkink, Jaco van de Pol
104
Voted
AML
2010
91views more  AML 2010»
15 years 2 months ago
The limitations of cupping in the local structure of the enumeration degrees
Abstract We prove that a sequence of sets containing representatives of cupping partners for every nonzero 0 2 enumeration degree cannot have a 0 2 enumeration. We also prove that ...
Mariya Ivanova Soskova
106
Voted
CORR
2007
Springer
82views Education» more  CORR 2007»
15 years 2 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud