Search Sciweavers | Sciweavers

t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...

Peter W. O'Hearn

claim paper

Read More »

148

click to vote

ESOP
2004
Springer

123views Programming Languages» more ESOP 2004»

Strong Preservation as Completeness in Abstract Interpretation

15 years 12 months ago

Download www.math.unipd.it

Francesco Ranzato, Francesco Tapparo

claim paper

Read More »

159

click to vote

FAABS
2004
Springer

136views Intelligent Agents» more FAABS 2004»

From Abstract to Concrete Norms in Agent Institutions

15 years 12 months ago

Download people.cs.uu.nl

Davide Grossi, Frank Dignum

claim paper

Read More »

145

click to vote

FC
2004
Springer

78views Cryptology» more FC 2004»

Timing Attacks in Low-Latency Mix Systems (Extended Abstract)

15 years 12 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers