Books on software engineering methodologies talk about the significance and need for designing consistent and complete specifications during the requirement analysis and design stages of a software development cycle. There is, however, little (or at best very limited) discussion of methods for ensuring these structural properties of specifications. In this paper, we discuss methods for checking completeness of equational specifications. Some of these methods were earlier proposed in somewhat different form in the context of developing the so-called inductionless induction method for automating proofs by induction using completion procedures. These methods are implemented in our theorem prover
机译:某些在金融数学中出现的偏微分方程的完全规范
机译:灵活的工具完善了自动整理单元-可编程的机械去毛刺带来了灵活性和一致性,可实现更高效的自动整理过程
机译:Sdl2pml-用于根据SDL规范自动生成Promela模型的工具
机译:一个W-完整的交织公正规范
机译:用于扫描,表征和分析大型DNA序列数据集的自动化工具。
机译:自动化的Sanger分析管道(ASAP):一种以最小的用户干扰快速分析Sanger测序数据的工具
机译:使用方程式推理和LOTOS实现自动化(规范=实现)
机译:Omega完全等距交错规范。软件工程