77 search results - page 8 / 16 » Building BSP Programs Using the Refinement Calculus |
174
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we show how pattern matching can be seen to arise from a proof term assignment for the focused sequent calculus. This use of the Curry-Howard correspondence allows ...
SIGSOFT
2005
ACM
15 years 10 months ago
2005
ACM
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
IFIPTCS
2010
14 years 7 months ago
2010
Abstract. We propose a framework for reasoning about program security building on language-theoretic and coalgebraic concepts. The behaviour of a system is viewed as a mapping from...
ECOOP
2008
Springer
14 years 11 months ago
2008
Springer
Inheritance is a standard means for reuse and for interfacing with external libraries. In a multi-language software product, extending a class written in a statically-typed languag...
82
Voted
CAV
2007
Springer
15 years 1 months ago
2007
Springer
In automatic software verification, we have observed a theoretical convergence of model checking and program analysis. In practice, however, model checkers are still mostly concern...