Sciweavers

641 search results - page 42 / 129
» Formal Reliability Analysis Using Theorem Proving
Sort
View
CHARME
2003
Springer
129views Hardware» more  CHARME 2003»
15 years 7 months ago
On the Correctness of an Intrusion-Tolerant Group Communication Protocol
Intrusion-tolerance is the technique of using fault-tolerance to achieve security properties. Assuming that faults, both benign and Byzantine, are unavoidable, the main goal of Int...
Mohamed Layouni, Jozef Hooman, Sofiène Taha...
CAV
2006
Springer
146views Hardware» more  CAV 2006»
15 years 6 months ago
Termination Analysis with Calling Context Graphs
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
Panagiotis Manolios, Daron Vroon
ICFP
2000
ACM
15 years 6 months ago
Syntactic accidents in program analysis: on the impact of the CPS transformation
We show that a non-duplicating transformation into Continuation-Passing Style (CPS) has no effect on control-flow analysis, a positive effect on binding-time analysis for tradi...
Daniel Damian, Olivier Danvy
SIGSOFT
2003
ACM
16 years 3 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
15 years 11 months ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...