60 search results - page 6 / 12 » Compositional Proofs with Symbolic Execution |
POPL
2008
ACM
14 years 8 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
This paper presents the first type system for statically analyzing security protocols that are based on zero-knowledge proofs. We show how several properties offered by zero-knowl...
ICWS
2004
IEEE
13 years 9 months ago
2004
IEEE
The vision of the Semantic Web is to reduce manual discovery and usage of Web resources (documents and services) and to allow software agents to automatically identify these Web r...
FMCAD
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
CONCUR
2009
Springer
14 years 7 days ago
2009
Springer
Abstract. A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and concurrent composition, related by an inequational form of the exchange la...