Sciweavers

13383 search results - page 107 / 2677
» Abstractions from proofs
Sort
View
TCS
2002
15 years 4 months ago
Streams and strings in formal proofs
Streams are acyclic directed subgraphs of the logical ow graph of a proof representing bundles of paths with the same origin and the same end. The notion of stream is used to desc...
Alessandra Carbone
ISSE
2010
14 years 12 months ago
Coloured Petri net refinement specification and correctness proof with Coq
In this work, we address the formalisation of symmetric nets, a subclass of coloured Petri nets, refinement in COQ. We first provide a formalisation of the net models, and of thei...
Christine Choppy, Micaela Mayero, Laure Petrucci
IACR
2011
132views more  IACR 2011»
14 years 4 months ago
Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
Abstract. Tampering attacks are cryptanalytic attacks on the implementation of cryptographic algorithms (e.g., smart cards), where an adversary introduces faults with the hope that...
Sebastian Faust, Krzysztof Pietrzak, Daniele Ventu...
POPL
2012
ACM
14 years 21 days ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...
JAIR
2007
65views more  JAIR 2007»
15 years 5 months ago
The Strategy-Proofness Landscape of Merging
Merging operators aim at defining the beliefs/goals of a group of agents from the beliefs/goals of each member of the group. Whenever an agent of the group has preferences over t...
Patricia Everaere, Sébastien Konieczny, Pie...