1914 search results - page 144 / 383 » Verification by Abstract Interpretation |
FORTE
2004
15 years 2 months ago
2004
Abstract. Event-based process algebraic specification languages support an elegant specification technique by which system behaviours are described as compositions of constraints o...
124
Voted
ASIAN
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Clever algorithm design is sometimes superseded by simple encodings into logic. We apply this motto to a few case studies in the formal verification of security propertie...
91
Voted
ECAI
2010
Springer
15 years 1 months ago
2010
Springer
The verification problem for action logic programs with non-terminating behaviour is in general undecidable. In this paper, we consider a restricted setting in which the problem be...
102
click to vote
IFIP
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We formally study two privacy-type properties in online auction protocols, bidding-price-secrecy and receipt-freeness. These properties are formalised as observational eq...
CBSE
2009
Springer
15 years 5 months ago
2009
Springer
A challenge of componentizing legacy applications is to extract behavior specification of suggested components. It is desirable to preserve a relation between the original structur...