An Axiomatic Basis for Computer Programming

Hoare, C. A. R.

doi:10.1007/978-3-642-48354-7_17

Cited by 170 publications

(254 citation statements)

References 3 publications

Supporting

Mentioning

250

Contrasting

Unclassified

Order By: Relevance

“…The idea of using formal descriptions of interfaces to prove the correctness of programs has been studied for the past 40 years. Among the earliest works, we mention the ones from Floyd [Floyd, 1967] and Hoare [Hoare, 1969], as well as an interesting essay from Dijkstra [Dijkstra, 1976]. An extensive review of previous work and approaches can be found in [Tripakis et al, 2011].…”

Section: Contractsmentioning

confidence: 99%

CSL4P: A Contract Specification Language for Platforms

Pinto¹,

Sangiovanni‐Vincentelli

2017

Syst Eng

View full text Add to dashboard Cite

The contract‐based design formalism supports compositional design and verification, and generalizes many other languages where components are defined in terms of their assumptions and guarantees. Most languages and tools for contract‐based design provide constructs to define, instantiate, and connect contracts, but fall short in capturing families of potential architectures in a flexible way. This article presents a Contract‐Based Specification Language for Platforms (CSL4P). A platform comprises a set of contract types and a set of constraints called rules. Contract types can be instantiated and connected to form platform instances. While the meaning of composition is predefined in most languages, composition rules are used in CSL4P to provide a finer control on the semantics of interconnections. In addition, the separation of contract types from rules allows users of CSL4P to define different platforms out of the same set of components. This article describes syntax and semantics of the language, a development environment, which includes a compiler and a verification back‐end, and an application example.

show abstract

Section: Contractsmentioning

confidence: 99%

CSL4P: A Contract Specification Language for Platforms

Pinto¹,

Sangiovanni‐Vincentelli

2017

Syst Eng

View full text Add to dashboard Cite

show abstract

“…• Database design • Early user involvement recognized as Critical Success Factor • Functional decomposition and rules for defining modularity • Early formal methods defined (Hoare 1969) • Software lifecycles first conceived (Royce 1970) Databases. MBSE, with its lifecycle longitudinal objectives, relies heavily on information repositories, which in turn owe their sophistication to nearly 50 years as a maturing capability based on the earliest databases (Bachman 1969, Dodd 1969.…”

Section: The 1960'smentioning

confidence: 99%

4.6.1 A historical perspective of MBSE with a view to the future

Haskins

2011

INCOSE International Symp

View full text Add to dashboard Cite

Model-based engineering has been a topic of discussion for over twenty years; Model-based systems engineering (MBSE) has been an INCOSE initiative since 2006. For the third international conference on MBSE held September 2010, the author researched the background of MBSE from a historical perspective to identify the emergent timeline and to recognize the work that has lead to the current situation. This perspective can be used to understand the barriers to adoption, the research that remains, and to establish a reasonable expectation of the path ahead for realizing the full potential of MBSE.

show abstract

“…The WHILE programming language has been studied with or without a name as the simplest form of imperative programming since 1969. 29 It has 3 simple syntactic elements, ie, assignments, conditional actions (if … then blocks), and while loops.…”

Section: While Programsmentioning

confidence: 99%

Universality and prediction in business rules

Wang

Marie

et al. 2018

Computational Intelligence

View full text Add to dashboard Cite

Business rules (BR) have the form ⟨if condition then action⟩. A BR program, which can be executed by means of an interpreter, is a sequence of business rules. Motivated by International Business Machines use cases, we look at the problem of setting parameter values in a given BR program so it will achieve a given average goal over all possible instances. We explore the following fundamental question: Is there a general learning algorithm, which addresses this issue? We prove the answer is negative. On the positive side, we derive operational semantics for BR programs. As a proof of concept, we show empirically that these can be used to detect potential nontermination situations.

show abstract

An Axiomatic Basis for Computer Programming

Cited by 170 publications

References 3 publications

CSL4P: A Contract Specification Language for Platforms

CSL4P: A Contract Specification Language for Platforms

4.6.1 A historical perspective of MBSE with a view to the future

Universality and prediction in business rules

Contact Info

Product

Resources

About