Sciweavers

12052 search results - page 2176 / 2411
» computer 2010
Sort
View
BIRTHDAY
2010
Springer
13 years 9 months ago
The Architecture Description Language MoDeL
m, modules, types and operations), different kinds of abstractions (functional/data, types/objects etc.) without falling into a loose collection of diagram languages. Considering a...
Peter Klein
ICTAC
2010
Springer
13 years 8 months ago
Mechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
J. Gregory Malecha, Greg Morrisett
BIRTHDAY
2010
Springer
13 years 11 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
PODC
2010
ACM
14 years 2 months ago
Deterministic distributed vertex coloring in polylogarithmic time
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
Leonid Barenboim, Michael Elkin
BIRTHDAY
2010
Springer
13 years 11 months ago
The Edge of Graph Transformation - Graphs for Behavioural Specification
The title of this paper, besides being a pun, can be taken to mean either the frontier of research in graph transformation, or the advantage of using graph transformation. To focus...
Arend Rensink
« Prev « First page 2176 / 2411 Last » Next »