Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,378,525 papers from all fields of science
Search
Sign In
Create Free Account
SPIN
The SPIN Operating System is a research project implemented in the computer programming language Modula-3, and is an Open Source project. It is…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Application programming interface
In-kernel web server
Microkernel
Modula-3
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
High-Density NAND-Like Spin Transfer Torque Memory With Spin Orbit Torque Erase Operation
Zhaohao Wang
,
Lei Zhang
,
+4 authors
Weisheng Zhao
IEEE Electron Device Letters
2018
Corpus ID: 3681149
We present a NAND-like spintronics memory (NAND-SPIN) device for high-density non-volatile memory applications. Fast erasing and…
Expand
Highly Cited
2014
Highly Cited
2014
Reduction and IR-drop compensations techniques for reliable neuromorphic computing systems
Beiye Liu
,
Hai Helen Li
,
+4 authors
Mark D. Barnell
IEEE/ACM International Conference on Computer…
2014
Corpus ID: 1815375
Neuromorphic computing system (NCS) is a promising architecture to combat the well-known memory bottleneck in Von Neumann…
Expand
Highly Cited
2010
Highly Cited
2010
Service Research Challenges and Solutions for the Future Internet
M. Papazoglou
,
K. Pohl
,
M. Parkin
,
Andreas Metzger
Lecture Notes in Computer Science
2010
Corpus ID: 39171261
In this age of modern era, the use of internet must be maximized. Yeah, internet will help us very much not only for important…
Expand
Highly Cited
2008
Highly Cited
2008
A decision procedure for propositional projection temporal logic with infinite models
Zhenhua Duan
,
Cong Tian
,
Li Zhang
Acta Informatica
2008
Corpus ID: 30394486
This paper investigates the satisfiability of Propositional Projection Temporal Logic (PPTL) with infinite models. A decision…
Expand
Highly Cited
2005
Highly Cited
2005
Facilitating the construction of specification pattern-based properties
S. Konrad
,
B. Cheng
IEEE International Requirements Engineering…
2005
Corpus ID: 15964222
Formal specification languages are often perceived as difficult to use by practitioners, and are therefore rarely-used in…
Expand
Highly Cited
2003
Highly Cited
2003
Static Guard Analysis in Timed Automata Verification
G. Behrmann
,
P. Bouyer
,
E. Fleury
,
K. Larsen
International Conference on Tools and Algorithms…
2003
Corpus ID: 1349074
By definition Timed Automata have an infinite state-space, thus for verification purposes, an exact finite abstraction is…
Expand
Highly Cited
2002
Highly Cited
2002
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
D. Giannakopoulou
,
Flavio Lerda
Formal Techniques for (Networked and) Distributed…
2002
Corpus ID: 12566031
Model checking is an automated technique for checking that a system satisfies a set of required properties. With explicit-state…
Expand
Highly Cited
1992
Highly Cited
1992
State-space caching revisited
Patrice Godefroid
,
G. Holzmann
,
Didier Pirottin
Formal Methods Syst. Des.
1992
Corpus ID: 13347421
State-space caching is a verification technique for finite-state concurrent systems. It performs an exhaustive exploration of the…
Expand
Highly Cited
1992
Highly Cited
1992
Coverage Preserving Reduction Strategies for Reachability Analysis
G. Holzmann
,
Patrice Godefroid
,
Didier Pirottin
Protocol Specification, Testing and Verification
1992
Corpus ID: 7149660
Highly Cited
1980
Highly Cited
1980
COOPER PAIRING IN SPIN-POLARIZED FERMI SYSTEMS
A. Leggett
1980
Corpus ID: 113398978
I discuss the phenomenon of Cooper pairing in strongly spin-polarized Fermi systems, such as 3He+ and D+, with particular…
Expand
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