Towards the Hierarchical State Machine Oriented Proteus Systems Programming Language

In the spring of 1973 it was decided to implement the language BCPL on the experimental microprogrammable computer RIKKE-1 being constructed in this department. The language was chosen to be the systems programming language for RlKKE-1, one argurment being the possibility of transferring the Oxford Operating system OS 8 to RIKKE-1. This paper describes the design process for an internal representation of OCODE, the resulting machine, the emulator, and the assembler, and finally there is a discussion of our experiences of running the OCODE machine during the past 8 months. Some future analysis and possible modifications are mentioned.

Download Full-text

Gobra: Modular Specification and Verification of Go Programs

Computer Aided Verification - Lecture Notes in Computer Science ◽

10.1007/978-3-030-81685-8_17 ◽

2021 ◽

pp. 367-379

Author(s):

Felix A. Wolf ◽

Linard Arquint ◽

Martin Clochard ◽

Wytse Oortwijn ◽

João C. Pereira ◽

...

Keyword(s):

Distributed Systems ◽

Programming Language ◽

Message Passing ◽

Safety Data ◽

Separation Logic ◽

Data Race ◽

Static Verification ◽

Crash Safety ◽

Concurrent And Distributed Systems ◽

Systems Programming

AbstractGo is an increasingly-popular systems programming language targeting, especially, concurrent and distributed systems. Go differentiates itself from other imperative languages by offering structural subtyping and lightweight concurrency through goroutines with message-passing communication. This combination of features poses interesting challenges for static verification, most prominently the combination of a mutable heap and advanced concurrency primitives.We present Gobra, a modular, deductive program verifier for Go that proves memory safety, crash safety, data-race freedom, and user-provided specifications. Gobra is based on separation logic and supports a large subset of Go. Its implementation translates an annotated Go program into the Viper intermediate verification language and uses an existing SMT-based verification backend to compute and discharge proof obligations.

Download Full-text

Sound and Complete Type Inference for a Systems Programming Language

Programming Languages and Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-540-89330-1_21 ◽

2008 ◽

pp. 290-306

Author(s):

Swaroop Sridhar ◽

Jonathan S. Shapiro ◽

Scott F. Smith

Keyword(s):

Programming Language ◽

Type Inference ◽

Complete Type ◽

Systems Programming

Download Full-text

Formal Verification of a Subset of UML Diagrams

Handbook of Research on E-Services in the Public Sector ◽

10.4018/978-1-61520-789-3.ch002 ◽

2011 ◽

pp. 14-24

Author(s):

Allaoua Chaoui ◽

Okba Tibermacine ◽

Amer R. Zerek

Keyword(s):

Formal Verification ◽

Programming Language ◽

Formal Specification ◽

State Machine ◽

Declarative Programming ◽

Sequence Diagrams ◽

Uml Diagrams ◽

Approach Goals ◽

Formal Specification Language ◽

State Machine Diagram

We introduce an approach that deals with the verification of UML collaboration and sequence diagrams in respect to the objects internal behaviors which are commonly represented by state machine diagrams. The approach is based on the translation of theses diagrams to Maude specifications. In fact, Maude is a declarative programming language, an executable formal specification language, and also a formal verification system, which permit the achievement of the approach goals. We define in details the rules of translating UML diagrams elements into their corresponding Maude specifications. We present the algebraic structures that represent the OR-States and the AND-states in a state machine diagram, and the structure that represents the collaboration and the sequence diagrams. Also, we explain the mechanism of the execution and the verification of the translated specification, which is based on rewriting logics rules.

Download Full-text