33 search results - page 1 / 7 » A Complete Axiomatic Semantics for the CSP Stable-Failures M... |
CONCUR
2006
Springer
13 years 8 months ago
2006
Springer
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been gi...
FAC
2008
13 years 5 months ago
2008
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
ECAI
2010
Springer
13 years 6 months ago
2010
Springer
We define an Intuitionistic Conditional Logic for Access Control called CICL . The logic CICL is based on a conditional language allowing principals to be defined as arbitrary form...
ESOP
2012
Springer
12 years 19 days ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
ENTCS
2007
13 years 4 months ago
2007
ly positive maps (extended abstract) Peter Selinger 1 Department of Mathematics and Statistics Dalhousie University, Halifax, Nova Scotia, Canada Dagger compact closed categories ...