Sciweavers

394 search results - page 36 / 79
» Formal polytypic programs and proofs
Sort
View
TLDI
2009
ACM
111views Formal Methods» more  TLDI 2009»
14 years 4 months ago
A generic type-and-effect system
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
Daniel Marino, Todd D. Millstein
ICFP
2002
ACM
14 years 8 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy
ICFP
2005
ACM
14 years 8 months ago
Combining programming with theorem proving
Applied Type System (ATS) is recently proposed as a framework for designing and formalizing (advanced) type systems in support of practical programming. In ATS, the definition of ...
Chiyan Chen, Hongwei Xi
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
ZUM
1997
Springer
125views Formal Methods» more  ZUM 1997»
14 years 4 days ago
A Formal OO Method Inspired by Fusion and Object-Z
We present a new formal OO method, called FOX, which is a synergetic combination of the semi-formal Fusion method and the formal specification language Object-Z. To manage complex...
Klaus Achatz, Wolfram Schulte