AbstractWe describe a language of specified programs devised to form a basis for a system for the development of provably-correct programs. A specified program, as introduced by Blikle and then developed in this paper, consists of statements and declarations (in our language these are standard sequential, conditional and loop statements, blocks with local variables and possibly recursive procedures and functions) interleaved with local assertions sufficient to prove the global correctness of the program. This requirement forces us to adopt the philosophy that all the properties of program objects we use in our programs must be explicitly stated in specifications
In this paper, we give a denotational semantics of imperative programming languages as a CafeOBJ beh...
We present a general framework (a programming calculus) for the specification, verification and synt...
We present language-independent formal methods that are parameterized by the operational semantics o...
AbstractWe describe a language of specified programs devised to form a basis for a system for the de...
Program analysis and specialisation for declarative languages have been subjects of active research ...
Existing refinement calculi provide frameworks for the stepwise development of imperative programs f...
A new technique for specifying and verifying concurrent programs is presented. A specification lang...
A programming language system which enables a programmer to create his own constructs for the descri...
The refinement calculus provides a framework for the stepwise development of imperative programs fro...
Using Martin-Löf's set theory as a programming logic one identifies specifications with sets and pro...
Programming language implementations bridge the gap between what the program developer sees and unde...
We present a system for representing programs as proofs, which combines features of classical and co...
AbstractA uniform treatment of specifications, programs, and programming is presented. The treatment...
Most dependently-typed programming languages either require that all expressions terminate (e.g. Coq...
This paper demonstrates that design and implementation of languages for a specific domain can be don...
In this paper, we give a denotational semantics of imperative programming languages as a CafeOBJ beh...
We present a general framework (a programming calculus) for the specification, verification and synt...
We present language-independent formal methods that are parameterized by the operational semantics o...
AbstractWe describe a language of specified programs devised to form a basis for a system for the de...
Program analysis and specialisation for declarative languages have been subjects of active research ...
Existing refinement calculi provide frameworks for the stepwise development of imperative programs f...
A new technique for specifying and verifying concurrent programs is presented. A specification lang...
A programming language system which enables a programmer to create his own constructs for the descri...
The refinement calculus provides a framework for the stepwise development of imperative programs fro...
Using Martin-Löf's set theory as a programming logic one identifies specifications with sets and pro...
Programming language implementations bridge the gap between what the program developer sees and unde...
We present a system for representing programs as proofs, which combines features of classical and co...
AbstractA uniform treatment of specifications, programs, and programming is presented. The treatment...
Most dependently-typed programming languages either require that all expressions terminate (e.g. Coq...
This paper demonstrates that design and implementation of languages for a specific domain can be don...
In this paper, we give a denotational semantics of imperative programming languages as a CafeOBJ beh...
We present a general framework (a programming calculus) for the specification, verification and synt...
We present language-independent formal methods that are parameterized by the operational semantics o...