Results 1 - 10 of 991

Notes On Formalizing Context

by John McCarthy , 1993
"... These notes discuss formalizing contexts as first class objects. The basic relation is ist(c; p). It asserts that the proposition p is true in the context c. The most important formulas relate the propositions true in different contexts. Introducing contexts as formal objects will permit axiomatizat ..."
Abstract - Cited by 417 (9 self) - Add to MetaCart
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c; p). It asserts that the proposition p is true in the context c. The most important formulas relate the propositions true in different contexts. Introducing contexts as formal objects will permit

Bug Isolation via Remote Program Sampling

by Ben Liblit, Alex Aiken, Alice X. Zheng, Michael I. Jordan - In Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation , 2003
"... We propose a low-overhead sampling infrastructure for gathering information from the executions experienced by a program 's user community. Several example applications illustrate ways to use sampled instrumentation to isolate bugs. Assertion-dense code can be transformed to share the cost of a ..."
Abstract - Cited by 335 (16 self) - Add to MetaCart
of assertions among many users. Lacking assertions, broad guesses can be made about predicates that predict program errors and a process of elimination used to whittle these down to the true bug. Finally, even for non-deterministic bugs such as memory corruption, statistical modeling based on logistic

The Asymptotic Elasticity of Utility Functions and Optimal Investment in Incomplete Markets

by D. Kramkov, W. Schachermayer - Annals of Applied Probability , 1997
"... . The paper studies the problem of maximizing the expected utility of terminal wealth in the framework of a general incomplete semimartingale model of a financial market. We show that the necessary and sufficient condition on a utility function for the validity of several key assertions of the theor ..."
Abstract - Cited by 264 (19 self) - Add to MetaCart
. The paper studies the problem of maximizing the expected utility of terminal wealth in the framework of a general incomplete semimartingale model of a financial market. We show that the necessary and sufficient condition on a utility function for the validity of several key assertions

Irksome assertions *

by Rachel Mckinnon, John Turri
"... Abstract: The Knowledge Account of Assertion (KAA) says that knowledge is the norm of assertion: you may assert a proposition only if you know that it’s true. The primary support for KAA is an explanatory inference from a broad range of linguistic data. The more data that KAA well explains, the stro ..."
Abstract - Add to MetaCart
Abstract: The Knowledge Account of Assertion (KAA) says that knowledge is the norm of assertion: you may assert a proposition only if you know that it’s true. The primary support for KAA is an explanatory inference from a broad range of linguistic data. The more data that KAA well explains

Inductive assertions and operational semantics

by J Strother Moore - CHARME 2003. Volume 2860 of LNCS., Springer-Verlag , 2003
"... Abstract. This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes only the proof obligations that would be produced by a verification condition generator but does not require th ..."
Abstract - Cited by 29 (8 self) - Add to MetaCart
function defined in terms of the state transition function of the operational semantics. If this alleged invariant can be proved to be an invariant under the state transition function, it follows that the assertions are true every time they are encountered in execution and thus that the post

Asserting and checking determinism for multithreaded programs

by Jacob Burnim, Koushik Sen - In FSE , 2009
"... The trend towards processors with more and more parallel cores is increasing the need for software that can take advantage of parallelism. The most widespread method for writing parallel software is to use explicit threads. Writing correct multithreaded programs, however, has proven to be quite chal ..."
Abstract - Cited by 44 (9 self) - Add to MetaCart
others will not. We propose an assertion framework for specifying that regions of a parallel program behave deterministically despite nondeterministic thread interleaving. Our framework allows programmers to write assertions involving pairs of program states arising from different parallel schedules. We

Indicative conditionals: the logic of assertion

by John Cantwell , 2006
"... I argue that indicative conditionals are best viewed as having partial truth conditions: “If A, B ” is true if A and B are both true, false if A is true and B is false, and lacks truth value if A is false. The truth conditions are shown to explain a variety of important phenomena regarding indicativ ..."
Abstract - Add to MetaCart
I argue that indicative conditionals are best viewed as having partial truth conditions: “If A, B ” is true if A and B are both true, false if A is true and B is false, and lacks truth value if A is false. The truth conditions are shown to explain a variety of important phenomena regarding

2003: The paradox of asserting clarity

by Chris Barker, Gina Taranto - Department of Linguistics, California State University
"... assertions are felicitous only if they add new information to the common ground. After all, what use could it be to claim that a proposition is true if it is already accepted as true? In this paper we suggest that this question is not rhetorical. Our answer is that some sentences can have side effec ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
assertions are felicitous only if they add new information to the common ground. After all, what use could it be to claim that a proposition is true if it is already accepted as true? In this paper we suggest that this question is not rhetorical. Our answer is that some sentences can have side

Expressing and Verifying Probabilistic Assertions

by Adrian Sampson, Pavel Panchekha, Todd Mytkowicz, Kathryn S. Mckinley, Dan Grossman, Luis Ceze
"... Traditional assertions express correctness properties that must hold on every program execution. However, many applications have prob-abilistic outcomes and consequently their correctness properties are also probabilistic (e.g., they identify faces in images, consume sensor data, or run on unreliabl ..."
Abstract - Cited by 7 (3 self) - Add to MetaCart
. Probabilistic assertions are Boolean expressions that express the probability that a property will be true in a given execution rather than asserting that the property must always be true. Given either specific inputs or distributions on the input space, probabilistic evaluation verifies probabilistic

Believing and Asserting Contradictions

by unknown authors
"... Abstract. The debate around “strong ” paraconsistency or dialetheism (the view that there are true contradictions) has – apart from metaphysical concerns- centred on the questions whether dialetheism itself can be definitely asserted or has a unique truth value, and what it should mean, if it is pos ..."
Abstract - Add to MetaCart
Abstract. The debate around “strong ” paraconsistency or dialetheism (the view that there are true contradictions) has – apart from metaphysical concerns- centred on the questions whether dialetheism itself can be definitely asserted or has a unique truth value, and what it should mean
Results 1 - 10 of 991