Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,220,490 papers from all fields of science
Search
Sign In
Create Free Account
3D XPoint
Known as:
3DXPoint
, XPoint memory
, 3D XPoint memory
Expand
3D XPoint (pronounced three dee cross point) is a non-volatile memory technology announced by Intel and Micron in July 2015. Intel refers to future…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Computer memory
Hybrid Memory Cube
Intel Developer Forum
Kaby Lake
Expand
Broader (1)
Non-volatile memory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2001
2001
A Logic of Access Control
J. Crampton
,
G. Loizou
,
G. O'Shea
Computer/law journal
2001
Corpus ID: 14443697
The effectiveness of an access control mechanism in implementing a security policy in a centralized operating system is often…
Expand
1997
1997
Well-Founded Ordered Search: Goal-Directed Bottom-Up Evaluation of Well-Founded Models
Peter James Stuckey
,
S. Sudarshan
The Journal of Logic Programming
1997
Corpus ID: 16763027
Highly Cited
1997
Highly Cited
1997
Constructive Negation by Pruning
F. Fages
The Journal of Logic Programming
1997
Corpus ID: 2998763
1996
1996
A Framework for a Modal Logic Programming
M. Baldoni
,
Laura Giordano
,
A. Martelli
Joint International Conference and Symposium on…
1996
Corpus ID: 5263803
In this paper we present a framework for developing modal extensions of logic programming,which are parametric with respect to…
Expand
1995
1995
An Algebra for Pomsets
S. Grumbach
,
Tova Milo
International Conference on Database Theory
1995
Corpus ID: 7654888
We study languages for manipulating partially ordered structures with duplicates (e.g. trees, lists). As a general framework, we…
Expand
1995
1995
Categorical Fixed Point Calculus
R. Backhouse
,
M. Bijsterveld
,
Rik van Geldrop
,
J. V. D. Woude
Category Theory and Computer Science
1995
Corpus ID: 1762388
A number of lattice-theoretic fixed point rules are generalised to category theory and applied to the construction of…
Expand
1995
1995
Efficient Detection of Incompleteness Errors in the Abstract Debugging of Logic Programs
M. Comini
,
G. Levi
,
G. Vitiello
Automated and Algorithmic Debugging
1995
Corpus ID: 809773
Abstract debugging of logic programs is an extension of declarative debugging, where we deal with specifications of operational…
Expand
1994
1994
Set Constraints and Logic Programming
D. Kozen
Information and Computation
1994
Corpus ID: 5170085
Set constraints are inclusion relations between expressions denoting sets of ground terms over a ranked alphabet. They are the…
Expand
1993
1993
Sequentializing Program Dependence Graphs for Irreducible Programs
B. Steensgaard
1993
Corpus ID: 53808478
Compilers using a parallel intermediate program representation like the program dependence graph must sequentialize the code as…
Expand
Highly Cited
1991
Highly Cited
1991
Fundamental Properties of Deterministic and Nondeterministic Extensions of Datalog
S. Abiteboul
,
E. Simon
Theoretical Computer Science
1991
Corpus ID: 17795242
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE