442 search results - page 47 / 89 » Proof Abstraction for Imperative Languages |
143
click to vote
AGP
1998
IEEE
15 years 9 months ago
1998
IEEE
It is important that practical data flow analysers are backed bly proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic ...
147
click to vote
TPLP
2002
15 years 5 months ago
2002
It is important that practical data-flow analyzers are backed by reliably proven theoretical Abstract interpretation provides a sound mathematical framework and necessary properti...
153
click to vote
APLAS
2004
ACM
15 years 10 months ago
2004
ACM
Abstract. More than being just a tool for expressing algorithms, a welldesigned programming language allows the user to express her ideas efficiently. The design choices however eï...
136
click to vote
ESOP
2007
Springer
15 years 11 months ago
2007
Springer
Abstract We present the semantics and proof system for an objectoriented language with active objects, asynchronous method calls, and futures. The language, based on Creol, disting...
154
click to vote
CRYPTO
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Non-interactive zero-knowledge (NIZK) proofs have been investigated in two models: the Public Parameter model and the Secret Parameter model. In the former, a public stri...