XML Based Information Systems and Formal Semantics of Programming Languages

2010 ◽  
pp. 331-352
Author(s):  
Thierry Despeyroux
Keyword(s):  
Information Systems ◽  
Programming Languages ◽  
Formal Semantics ◽  
Semantics Of Programming Languages

Deductive Semantics of RTPA

2009 ◽  
pp. 2915-2942
Author(s):  
Yingxu Wang
Keyword(s):  
Programming Languages ◽  
Large Scale ◽  
Formal Semantics ◽  
Semantic Theory ◽  
Software Systems ◽  
Software Comprehension ◽  
Support Tool ◽  
Semantic Function ◽  
Semantics Of Programming Languages ◽  
Finite Set

Deductive semantics is a novel software semantic theory that deduces the semantics of a program in a given programming language from a unique abstract semantic function to the concrete semantics embodied by the changes of status of a finite set of variables constituting the semantic environment of the program. There is a lack of a generic semantic function and its unified mathematical model in conventional semantics, which may be used to explain a comprehensive set of programming statements and computing behaviors. This article presents a complete paradigm of formal semantics that explains how deductive semantics is applied to specify the semantics of real-time process algebra (RTPA) and how RTPA challenges conventional formal semantic theories. Deductive semantics can be applied to define abstract and concrete semantics of programming languages, formal notation systems, and large-scale software systems, to facilitate software comprehension and recognition, to support tool development, to enable semantics-based software testing and verification, and to explore the semantic complexity of software systems. Deductive semantics may greatly simplify the description and analysis of the semantics of complicated software systems specified in formal notations and implemented in programming languages.

UNIVERSAL INFORMATION SYSTEMS

1990 ◽  
Vol 01 (04) ◽  
pp. 413-424 ◽  
Author(s):  
MANFRED DROSTE ◽  
RÜDIGER GÖBEL
Keyword(s):  
Information System ◽  
Information Systems ◽  
Programming Languages ◽  
Existence And Uniqueness ◽  
Denotational Semantics ◽  
Semantics Of Programming Languages ◽  
Theoretic Technique

In the theory of denotational semantics of programming languages, several authors proved the existence of particular kinds of universal domains. D. Scott constructed universal information systems, which are, however, not unique up to isomorphism. Here, we use a model-theoretic technique to establish the existence and uniqueness of a universal homogeneous information system. Similar results are also obtained for canonical and for stable information systems, respectively.

scholarly journals Comparative Semantics of Programming Languages

1984 ◽  
Vol 13 (173) ◽  
Author(s):  
Brian H. Mayoh
Keyword(s):  
Programming Languages ◽  
Formal Semantics ◽  
Formal Definition ◽  
Specification Languages ◽  
Semantics Of Programming Languages ◽  
Definition Of

<p>The flood of new programming and specification languages shows no sign of abating, but very few of these languages have a formal definition. The advantages of knowing precisely what is specified in a specification and exactly how a program can behave are obvious, but none of the existing formal definition methods are completely satisfactory.</p><p>Theoreticians have not been idle, but they have concentrated on problems that are not immediately relevant to language designers (algebraic and categoric structuring of definitions, refined notions of concurrency and the like).</p><p>In the belief that the answer to some of the language designers' problems is ''use different formalisms to define fragments of the languages precisely'', we advocate the study of comparative semantics. This paper is a contribution to this study, prompted by the fact that the parallel aspects of ADA seem to require a quite different kind of formal semantics from that used for sequential ADA in ''Formal Definition of ADA'', CII Honeywell Bull, 1981, Paris.</p>

Deductive Semantics of RTPA

2011 ◽  
pp. 254-291
Author(s):  
Yingxu Wang
Keyword(s):  
Programming Languages ◽  
Large Scale ◽  
Formal Semantics ◽  
Semantic Theory ◽  
Software Systems ◽  
Software Comprehension ◽  
Support Tool ◽  
Semantic Function ◽  
Semantics Of Programming Languages ◽  
Finite Set

Deductive semantics is a novel software semantic theory that deduces the semantics of a program in a given programming language from a unique abstract semantic function to the concrete semantics embodied by the changes of status of a finite set of variables constituting the semantic environment of the program. There is a lack of a generic semantic function and its unified mathematical model in conventional semantics, which may be used to explain a comprehensive set of programming statements and computing behaviors. This article presents a complete paradigm of formal semantics that explains how deductive semantics is applied to specify the semantics of real-time process algebra (RTPA) and how RTPA challenges conventional formal semantic theories. Deductive semantics can be applied to define abstract and concrete semantics of programming languages, formal notation systems, and large-scale software systems, to facilitate software comprehension and recognition, to support tool development, to enable semantics-based software testing and verification, and to explore the semantic complexity of software systems. Deductive semantics may greatly simplify the description and analysis of the semantics of complicated software systems specified in formal notations and implemented in programming languages.

Sign in / Sign up

Export Citation Format

Share Document