1128 search results - page 80 / 226 » Little Engines of Proof |
70
Voted
WOSP
2010
ACM
15 years 4 months ago
2010
ACM
In this paper we provide a general method to derive productform solutions for stochastic models. We take inspiration from the Reversed Compound Agent Theorem [14] and we provide a...
FASE
2009
Springer
15 years 4 months ago
2009
Springer
Security automata are a convenient way to describe security policies. Their typical use is to monitor the execution of an application, and to interrupt it as soon as the security p...
FASE
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...
101
click to vote
ASWEC
2007
IEEE
15 years 4 months ago
2007
IEEE
Behavior Trees (BTs) are a graphical notation used for formalising functional requirements and have been successfully applied to several case studies. However, the notation curren...
SEFM
2007
IEEE
15 years 4 months ago
2007
IEEE
We model security protocols as a game tree using concepts of game semantics. Using this model we ascribe semantics to protocols written in the standard simple arrow notation. Acco...