IANDC 2007 - PDF Preprint Papers

IANDC 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IANDC-2007 Paper

click to vote

IANDC
2007

152views more IANDC 2007»

The reactive simulatability (RSIM) framework for asynchronous systems

14 years 7 days ago

Download eprint.iacr.org

We deﬁne reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (speciﬁcation) in a way that pre...

Michael Backes, Birgit Pfitzmann, Michael Waidner

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	152	The reactive simulatability (RSIM) framework for asynchronous systems	claim
2	151	Transducer-based analysis of cryptographic protocols	claim
3	133	On decidability of monadic logic of order over the naturals extended by monadic predicates	claim
4	132	An automata-theoretic approach to constraint LTL	claim
5	127	Temporal logics with incommensurable distances are undecidable	claim
6	126	Alternating two-way AC-tree automata	claim
7	123	Hardness of fully dense problems	claim
8	117	Computing the edit distance of a regular language	claim
9	111	Expressiveness and complexity of graph logic	claim
10	107	Task automata: Schedulability, decidability and undecidability	claim
11	106	Extended visual cryptography schemes	claim
12	106	Tyrolean termination tool: Techniques and features	claim
13	96	A general mathematics of names	claim
14	94	Mediating secure information flow policies	claim
15	85	Nominal rewriting	claim
16	84	The perfectly synchronized round-based model of distributed computing	claim
17	83	Cluster computing and the power of edge recognition	claim
18	81	Some natural conditions on incremental learning	claim
19	77	One-unambiguity of regular expressions with numeric occurrence indicators	claim
20	76	Controlling information release in the pi-calculus	claim
21	74	Fast congruence closure and extensions	claim
22	66	Quantitative temporal logics over the reals: PSpace and below	claim
23	66	Exponential lower bounds for the number of words of uniform length avoiding a pattern	claim
24	62	Unfolding semantics of graph transformation	claim
25	52	A general lock-free algorithm using compare-and-swap	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers