Laws of programming

Hoare, C. A. R.; Hayes, Ian J.; He, Jifeng; Morgan, Carroll; Roscoe, A. W.; Sanders, J. W.; Sørensen, Ib; Spivey, Justin M; Sufrin, Bernard

doi:10.1145/27651.27653

Cited by 327 publications

(131 citation statements)

References 7 publications

Supporting

Mentioning

130

Contrasting

Unclassified

Order By: Relevance

“…Refactorings like these occur frequently and we thus generalize them using a notation that follows the representation of programming laws [11,17]. Refactoring Extract Resource to Aspect -after, whose transformation template is shown shortly ahead, generalizes this transformation and has the purpose of extracting a single variant field, along with part of its usage, into an aspect.…”

Section: Refactoring Catalogmentioning

confidence: 99%

“…Programming laws [17,11], like refactorings, are transformation structures which preserve program consistence and behavior. In contrast, they are much simpler than most refactorings: they involve only localized program changes, and each one focuses on a specific language construct.…”

Section: Programming Lawsmentioning

confidence: 99%

“…Additionally, representing the refactorings as a composition of programming laws helps to better define the preconditions under which those refactorings are valid. For their simplicity, programming laws [17] are suitable for this. A complete formal proof requires establishing the validity of the laws with respect to a formal semantics, which is still on going work [12].…”

Section: Deriving Refactoringsmentioning

confidence: 99%

“…Accordingly, the laws compose in the sense that their consecutive application is equivalent to a coarse-grained transformation (refactoring). Indeed, such composition is not as flexible as in Hoare's laws [17]-which can be applied to open programs-, but has sufficed to derive the refactorings.…”

Section: Deriving Refactoringsmentioning

confidence: 99%

“…However, there still needs to be a potentially high investment for this first increment and, although we do not need to have all core assets in hand before starting to build products, all such assets need to be designed and ing preconditions (a frequently subtle issue) are more clearly organized and not tangled with the transformation itself. Furthermore, the refactorings can be systematically derived from more elementary and simpler programming laws [11,17]. These laws are appropriate because they are considerably simpler than most refactorings, involving only localized program changes, with each one focusing on a specific language construct.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Extracting and Evolving Code in Product Lines with Aspect-Oriented Programming

Alves

Matos

Cole

et al. 2007

Transactions on Aspect-Oriented Software Development IV

View full text Add to dashboard Cite

Abstract. For some organizations, the proactive approach to product lines may be inadequate due to prohibitively high investment and risks. As an alternative, the extractive and the reactive approaches are incremental, offering moderate costs and risks, and therefore sometimes may be more appropriate. However, combining these two approaches demands a more detailed process at the implementation level. This paper presents a method and a tool for extracting a product line and evolving it, relying on a strategy that uses refactorings expressed in terms of simpler programming laws. The approach is evaluated with a case study in the domain of games for mobile devices, where variations are handled with aspect-oriented constructs.

show abstract

Section: Refactoring Catalogmentioning

confidence: 99%

Section: Programming Lawsmentioning

confidence: 99%

Section: Deriving Refactoringsmentioning

confidence: 99%

Section: Deriving Refactoringsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Extracting and Evolving Code in Product Lines with Aspect-Oriented Programming

Alves

Matos

Cole

et al. 2007

Transactions on Aspect-Oriented Software Development IV

View full text Add to dashboard Cite

show abstract

Software Verification and Validation

Kung

Zhu

2008

Wiley Encyclopedia of Computer Science and Engineering

View full text Add to dashboard Cite

Software verification and validation are important because software has been used in all sectors of our society. Today's software systems are extremely large, complex, and process billions of transactions a day in the financial, retailing, manufacturing, transportation, telecommunications, and many other sectors. Many software systems are embedded systems, real‐time systems, or mission‐critical systems. Failures of today's software systems are financially very costly, and politically not acceptable because the failures may incur recall of products, property damages, injury to human body, or even loss of human life. Therefore, software verification, validation, and testing have received increasing attention from academic research and industry.

show abstract

A process calculus SMrCaIT for IoT

Chen

Zhu

2023

J Software Evolu Process

View full text Add to dashboard Cite

With the rapid popularization of smart devices, the applications and technologies of the Internet of Things (IoT) are in high demand worldwide, especially in improving development efficiency and ensuring system quality, reliability, and security. Formal methods have been successfully used to specify, verify, and analyze software and hardware systems, effectively alleviating the above problems in these systems. However, most of the existing works mainly focus on the practical applications of IoT, and there is a lack of research on modeling and analyzing IoT systems from the perspective of formal methods. In this paper, we first propose a secure mobile real‐time process calculus for specifying and reasoning about IoT systems, called SMrCaIT, which supports not only value‐passing communication but also name‐passing communication. In addition, this calculus can strictly separate process actions and mobility modeling by providing parametric mobility models. Subsequently, we present the operational semantics of this calculus, in particular, the rules on how to secure channel communication by closing the scope of a channel and handling scope extrusion. Taking vehicle ad hoc network (VANET) as a case, the application details of SMrCaIT and its operational semantics are fully demonstrated. By using the rewrite engine Real‐Time Maude, we further implement SMrCaIT and its operational semantics and verify some properties of the VANET case to indicate the effectiveness of our calculus in real‐world scenes.

show abstract

Laws of programming

Cited by 327 publications

References 7 publications

Extracting and Evolving Code in Product Lines with Aspect-Oriented Programming

Extracting and Evolving Code in Product Lines with Aspect-Oriented Programming

Software Verification and Validation

A process calculus SMrCaIT for IoT

Contact Info

Product

Resources

About