This paper presents an algorithm for executing formal specifications, and a proof of the soundness of that algorithm. The algorithm executes specifications written in the model-based specification language SPECS-C++ by transforming such specifications to constraint programs. The generated programs use constraint satisfaction techniques to execute specifications written at a high level of abstraction. Denotational semantics techniques are used for both explaining the algorithm and for proving its soundness
AbstractThe process of converting formal specifications into valid implementations is central in the...
Abstract. We present a method for verifying properties of imperative programs by using techniques ba...
Using Martin-Löf's set theory as a programming logic one identifies specifications with sets and pro...
This paper presents an algorithm for executing formal specifications, and a proof of the soundness o...
We present a method using an extended logical system for obtaining "correct" programs from specifica...
We present simple and powerful generalized algebraic semantics for constraint logic programs that ar...
AbstractThis paper proposes the use of constraint logic to perform model checking of imperative, inf...
AbstractWe present simple and powerful generalized algebraic semantics for constraint logic programs...
This paper proposes the use of constraint logic to perform model checking of imperative, infinite-st...
We present a simple and powerful generalized algebraic semantics for constraint logic programs that ...
. We present a declarative specification method based on natural semantics which is suitable for th...
[Logics and Meanings of Programs] Specifying and Verifying and Reasoning about Programs
Many powerful specification languages are based on set theory, such as Z ([12]) and B ([1]) derived ...
Abstract. A problem for the development of constraint-based formalisms con-cerns (i) the maintainabi...
Formal program synthesis is concerned with deriving programs that are (formally) correct wrt their s...
AbstractThe process of converting formal specifications into valid implementations is central in the...
Abstract. We present a method for verifying properties of imperative programs by using techniques ba...
Using Martin-Löf's set theory as a programming logic one identifies specifications with sets and pro...
This paper presents an algorithm for executing formal specifications, and a proof of the soundness o...
We present a method using an extended logical system for obtaining "correct" programs from specifica...
We present simple and powerful generalized algebraic semantics for constraint logic programs that ar...
AbstractThis paper proposes the use of constraint logic to perform model checking of imperative, inf...
AbstractWe present simple and powerful generalized algebraic semantics for constraint logic programs...
This paper proposes the use of constraint logic to perform model checking of imperative, infinite-st...
We present a simple and powerful generalized algebraic semantics for constraint logic programs that ...
. We present a declarative specification method based on natural semantics which is suitable for th...
[Logics and Meanings of Programs] Specifying and Verifying and Reasoning about Programs
Many powerful specification languages are based on set theory, such as Z ([12]) and B ([1]) derived ...
Abstract. A problem for the development of constraint-based formalisms con-cerns (i) the maintainabi...
Formal program synthesis is concerned with deriving programs that are (formally) correct wrt their s...
AbstractThe process of converting formal specifications into valid implementations is central in the...
Abstract. We present a method for verifying properties of imperative programs by using techniques ba...
Using Martin-Löf's set theory as a programming logic one identifies specifications with sets and pro...
Add to ORKG