Titlebook: Mathematics of Program Construction; 10th International C Claude Bolduc,Jules Desharnais,Béchir Ktari Conference proceedings 2010 The Edito

營(yíng)養(yǎng)品

書目名稱Mathematics of Program Construction影響因子(影響力)




書目名稱Mathematics of Program Construction影響因子(影響力)學(xué)科排名




書目名稱Mathematics of Program Construction網(wǎng)絡(luò)公開度




書目名稱Mathematics of Program Construction網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Mathematics of Program Construction被引頻次




書目名稱Mathematics of Program Construction被引頻次學(xué)科排名




書目名稱Mathematics of Program Construction年度引用




書目名稱Mathematics of Program Construction年度引用學(xué)科排名




書目名稱Mathematics of Program Construction讀者反饋




書目名稱Mathematics of Program Construction讀者反饋學(xué)科排名

KIN

冬眠

Process Algebras for Collective Dynamicsclude PEPA [3], EMPA [4], MoDeST [5] and IMC [6]. These formalisms retain the compositional structure of classical process algebras and the additional information captured within the model allows analysis to investigate additional properties such as dynamic behaviour and resource usage.

formula

On Automated Program Construction and Verification Gries and Hoare, it supports proof and refutation games with automated theorem provers, model search tools and computer algebra systems combined with “hidden” domain-specific algebraic theories that have been designed and optimised for automation. The feasibility of this approach is demonstrated th

同位素

stressors

臆斷

Subtyping, Declarativelyuctive definitions of non-trivial transitive inference systems: they cannot be “declarative”—as opposed to “algorithmic” or syntax-directed—because coinductive inference systems with an explicit rule of transitivity are trivial..We propose a solution to this problem. By using mixed induction and coi

insular

Compositional Action System Derivation Using Enforced Properties to program construction where the concrete implementation is derived from its specification — via a series of small refinements — using incomplete proofs to motivate changes to the program. Formalisation of our approach is provided by ., which restrict the traces of a program to those that satisfy

空氣傳播

Designing an Algorithmic Proof of the Two-Squares Theoremded Euclid’s algorithm. Rather than simply verifying the result—as it is usually done in the mathematical community—we use Euclid’s algorithm as an interface to . which numbers can be written as sums of two positive squares. The precise formulation of the problem as an algorithmic problem is the key

Infuriate