442 search results - page 65 / 89 » Proof Abstraction for Imperative Languages |
AML
2006
13 years 8 months ago
2006
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
TCC
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
TAPSOFT
1997
Springer
14 years 23 days ago
1997
Springer
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...
COMSWARE
2006
IEEE
14 years 2 months ago
2006
IEEE
ing a middleware abstraction layer into wireless sensor networks is a widely accepted solution to facilitate application programming and allow network organization. In this paper,...
ISCAS
2003
IEEE
14 years 1 months ago
2003
IEEE
To handle today’s complexity, modern circuits and systems be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast on o...