57 search results - page 11 / 12 » A monadic approach to polycategories |
CSL
2010
Springer
13 years 6 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
ICFP
2009
ACM
14 years 6 months ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
POPL
2006
ACM
14 years 6 months ago
2006
ACM
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
VMCAI
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
CHARME
2005
Springer
13 years 11 months ago
2005
Springer
The application of model-checking tools to complex systems involves a nontrivial step of modelling the system by a finite-state model and a translation of the desired properties i...