293 search results - page 18 / 59 » Reasoning About States of Probabilistic Sequential Programs |
POPL
2008
ACM
14 years 7 months ago
2008
ACM
In language-based security, confidentiality and integrity policies conveniently specify the permitted flows of information between different parts of a program with diverse levels...
CL
2004
Springer
13 years 7 months ago
2004
Springer
Much of the elegance and power of Smalltalk comes from its programming environment and tools. First introduced more than 20 years ago, the Smalltalk browser enables programmers to...
FOSSACS
2010
Springer
14 years 2 months ago
2010
Springer
Every algebraic theory gives rise to a monad, and monads allow a meta-language which is a basic programming language with sideeffects. Equations in the algebraic theory give rise ...
ESOP
2010
Springer
14 years 4 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...