Results 181 to 190 of about 512,676 (214)
Some of the next articles are maybe not open access.

The specification statement

ACM Transactions on Programming Languages and Systems, 1988
Dijkstra's programming language is extended by specification statements , which specify parts of a program “yet to be developed.” A weakest precondition semantics is given for these statements so that the extended language has a meaning as precise as the original.
openaire   +1 more source

Substrate specificity of a human-specific esterase

Analytical Biochemistry, 1973
Abstract A human species-specific esterase has been identified in tissues, cell cultures, and urine. It is the most slowly migrating (i.e., cathodal) of the esterase isoenzymes in agarose electrophoresis; it is not a choline estrase, a pseudocholine esterase, an acetyl phenylalanine-3-naphthyl esterase or N -benzoyl-arginine-3-naphthyl esterase ...
D, Munjal, N R, Rose
openaire   +2 more sources

Transformation of Lotos specifications to Estelle specifications

Proceedings Second IEEE Symposium on Computer and Communications, 2002
A technique for the automated transformation of a Lotos specification to an Estelle specification is presented. First, a restricted behaviour tree is constructed from the Lotos specification in a somewhat similar way to generating a reachability tree for a finite-state machine.
Hazem El-Gendy, Hoda Baraka
openaire   +1 more source

Specification of Nonmonotonic Reasoning

Journal of Applied Non-Classical Logics, 1996
Two levels of description of nonmonotonic reasoning are distinguished. For these levels semantical formalizations are given. The first Level is defined semantically by the notion of belief state frame, the second Level by the notion of reasoning frame. We introduce two specification languages to describe nonmonotonic reasoning at each of the Levels: (/)
Joeri Engelfriet, Jan Treur
openaire   +5 more sources

Specification of schedulers with algebraic specification techniques

1982
The specification of a class of single resource schedulers is presented. A class of these schedulers is regarded as a parameterized data type whose formal parameter is a scheduling strategy. The specification is given by using the concept of parameterization in algebraic techniques.
Kouichi Wada 0001   +3 more
openaire   +1 more source

Techniques for Partial Specification and Specification of Switching Systems

1991
This paper reports on results obtained by specifying the connection patterns within a small PBX using Z. We discuss techniques for specification of switching systems, including how to model the state space of a feature-rich switching system, how to use the schema calculus for organizing a complex operation set, and how to realize the potential benefits
Pamela Zave, Michael Jackson 0001
openaire   +1 more source

Specification

Minds and Machines, 2009
openaire   +1 more source

Formal Specification and Verification of Autonomous Robotic Systems

ACM Computing Surveys, 2020
Matt Luckcuck, , Louise A Dennis
exaly  

Home - About - Disclaimer - Privacy