Filters








790 Hits in 2.7 sec

Defining the undefinedness of C

Chris Hathhorn, Chucky Ellison, Grigore Roşu
2015 Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2015  
Based on this evaluation, we argue that our work is the most comprehensive and complete semantic treatment of undefined behavior in C, and thus of the C language itself. ··· k ··· X → L ··· env ··· L →  ...  Our checker is capable of detecting examples of all 77 categories of core language undefinedness appearing in the C11 standard, more than any other tool we considered.  ...  To the best of our knowledge, ours is the most comprehensive semantic treatment of undefinedness in C.  ... 
doi:10.1145/2737924.2737979 dblp:conf/pldi/HathhornER15 fatcat:wkvoltixafgjhhxhal44el6uny

Defining the undefinedness of C

Chris Hathhorn, Chucky Ellison, Grigore Roşu
2015 SIGPLAN notices  
Based on this evaluation, we argue that our work is the most comprehensive and complete semantic treatment of undefined behavior in C, and thus of the C language itself. ··· k ··· X → L ··· env ··· L →  ...  Our checker is capable of detecting examples of all 77 categories of core language undefinedness appearing in the C11 standard, more than any other tool we considered.  ...  To the best of our knowledge, ours is the most comprehensive semantic treatment of undefinedness in C.  ... 
doi:10.1145/2813885.2737979 fatcat:okdvuvccr5fmzndqbfj36x4cha

Formalizing Undefinedness Arising in Calculus [chapter]

William M. Farmer
2004 Lecture Notes in Computer Science  
This paper demonstrates this by defining a version of simple type theory called Simple Type Theory with Undefinedness (sttwu) and then formalizing in sttwu examples of undefinedness arising in calculus  ...  The traditional approach to undefinedness in mathematical practice is to treat undefined terms as legitimate, nondenoting terms that can be components of meaningful statements.  ...  A6 (Expressions of Type * are Defined) A * ↓ . A7 (Variables are Defined) (x : α) ↓ where x ∈ V and α ∈ T . A8 (Constants are Defined) c ↓ where cC.  ... 
doi:10.1007/978-3-540-25984-8_35 fatcat:suufsb5rz5fvliywolappj4y5m

Multi-valued Representation of Neutrosophic Information [chapter]

Vasile Patrascu
2014 Communications in Computer and Information Science  
These three representations are provided in the framework of multi-valued logics and it provides some calculation formulae for the following neutrosophic features: truth, falsity, neutrality, undefinedness  ...  The paper presents three variants for multi-valued representation of neutrosophic information.  ...  Using the indeterminacy defined by (3.7) we will define a hepta-valued representation base on the following features: truth t, falsity f, ambiguity a, contradiction c, saturation s, neutrality n and undefinedness  ... 
doi:10.1007/978-3-319-08795-5_32 fatcat:sbsmif57t5dhxelaqjijyaydrm

A contextual interpretation of undefinedness for runtime assertion checking

Yoonsik Cheon, Gary T. Leavens
2005 Proceedings of the Sixth sixth international symposium on Automated analysis-driven debugging - AADEBUG'05  
This paper describes how the runtime assertion checker of the Java Modeling Language (JML) copes with undefinedness.  ...  Runtime assertion checkers and static checking and verification tools must all cope with the well-known undefinedness problem of logic.  ...  = E 2 ¬c(E) ¬c(E) E1 ==> E2 ¬c(E) c(E) E1 <== E2 c(E) ¬c(E) (\forall D; E 1 ; E 2 ) ¬c(E) c(E) all others c(E) c(E) We define two kinds of contexts: positive and negative.  ... 
doi:10.1145/1085130.1085150 dblp:conf/aadebug/CheonL05 fatcat:m6w2lbg3rfejpaex53pbfjhs2i

Unifying Theories of Undefinedness in UTP [chapter]

Jim Woodcock, Victor Bandur
2013 Lecture Notes in Computer Science  
We apply these ideas to the COMPASS Modelling Language (CML),w hi c hi sa ni n te g r a ti o no fVDMa ndC SPi ntheCircus tradition.  ...  In our current paper, we instantiate these ideas in Hoare and He's Unifying Theories of Programming, with each different treatment of undefinedness formalized as a UTP theory.  ...  Then, for any construct c, we have c U ⊑ c V Proof (Construct monotonicity). The proof of the theorem is by induction on the syntax of the construct c.  ... 
doi:10.1007/978-3-642-35705-3_1 fatcat:glq6orgbkjfu5bjnxfrwymu4ku

The Proper Treatment of Undefinedness in Constraint Languages [chapter]

Alan M. Frisch, Peter J. Stuckey
2009 Lecture Notes in Computer Science  
This paper gives the first systematic treatment of undefinedness for finite-domain constraint languages.  ...  We present three alternative semantics for undefinedness, and for each of the semantics show how to map models that contain undefined expressions into equivalent models that do not.  ...  To be clear, our focus is defining the truth conditions of the language, not on defining the behaviour of a decision procedure for satisfiability or any other program.  ... 
doi:10.1007/978-3-642-04244-7_30 fatcat:dk4yyozkhzculbec7r5n4sycmu

Andrews' Type Theory with Undefinedness [article]

William M. Farmer
2014 arXiv   pre-print
Q^ u_0 is a modification of Andrews' type theory Q_0 that directly formalizes the traditional approach to undefinedness.  ...  The "traditional approach to undefinedness" in mathematical practice is to treat undefined terms as legitimate, nondenoting terms that can be components of meaningful statements.  ...  If V M ϕ (A αβ ) is defined, V M ϕ (B β ) is defined, and the function V M ϕ (A αβ ) is defined at the argument V M ϕ (B β ), then V M ϕ (C γ ) = V M ϕ (A αβ )(V M ϕ (B β )), the value of the function  ... 
arXiv:1406.7492v1 fatcat:jsykoujazzfrfaoa4dwxseuoq4

$\mathcal M, \mathcal N$ -Adhesive Transformation Systems [chapter]

Annegret Habel, Detlef Plump
2012 Lecture Notes in Computer Science  
We show that the category of partially labelled graphs is M, N -adhesive, where M and N are the classes of injective and injective, undefinedness-preserving graph morphisms, respectively.  ...  We obtain the Local Church-Rosser Theorem and the Parallelism Theorem for graph transformation with relabelling and application conditions as instances of results which we prove at the abstract level of  ...  In PLG, the regular monomorphisms are precisely the undefinedness preserving injective morphisms.  ... 
doi:10.1007/978-3-642-33654-6_15 fatcat:s2ubn2oqojenjl5ar57lb3ekdy

Completeness of the First-Order Logic of Partial Quasiary Predicates with the Complement Composition

Mykola Nikitchenko, Oksana Shkilniak, Stepan Shkilniak, Tohrul Mamedov
2019 Computer Science Journal of Moldova  
In the paper we define one of such logics called first-order logic of partial quasiary predicates with the complement composition.  ...  To increase expressibility of such logics, oriented on quasiary predicates, we extend their language with the complement operation (composition).  ...  The above-written sequent forms and closeness conditions define calculus C QEC . For sequent rules of C QEC we have the following main properties. Theorem 9.  ... 
doaj:be983650b6364955898fdef62c2d63b8 fatcat:o7i453n27zbtzaa3cv7kepxhmi

A Fitness Function to Find Feasible Sequences of Method Calls for Evolutionary Testing of Object-Oriented Programs

Myoung Yee Kim, Yoonsik Cheon
2008 2008 International Conference on Software Testing, Verification, and Validation  
The effectiveness of an evolutionary testing thus depends in part on the quality of the so-called fitness function that determines the degree of the fitness of a candidate solution.  ...  This is challenging because not all call sequences are feasible; each call of a sequence has to meet the assumption of the called method.  ...  Figure 3 (c) shows the effectiveness of several sample fitness functions with different parameter values.  ... 
doi:10.1109/icst.2008.31 dblp:conf/icst/KimC08 fatcat:eljpsh4hrza3xotqhvqi3o2bka

Deterministic Expressions in C [chapter]

Michael Norrish
1999 Lecture Notes in Computer Science  
However, with the help of a mechanised formalisation, we have shown that the semantics' additional constraints actually result in a large class of C expressions having only one possible behaviour.  ...  Expressions in the programming language C have such an under-specified semantics that one might expect them to be non-deterministic.  ...  In addition to defining the semantics of C, our Cholera project aims to put results like this determinism theorem to work: using them in the verification of not entirely trivial programming examples.  ... 
doi:10.1007/3-540-49099-x_10 fatcat:i7ku63gc3rhmtg4k2rj5c5d7gy

Syntactic definitions of undefined: On defining the undefined [chapter]

Zena Ariola, Richard Kennaway, Jan Willem Klop, Ronan Sleep, Fer-Jan Vries
1994 Lecture Notes in Computer Science  
We give two axioms that a notion of undefinedness should satisfy, and explore some of their consequences. The axioms lead to a concept analogous to the BShm trees of the A-calculus.  ...  We consider several particular notions of undefinedness satisfying the axioms, and compare them.  ...  undefinedness should satisfy, which we state here as two axioms on the set U of undefined terms.  ... 
doi:10.1007/3-540-57887-0_114 fatcat:jvuhnpqbrfcubcg2avjrkpbxse

Counterfactuals and Undefinedness: Homogeneity vs. Supervaluations

Paul Marty, Jacopo Romoli, Paolo Santorio
2021 Semantics and Linguistic Theory  
Theories of counterfactuals agree on appealing to a relation of comparative similarity, but disagree on the quantificational force of counterfactuals.  ...  We report on two experiments testing the predictions of three main approaches: universal theories, homogeneity theories, and single-world selection theories (plus supervaluations over selection functions  ...  account: (6) A C w, =    defined iff either ∀w : w ∈ w, ( A w, ), C w , = true or ∀w : w ∈ w, ( A w, ), C w , = false true iff ∀w : w ∈ w, ( A w, ), C w , = true The appeal to a definedness condition  ... 
doi:10.3765/salt.v30i0.4842 fatcat:ik6m6ydhrrfnbosvjcn4czcrgm

A Proposal for a Formal OCL Semantics in Isabelle/HOL [chapter]

Achim D. Brucker, Burkhart Wolff
2002 Lecture Notes in Computer Science  
alternatives of the language design.  ...  We present a formal semantics as a conservative shallow embedding of the Object Constraint Language (OCL).  ...  Now, when defining f , we proceed by f (e 1 , . . . , e n )(c) = E(e 1 c, . . . , e n c) for some E and some context transition c. We call the structure of definitions state passing.  ... 
doi:10.1007/3-540-45685-6_8 fatcat:nx6vit5dwzaofgpb3qvd6ifyhe
« Previous Showing results 1 — 15 out of 790 results