Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,346,904 papers from all fields of science
Search
Sign In
Create Free Account
Value semantics
In computer science, having value semantics (also value-type semantics or copy-by-value semantics) means for an object that only its value counts…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Computer science
Nets within Nets
Standard Template Library
Value object
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
M3: An Open Model for Measuring Code Artifacts
Anastasia Izmaylova
,
P. Klint
,
Ashim Shahi
,
J. Vinju
arXiv.org
2013
Corpus ID: 27916624
In the context of the EU FP7 project ''OSSMETER'' we are developing an infra-structure for measuring source code. The goal of…
Expand
2013
2013
Aggregate Count Queries in Probabilistic Spatio-temporal Databases
J. Grant
,
Cristian Molinaro
,
F. Parisi
Scalable Uncertainty Management
2013
Corpus ID: 3101200
The SPOT database concept was defined several years ago to provide a declarative framework for probabilistic spatio-temporal…
Expand
2012
2012
Automatically Proving Thousands of Verification Conditions Using an SMT Solver: An Empirical Study
Aditi Tagore
,
Diego Zaccai
,
B. Weide
NASA Formal Methods
2012
Corpus ID: 13367443
Recently it has become possible to verify full functional correctness of certain kinds of software using automated theorem…
Expand
2010
2010
Traversal, Case Analysis, and Lowering for C++ Program Analysis
Luke Wagner
2010
Corpus ID: 67037174
Traversal, Case Analysis, and Lowering for C++ Program Analysis. (August 2009) Luke A. Wagner, B.S., Texas A&M University Chair…
Expand
2008
2008
Sequential real number computation and recursive relations
J. R. Marcial-Romero
,
M. Moshier
Mathematical Logic Quarterly
2008
Corpus ID: 22543082
In the first author's thesis [10], a sequential language, LRT, for real number computation is investigated. That thesis includes…
Expand
2007
2007
Composing µSIC: A Lightweight Service Model for Wireless Sensor Networks
E. Bergstrom
,
R. Pandey
International Conference on Sensor Technologies…
2007
Corpus ID: 2028179
Although wireless sensor network applications share a common set of limitations (e.g. resource scarcity and lossy radio…
Expand
2007
2007
Lazy call-by-value evaluation
Bernd Brassel
,
M. Hanus
,
Sebastian Fischer
,
F. Huch
,
G. Vidal
ACM SIGPLAN International Conference on…
2007
Corpus ID: 1098450
Designing debugging tools for lazy functional programming languages is a complex task which is often solved by expensive tracing…
Expand
2003
2003
Compositional Verification for Object-Z
Kirsten Winter
,
Graeme Smith
ZB
2003
Corpus ID: 1476087
This paper presents a framework for compositional verification of Object-Z specifications. Its key feature is a proof rule based…
Expand
1994
1994
Ada 9X tagged types and their implementation in GNAT
C. Comar
,
B. Porter
TRI-Ada
1994
Corpus ID: 14066014
We discuss our experience in implementing Ada 9x tagged types in the GNU NYU Ada Translator (GN,AT). This paper is organized in 3…
Expand
1991
1991
Characterization of unknown values with implicit predicate
Jae Dong Yang
,
Yoon-Joon Lee
Decision Support Systems
1991
Corpus ID: 18704563
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