output
20052009
most citedA TLA+ Proof System

17 citations

Showing 2008Show all

6 papers · 1 filter

cs.LO200817 cited

A TLA+ Proof System

Kaustuv C. Chaudhuri, Damien Doligez, Leslie Lamport +1

We describe an extension to the TLA+ specification language with constructs for writing proofs and a proof environment, called the Proof Manager (PM), to checks those proofs. The l…

cs.DS2008

Finding Dense Subgraphs in G(n,1/2)

Atish Das Sarma, Amit Deshpande, Ravi Kannan

Finding the largest clique is a notoriously hard problem, even on random graphs. It is known that the clique number of a random graph G(n,1/2) is almost surely either k or k+1, whe…

physics.soc-ph20081 cited

Modeling the Structure and Dynamics of the Consonant Inventories: A Complex Network Approach

Animesh Mukherjee, Monojit Choudhury, Anupam Basu +1

We study the self-organization of the consonant inventories through a complex network approach. We observe that the distribution of occurrence as well as cooccurrence of the conson…

math.PR2008

Local Bootstrap Percolation

Janko Gravner, Alexander E. Holroyd

We study a variant of bootstrap percolation in which growth is restricted to a single active cluster. Initially there is a single active site at the origin, while other sites of Z^…

cs.NE200813 cited

CMA-ES with Two-Point Step-Size Adaptation

Nikolaus Hansen

We combine a refined version of two-point step-size adaptation with the covariance matrix adaptation evolution strategy (CMA-ES). Additionally, we suggest polished formulae for the…

cs.CR2008

A Type System for Data-Flow Integrity on Windows Vista

Avik Chaudhuri, Prasad Naldurg, Sriram Rajamani

The Windows Vista operating system implements an interesting model of multi-level integrity. We observe that in this model, trusted code can be blamed for any information-flow atta…