Filters








4,535 Hits in 4.5 sec

Foundations of Programming Languages

T. Clement
1989 Science of Computer Programming  
The treatment of program correctness using axiomatic semantics is relatively brief, the emphasis being on the motivation of formal language definitions.  ...  The chapter concludes by proving the soundness of a Hoare-style axiomatic semantics and using it to prove the total correctness of some example programs.  ... 
doi:10.1016/0167-6423(89)90023-3 fatcat:jec6l4daqbhdbaevn6vomzujq4

Compiler verification meets cross-language linking via data abstraction

Peng Wang, Santiago Cuellar, Adam Chlipala
2014 Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications - OOPSLA '14  
The key technical innovation is a mixed operational and axiomatic semantics for the source language, with a built-in notion of abstract data types, such that compiled code interfaces with other languages  ...  We describe our Coq verification of a compiler for a high-level language, such that the compiler correctness theorem allows us to derive partial-correctness Hoare-logic theorems for programs built by linking  ...  Bell, Lennart Beringer, Benjamin Delaware, Gregory Malecha, Benjamin Barenblat, Antonis Stampoulis and the anonymous reviewers for their feedback on earlier versions of this paper.  ... 
doi:10.1145/2660193.2660201 dblp:conf/oopsla/WangCC14 fatcat:r4sffqq5k5afllb3a2hbet3v3e

Compiler verification meets cross-language linking via data abstraction

Peng Wang, Santiago Cuellar, Adam Chlipala
2014 SIGPLAN notices  
The key technical innovation is a mixed operational and axiomatic semantics for the source language, with a built-in notion of abstract data types, such that compiled code interfaces with other languages  ...  We describe our Coq verification of a compiler for a high-level language, such that the compiler correctness theorem allows us to derive partial-correctness Hoare-logic theorems for programs built by linking  ...  Bell, Lennart Beringer, Benjamin Delaware, Gregory Malecha, Benjamin Barenblat, Antonis Stampoulis and the anonymous reviewers for their feedback on earlier versions of this paper.  ... 
doi:10.1145/2714064.2660201 fatcat:2rseu3zoxjes7ai7cdrl2tdafa

Page 2362 of Mathematical Reviews Vol. , Issue 81F [page]

1981 Mathematical Reviews  
{For the entire collection see MR 81e:68002.} Russell, Bruce 81f:68017 Correctness of the compiling process based on axiomatic semantics. Acta Inform. 14 (1980), no. 1, 1-20.  ...  “The essence of Morris’ advice was that a proof of compiler correctness should be a proof that a diagram of the form 81f:68018 source target language language compile L > T Y source target ( *) semantics  ... 

A survey of semantic description frameworks for programming languages

Yingzhou Zhang, Baowen Xu
2004 SIGPLAN notices  
., Compiler correctness using algebraic [Ørb1994] Ørbæk, P., OASIS: an optimizing action-based compiler operational semantics.  ...  ., On the construction of [WBB1993] Weber, S., Bloom, B. and Brown, G., Compiling Joy correct compiler backends: an ASM approach.  ... 
doi:10.1145/981009.981013 fatcat:aq23dovoqvdgzdo5xz7vclcnoe

DisBlue+: A distributed annotation-based C# compiler

Samir E. AbdelRahman, Amr M. AbdelLatif
2010 Egyptian Informatics Journal  
The proposed Blue+ annotation is based on axiomatic semantics to replace the if/loop constructs.  ...  Any current distributed compiler breaks the program into scattered disjoint pieces to speed up the compilation. However, these pieces cooperate synchronously and depend highly on each other.  ...  Each case was measured based on the number of axiomatic semantics (pre-conditions) that were coded.  ... 
doi:10.1016/j.eij.2010.06.001 fatcat:v5yftchghzdfjjgshaykjcfq2i

Extensible Extraction of Efficient Imperative Programs with Foreign Functions, Manually Managed Memory, and Proofs [chapter]

Clément Pit-Claudel, Peng Wang, Benjamin Delaware, Jason Gross, Adam Chlipala
2020 Lecture Notes in Computer Science  
By mixing and matching these pieces of logic, users can easily tailor extraction to their own domains and programs, getting maximum performance and ensuring correctness of the resulting assembly code.  ...  In addition to a small set of core definitions, our framework is a large, user-extensible collection of compilation rules each phrased to handle specific language constructs, code patterns, or data manipulations  ...  The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of DARPA  ... 
doi:10.1007/978-3-030-51054-1_7 fatcat:qwto3glvwrdgll6ffzzhvedmlq

Page 3224 of Mathematical Reviews Vol. , Issue 86g [page]

1986 Mathematical Reviews  
V. (4-LEED-C) 86g:68105 The axiomatic semantics of programs based on Hoare’s logic. Acta Inform. 21 (1984), no. 3, 293-320.  ...  Author summary: “A denotational semantics is given for a language for distributed programming based on communication (CSP).  ... 

Page 2954 of Mathematical Reviews Vol. , Issue 95e [page]

1995 Mathematical Reviews  
First, he studies the case of atomic ac- tions with fixed time stamps and gives a correct and complete axiomatization of bisimilar processes in the setting of ACP with such time stamps.  ...  “Natural operational semantics can be easily encoded in formal systems based on A-calculus type-checking, such as the Edinburgh logical framework.  ... 

References & bibliography [chapter]

1978 Lecture Notes in Computer Science  
C.B.Jones: "Formal Development of Correct Algorithms: An Example Based on Earley's Recogniser", ACM SIGPLAN /SIGACT Symp. on 'Proving Assertions about Programs', Las Cruces, Jan. 72, C.A.R.Hoare & P.Lauer  ...  D.A.Henderson: "The Binding Model: A Semantic Base for Modular Programming Systems", MIT (project MAC) Techn.Rept.No.TR-145, Feb.1975.  ... 
doi:10.1007/3-540-08766-4_14 fatcat:axryqtlzh5bmpdm4ljtivsc4a4

A Formal Verification Method of Compilation Based on C Safety Subset

Yu Tan, Dianfu Ma, Lei Qiao, Balakrishnan Nagaraj
2021 Wireless Communications and Mobile Computing  
On this axiom system, the semantic consistency verification of C grammar unit and target code pattern is completed by means of theorem proving, and the formal verification of the compiler is completed.  ...  In this paper, a compiler formal verification method based on safety C subsets is proposed.  ...  Acknowledgments The authors acknowledge the Natural Science Foundation of China (Grant: NSFC 61632005 and 62032004).  ... 
doi:10.1155/2021/8352267 fatcat:fh37nybzqvef5b36rjdz3sa5wy

Page 468 of Mathematical Reviews Vol. , Issue 89A [page]

1989 Mathematical Reviews  
The author gives an axiomatic approach to describing the syntax and semantics of flowchart algorithms.  ...  Verification of semantic properties of computations based on regional invariants. Soviet J. Comput. Systems Sci. 25 (1987), no. 3, 135-147; translated from Izv. Akad. Nauk SSSR Tekhn.  ... 

Page 2793 of Mathematical Reviews Vol. , Issue 81G [page]

1981 Mathematical Reviews  
Authors’ summary: “We discuss axiomatic and functional models of the semantics of structured programming.  ...  A semantic soundness theorem (based on a formal semantics for the language) states that well-type programs cannot ‘go wrong’ and a syntactic soundness theorem states that if W accepts a program then it  ... 

Page 3764 of Mathematical Reviews Vol. , Issue 86h [page]

1986 Mathematical Reviews  
In this framework the compilation process can be specified and verified as the representation of an algebraic data type and of some substitutions.  ...  This theory is based on the concept of alge- braic data types. The state of a program can be characterized by a set of axioms. Thus, it can be considered as an algebraic data type.  ... 

Towards Logic-Based Verification of JavaScript Programs [chapter]

José Fragoso Santos, Philippa Gardner, Petar Maksimović, Daiva Naudžiūnienė
2017 Lecture Notes in Computer Science  
In this position paper, we argue for what we believe is a correct pathway to achieving scalable symbolic verification of JavaScript based on separation logic.  ...  We highlight the difficulties imposed by the language, the current state-of-the-art in the literature, and the sequence of steps that needs to be taken.  ...  Maksimović was also partially supported by the Serbian Ministry of Education and Science through the Mathematical Institute of Serbian Academy of Sciences and Arts, projects ON174026 and III44006.  ... 
doi:10.1007/978-3-319-63046-5_2 fatcat:p4f27y5vczdlbprglrxzivbhsm
« Previous Showing results 1 — 15 out of 4,535 results