作为模态逻辑的继承，与数理逻辑的又一外延，时态逻辑断言推理则有效地解决这方面出现的难题。
As is inherited from modal logic and another extension of mathematic logic, temporal logic assertion inference can solve such problems.
在实例的应用程序中，可以使用更复杂的逻辑来收集断言的用户标识。
In actual applications, there would be a more complex logic to collect the user identity for assertion.
恰恰相反，这是一种略带威胁口吻的断言：我说的是对的，逻辑站在我这一边。
Instead it is a slightly threatening way of asserting: I'm right and I have logic on my side.
实际上，策略表达式只是使用一个尖括号格式的逻辑表达式，断言是子句。
Policy expressions really are just logic expressions using a pointy-bracket format, with assertions as clauses.
这种方法是纠缠的代码的一个活生生的例子：它混合了业务逻辑代码与断言所需的非功能代码。
This approach is a vivid example of tangled code: it mixes business-logic code with the nonfunctional code that assertions require.
使用断言捕获代码中的逻辑错误。
实际上，策略表达式只是使用一个尖括号格式的逻辑表达式，断言是子句。
Policy expressions really are just logic expressions using a pointy - bracket format, with assertions as clauses.
也有特殊的断言，通过注册或者在失败的框架下，没有执行逻辑测试。
There are also special "assertions" for registering a pass or fail with the framework without performing a logical test.
在写入操作结尾，写入字线被去断言，允许交叉耦合的反相器(40)正常工作并且保持存储节点(SN)的逻辑状态。
At the end of the write operation, the write word line is de-asserted, allowing the cross-coupled inverters (40) to function normally and hold the logic state of the storage node (SN).
可以在根据程序逻辑必须为真的条件上设置断言。
You can set an assertion on a condition that must be true according to the logic of your program.
这种逻辑公式的结构是有序二元对，第一元是断言；第二元是对应于这个断言的可定义集或不可定义域集的近似集。
The logical formulas are an ordered binary pair, the first element is an assertion and the second is a definable domain or approximations of undefinable domain corresponding to the assertion.
这种逻辑公式的结构是有序二元对，第一元是断言；第二元是对应于这个断言的可定义集或不可定义域集的近似集。
The logical formulas are an ordered binary pair, the first element is an assertion and the second is a definable domain or approximations of undefinable domain corresponding to the assertion.
应用推荐