Sciweavers

407 search results - page 47 / 82
» Malleable Proof Systems and Applications
Sort
View
TASE
2008
IEEE
14 years 2 months ago
Verifying BPEL-Like Programs with Hoare Logic
The WS-BPEL language has recently become a de facto standard for modeling Web-based business processes. One of its essential features is the fully programmable compensation mechan...
Chenguang Luo, Shengchao Qin, Zongyan Qiu
FROCOS
2007
Springer
14 years 1 months ago
Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...
Viorica Sofronie-Stokkermans
PADL
2004
Springer
14 years 29 days ago
Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
Chiyan Chen, Dengping Zhu, Hongwei Xi
CCS
2003
ACM
14 years 25 days ago
Secure protocol composition
This paper continues the program initiated in [5], towards a derivation system for security protocols. The general idea is that complex protocols can be formally derived, starting...
Anupam Datta, Ante Derek, John C. Mitchell, Dusko ...
ECBS
2000
IEEE
97views Hardware» more  ECBS 2000»
14 years 20 hour ago
Ensuring Structure and Behavior Correctness in Design Composition
The design of a large component-based software system typically involves the composition of different components. Instead of relying on a free composition of components, we advoca...
Jing Dong, Paulo S. C. Alencar, Donald D. Cowan