When a formal specification of requirements is presented as a logical theory, symbolic animation of the theory can assist with validation. An animator displays a logical model of the formal specification. the authors ...
详细信息
When a formal specification of requirements is presented as a logical theory, symbolic animation of the theory can assist with validation. An animator displays a logical model of the formal specification. the authors show how minimal models can be derived from a tableau proof system. Examples illustrate the use of animation with a simple database and its use for validating specifications in the Modal Action logic of the UK Alvey Forest Project.< >
the authors give a short overview of the B theorem prover and report on its experimental evaluation. they describe the application of B to control VDM developments and illustrate this by means of excerpts from a case ...
详细信息
the authors give a short overview of the B theorem prover and report on its experimental evaluation. they describe the application of B to control VDM developments and illustrate this by means of excerpts from a case study. this work results in a formal description of the logical framework of VDM and opens perspectives for the reuse of software developments.< >
the authors present a methodology for developing large modular software, in which the modules may exist and interact while at different development stages. Each module may be either fully abstract (i.e., an algebraic ...
详细信息
the authors present a methodology for developing large modular software, in which the modules may exist and interact while at different development stages. Each module may be either fully abstract (i.e., an algebraic specification), fully concrete (in which case computations are run directly in the object code) or anywhere in the middle. In the proposed approach, the authors consider executable specifications in which axioms are Horn clauses built over equations or predicates, mixed evaluation with Horn clauses, and computing goals using logic computation rules. For the 'concrete' parts, examples are developed in Ada. An essential aspect of this approach is that prototyping may be performed at every moment, whatever the state of the different modules. this introduces the usual advantages of running a prototype (debug, test, conformity to the requirements, etc.), without the usual drawbacks: having to program stubs and drivers, having to care about the evolution of the module interfaces, etc. the methodology allows for both locally top-down and bottom-up development strategies and stimulates systematic stepwise refinement schemes.< >
the following topics are dealt with: array processing;pipelined CPUs;caches and registers;LISP machines;special-purpose parallel processors;multiprocessors;uniprocoessors;logicprogramming machines;commercial multipro...
详细信息
ISBN:
(纸本)0818606347
the following topics are dealt with: array processing;pipelined CPUs;caches and registers;LISP machines;special-purpose parallel processors;multiprocessors;uniprocoessors;logicprogramming machines;commercial multiprocessors;data retrieval architectures;multiprocessor issues;systolic arrays;data flow and reduction;interconnection networks;and multiprocessor performance. 52 papers were presented of which 50 are published in full in the present proceedings, and 1 as digest only. Abstracts of individual papers can be found under the relevant classification codes in this or other issues.
the proceedings contain 51 papers. the special focus in this conference is on Automata, Languages and programming. the topics include: A completeness theorem for recursively defined types;categorical combinatory logic...
ISBN:
(纸本)9783540156505
the proceedings contain 51 papers. the special focus in this conference is on Automata, Languages and programming. the topics include: A completeness theorem for recursively defined types;categorical combinatory logic;towards a uniform topological treatment of streams and functions on streams;infinite streams and finite observations in the semantics of uniform concurrency;imposed-functional dependencies inducing horizontal decompositions;characterization of high level tree transducers;ambiguity and transcendence;a fast algorithm for polygon containment by translation;linear and branching structures in the semantics and logics of reactive systems;deterministic and Las Vegas primality testing algorithms;efficient algorithms for graphic matroid intersection and parity;operational semantics for order-sorted algebra;a universal domain technique for profinite posets;a simple proof of the Skolem-Mahler-Lech theorem;On complete problems for NP∩CoNP;an algebraic theory of fair asynchronous communicating processes;hoare's logic for nondeterministic regular programs: A nonstandard completeness theorem;powerdomains as algebraic lattices preliminary report;random generation of combinatiorial structures from a uniform distribution;about rational sets of factors of a bi-infinite word;do rational equivalence relations have regular cross-sections?;on probabilistic time and space;the nearest neighbor problem on bounded domains;routing through a generalized switchbox;on k-repetition free words generated by length uniform morphisms over a binary alphabet;every commutative quasirational language is regular;a probabilistic distributed algorithm for set intersection and its analysis;distributed algorithms in synchronous broadcasting networks;a context dependent equivalence between processes;lower bounds by kolmogorov-complexity;a fair protocol for signing contracts;Applications of an infinite squarefree CO-CFL.
暂无评论