Sciweavers

1154 search results - page 84 / 231
» Mathematizing C concurrency
Sort
View
POPL
1997
ACM
14 years 2 months ago
Proof-Carrying Code
Proof-carrying code is a framework for the mechanical verification of safety properties of machine language programs, but the problem arises of quis custodiat ipsos custodes—wh...
George C. Necula
AML
2007
51views more  AML 2007»
13 years 10 months ago
Semifree actions of free groups
We study countable universes similar to a free action of a group G. It turns out that this is equivalent to the study of free semi-actions of G, with two universes being transforma...
Martin Hils
DM
2008
161views more  DM 2008»
13 years 10 months ago
On the geodetic number and related metric sets in Cartesian product graphs
A set S of vertices of a graph G is a geodetic set if every vertex of G lies in at least one interval between the vertices of S. The size of a minimum geodetic set in G is the geo...
Bostjan Bresar, Sandi Klavzar, Aleksandra Tepeh Ho...
DM
2008
89views more  DM 2008»
13 years 10 months ago
Nearlattices
By a nearlattice is meant a join-semilattice having the property that every principal filter is a lattice with respect to the semilattice order. We introduce the concept of (relat...
Ivan Chajda, Miroslav Kolarík
DM
2006
79views more  DM 2006»
13 years 10 months ago
Restricted even permutations and Chebyshev polynomials
We study generating functions for the number of even (odd) permutations on n letters avoiding 132 and an arbitrary permutation on k letters, or containing exactly once. In sever...
Toufik Mansour