
	Where results make sense

Topic: Axiomatic semantics

Related Topics

Hoare logic

Scheme programming language

In the News (Fri 17 Feb 12)

EXECUTIVE POWER

Iran

ANALYSIS

Pakistan

Family compact

	Semantics - Wikipedia, the free encyclopedia
		Semantics is often opposed to syntax, in which case semantics pertains to what something means, while syntax pertains to the formal structure/patterns in which something is expressed (for example written or spoken).
		Semantics is distinguished from ontology (study of existence) in being about the use of a word more than the nature of the entity referenced by the word.
		Semantic memory is a term used in neuropsychology to refer to memory for facts, or "knowledge", as opposed to memory for events (episodic memory).
	en.wikipedia.org /wiki/Semantics (438 words)

	Learn more about Semantics in the online encyclopedia. (Site not responding. Last check: 2007-10-09)
		In general, Semantics (from the Greek semantikos, or "significant meaning," derived from "sema," sign) always refers to some kind of meaning (of something that is written) and is thus usually opposed to syntax, which refers to the formal way in which something is written.
		Semantics is a subfield of linguistics that is traditionally defined as the study of meaning.
		One area of study is the meaning of compounds, another is the study of relations between different linguistic expressions (homonymy, synonymy, antonymy, polysemy, hypernymy, hyponymy).
	www.onlineencyclopedia.org /s/se/semantics.html (241 words)

	Lecture 5
		Indeed, operational semantics is a semantic description which is based on algorithms--code is translated into instructions to be carried out on some machine, whether virtual or real.
		For those languages that have english specifications, the fact that a compiler is an operational semantic definition of a language doesn't change the fact that the language spec is _the_ definition of the language.
		Axiomatic semantics is based on mathematics, not algorithms, and was developed as a way to prove the correctness of a program.
	www.cc.gatech.edu /classes/cs3411a_99_winter/lec5.html (994 words)

	CptS 355 - Semantics (Site not responding. Last check: 2007-10-09)
		The dynamic semantics refers to the question "what does this program compute?" Often the approach taken to answer this is to look at how the program state (the collection of values of the variables in the program along with the program counter) evolves as the computation proceeds from statement to statement.
		Denotational semantics - Each statement can be modeled as a function that relates the input (the state prior to the statement) to the output (the state after the statement).
		The fundamental insight of axiomatic semantics is that if we want some property to be true of the state after executing a statement it is straightforward to determine what must be true of the state before executing the statement.
	www.eecs.wsu.edu /~hauser/CS355/lectures/semantics.html (1431 words)

	Axiomatic Semantics (Site not responding. Last check: 2007-10-09)
		Figure 3.3 is an example of the use of axiomatic semantics in the verification of programs.
		The axiomatic method is the most abstract of the semantic methods and yet, from the programmer's point of view, the most practical method.
		Axiomatics semantics are the favored method by software engineers for program verification and program derivation.
	cs.wwc.edu /~aabyan/PLBook/book/node36.html (985 words)

	[No title]
		Axiomatic Semantics¨The meaning of the programming language is defined implicitly by a logical calculus called program logic which provides a tool for the derivation of assertions of the form: {Precondition} Program {Postcondition} Properties about program language constructs are defined and expressed with axioms and rules from logic.
		Axiomatic definitions tend to be abstract and are best used at the specification stage or to give documentation of language properties which are of interest to the user.
		¨Semantic Algebras¨—Format for presenting semantic domains clearly states the structure of a domain and how its elements are used by the functions Encourages the development of a standard algebra module that may be used with many semantic definitions Makes it easier to analyse a semantic definition concept by concept.
	www.cs.may.ie /~rosemary/SE424/1.semantics1-4.ppt (875 words)

	ipedia.com: Semantics Article (Site not responding. Last check: 2007-10-09)
		In general, semantics (from the Greek semantikos, or "significant meaning," derived from sema, sign) is the study of meaning, in some sense of that term.
		Semantics is often opposed to syntax, in which case the former pertains to what something means while the latter pertains to the formal structure/patterns in which something is expressed (e.g.
		An area of study is the meaning of compounds, another is the study of relations between different linguistic expressions (homonymy, synonymy, antonymy, polysemy, hypernymy, hyponymy, meronymy, holonymy, exocentric, and endocentric).
	www.ipedia.com /semantics.html (294 words)

	RDF Semantics (Site not responding. Last check: 2007-10-09)
		An alternative way to specify a semantics is to give a translation from RDF into a formal logic with a model theory already attached, as it were.
		The axiomatic semantics style has some advantages for machine processing and may be more readable, but in the event that any axiomatic semantics fails to conform to the model-theoretic semantics described in this document, the model theory should be taken as normative.
		The semantics does not assume any particular relationship between the denotation of a URI reference and a document or Web resource which can be retrieved by using that URI reference in an HTTP transfer protocol, or any entity which is considered to be the source of such documents.
	www.w3.org /TR/rdf-mt (11716 words)

	Semantics (Site not responding. Last check: 2007-10-09)
		Semantics is concerned with the interpretation or understanding of programs and how to predict the outcome of program execution.
		Semantics can be thought of as a function which maps syntactical constructs to the computational model.
		Operational semantics may describe the syntactic transformations which mimic the execution of the program on an abstract machine or define a translation of the program into recursive functions.
	cs.wwc.edu /~aabyan/PLBook/book/node34.html (324 words)

	Semantics
		There are several widely used techniques (algebraic, axiomatic, denotational, operational, and translation) for the description of the semantics of programming languages.
		The goal of algebraic semantics is to capture the semantics of behavior by a set of axioms with purely syntactic properties.
		The axiomatic semantics of a programming language are the assertions about relationships that remain the same each time the program executes.
	burks.brighton.ac.uk /burks/pcinfo/progdocs/plbook/semantic.htm (3586 words)

	An Axiomatic Semantics for RDF, RDF Schema, and DAML+OIL
		An Axiomatic Semantics for RDF, RDF Schema, and DAML+OIL
		Abstract: "An Axiomatic Semantics for RDF, RDF Schema, and DAML+OIL"
		The basic claim of this paper is that the logical theory produced by the mapping specified herein of a set of such descriptions is logically equivalent to the intended meaning of that set of descriptions.
	www.ksl.stanford.edu /people/dlm/daml-semantics/abstract-axiomatic-semantics.html (343 words)

	[No title] (Site not responding. Last check: 2007-10-09)
		The denotational semantics characterizes programs as elements of some mathematical domain in a compositional way: the semantics of a language construct is defined in terms of its components.
		The axiomatic semantics characterizes programs in a logical framework intended for reasoning about programs properties: computations are expressed by relating programs to assertions about their behaviour.
		The semantics domain is a metric space which is shown to be isometric to the resumption domain of De Bakker and Zucker.
	homepages.cwi.nl /~marcello/Abs/entcs (660 words)

	CSC 530 Lecture Notes Week 8 (Site not responding. Last check: 2007-10-09)
		The fundamental relationship between axiomatic and denotational is that the soundness of former is proved by appeal to the latter.
		That is, for a axiomatic semantics to be sound, we must prove that the axiomatic proof system makes sense vis a vis the language it is to be used with.
		The key difference with axiomatic semantics versus the other two forms is is that applying the verification rules involves manipulation of boolean predicates rather than manipulation of data-valued variables.
	www.csc.calpoly.edu /~gfisher/classes/530/lectures/8.html (2841 words)

	Andy Pitts' view (Site not responding. Last check: 2007-10-09)
		The fact that SML possesses a formal definition of its semantics as well as its syntax no doubt accounts for the fact that it is the target of so much work in programming language theory.
		Worse, it may involve some original research, since structural operational semantics (SOS) of call-by-need is still in the realms of the non-routine (though Launchbury's work goes a long way to putting it in that realm).
		One approach is that of "axiomatic" semantics: specify a theory (usually an equational theory in the case of function-oriented languages) to be the official semantics of the language.
	www.cs.chalmers.se /~rjmh/Haskell/Messages/Archived.cgi?id=158 (420 words)

	COMP317: Introduction
		The semantics of a program written in the language is then derived from the semantics of its component parts (i.e., its assignments, loops, and so on).
		When the semantics of all programs are described in terms of the semantics of their components, we call this compositional semantics.
		The issue of program verification is one of correctness; when we have a semantics for a programming language, one form of the correctness issue is whether a language is correctly implemented (i.e., can we verify the correctness of the compiler or interpreter that implements the language on a particular platform).
	www.csc.liv.ac.uk /~grant/Teaching/COMP317/intro.html (1505 words)

	2 Operational Semantics (Site not responding. Last check: 2007-10-09)
		However, an operational semantics is more precise than an interpreter because it is defined mathematically, and not based on the meaning of the language in which the interpreter is written.
		An operational semantics for a programming language is a means for understanding in precise detail the meaning of an expression in the language.
		The only difference between the operational semantics and the interpreter is that the interpreter is a function, so we start with the bottom-left expression in a rule, use the interpreter to recursively produce the value(s) above the line in the rule, and finally compute and return the value below the line in the rule.
	www.cs.jhu.edu /~scott/plbook/book/html/mainch4.html (7098 words)

	The Formal Semantics of Programming Languages - The MIT Press (Site not responding. Last check: 2007-10-09)
		Denotational and axiomatic semantics are illustrated on a simple language of while-programs, and fall proofs are given of the equivalence of the operational and denotational semantics and soundness and relative completeness of the axiomatic semantics.
		Following a presentation of domain theory, the semantics and methods of proof for several functional languages are treated.
		Throughout, the relationship between denotational and operational semantics is stressed, and the proofs of the correspondence between the operation and denotational semantics are provided.
	mitpress.mit.edu /catalog/item?ttype=2&tid=8094 (333 words)

	An Axiomatic Semantics for RDF, RDF Schema, and DAML-ONT (Site not responding. Last check: 2007-10-09)
		An Axiomatic Semantics for RDF, RDF Schema, and DAML-ONT
		Abstract: "An Axiomatic Semantics for RDF, RDF Schema, and DAML-ONT"
		This document provides an axiomatization for the Resource Description Framework (RDF), RDF Schema, and DAML-ONT by specifying a mapping of a set of descriptions in any one of these languages into a logical theory expressed in first-order predicate calculus.
	www-ksl.stanford.edu /people/dlm/daml-semantics/old-versions/abstract-axiomatic-semantics-daml-ont.html (211 words)

	DAML+OIL Axioms
		This axiomatization is designed to place minimal constraints on the interpretation of the non-logical symbols in the resulting logical theory.
		This relation is used in the axiomatization of properties “cardinality”, “minCardinality”, and “maxCardinality”.
		This section axiomatizes the classes that are included in RDF and defines one additional class (i.e., FunctionalProperty) that is useful in axiomatizing other classes and properties.
	www.daml.org /2000/12/axiomatic-semantics.html (2703 words)

	CptS 355 - Syntax and Semantics
		The dynamic semantics refers to the question "what does this program compute?" Often this is taken to mean the state, or collection of values of the variables in the program, as the computation proceeds from state to state.
		Loops are a powerful programming tool to represent much computation with little code, and axiomatic semantics has an equally powerful tool to reason about what loops do.
		The idea behind denotation semantics is to build a function that describes or denotes the meaning of a program.
	www.eecs.wsu.edu /~hauser/teaching/Languages-S04/lectures/syntax.html (2686 words)

	Semantics of Programming Languages (Com S 641)
		Logically based models include axiomatic semantics (e.g., a Hoare logic for partial correctness) and inference systems used in the study of ``logic-oriented'' languages (such as Prolog) or type theory.
		For an example of connections, one may relate an operational semantics to an axiomatic semantics for a language to prove that the axiomatic semantics is sound and complete (or ``fully abstract'') by way of a denotational semantics.
		As an example of applications, one may use semantic tools such as type theory, denotational semantics, and axiomatic semantics to design new specification languages and connect them with verification techniques.
	www.cs.iastate.edu /~leavens/ComS641-Gunter.html (611 words)

	CS3151 syllabus (Site not responding. Last check: 2007-10-09)
		One semantics for a procedural language will be given in an appendix to the exam paper.
		For this semantics students are expected to be able to extend the semantics for more complex constructions.
		A major component of the other four exam questions will be to give a corresponding semantics to that of the appendix and show their relation.
	www.cs.man.ac.uk /ugrad/syllabus2004latest/CS3151.htm (293 words)

	Axiomatic Semantics Assignment (Site not responding. Last check: 2007-10-09)
		Axiomatic semantics are one way of formally specifying the properties of a programming language.
		Here is a BNF description of the syntax and static semantics of a mini programming language called SL.
		For each step in the proof, name the semantic rule you used to justify the step.
	www.cc.gatech.edu /computing/classes/AY2006/cs6390_fall/hw/axiom.html (247 words)

	University of South Carolina: CSCE 330 Lecture Log (Site not responding. Last check: 2007-10-09)
		Example (on handout) of denotational semantics of a program with a while loop (factorial computation).
		Axiomatic semantics: loop invariants, with a detailed example.
		Denotational semantics (handout based on the second edition of the textbook).
	www.cse.sc.edu /~mgv/csce330f03/log (2644 words)

	[No title] (Site not responding. Last check: 2007-10-09)
		Topological Dualities in Semantics PhD thesis of Marcello M. Bonsangue Abstract: The formal semantics of a programming language consists of assigning to every program of the language an element of a mathematical structure.
		In this thesis we study the relationship between two different approaches to define the semantics of a program, namely the denotational and the axiomatic one.
		In the second part of the thesis, in order to study the semantics of concurrent languages, we refine the notion of predicates by considering affirmative predicates.
	homepages.cwi.nl /~marcello/Abs/phdthesis (706 words)

	AX from FOLDOC (Site not responding. Last check: 2007-10-09)
		One interesting use of axiomatic semantics is to have a language that has a finitely computable sublanguage that is used for specifying pre and post conditions, and then have the compiler prove that the program will satisfy those conditions.
		For this reason mathematicians do set theory axiomatically: that is, there is a formal language for talking about sets, and a collection of axioms describing how they behave, and the only legitimate way of drawing conclusions about sets is to use the axioms.
		Each takes a slightly different approach to the problem of finding a theory that captures as much as possible of the intuitive idea of what a set is, while avoiding the paradoxes that result from accepting all of it.
	www.instantweb.com /d/dictionary/foldoc.cgi?query=AX (1326 words)

	[No title] (Site not responding. Last check: 2007-10-09)
		These are used to prove that, given some initial conditions hold, some desired final result will hold after execution of program A set of axiomatic specifications for a particular subject language is sometimes said to constitute a proof theory for that language.
		The basic aim of an axiomatic definition is to specify which assertions are true; these will be the ones that are provable "theorems" of the formal system.
		To give an axiomatic semantic specification of a programming language, you must associate at least one rule with every construct of the language.
	www.ecst.csuchico.edu /~amk/foo/csci351/Chapter9.doc (1924 words)

	CMPS 203 - Programming Languages - Fall 2004
		The first part of this graduate-level course focuses on the study of the semantics of a variety of programming language constructs.
		We will study structural operational semantics as a way to formalize the intended execution and implementation of languages, axiomatic semantics, useful in developing as well as verifying programs, and denotational semantics, whose deep mathematical underpinnings make it the most versatile of all.
		In addition to the topics studies in class, students will have the opportunity to consider other related topics of interest in the form of a course project, most often in the form of a survey of recent research on a topic of interest.
	www.soe.ucsc.edu /classes/cmps203/Fall04 (1394 words)

	University of South Carolina: CSCE 330 Lecture Log (Site not responding. Last check: 2007-10-09)
		Axiomatic semantics, up to and not including loop invariants.
		The factorial example: introduction, proof of partial correctness using axiomatic semantics.
		Operational semantics of call and return of the C3 language.
	www.cse.sc.edu /~mgv/csce330f05/log (488 words)

Try your search on: Qwika (all wikis)