Results 251 to 260 of about 268,099 (291)

Loop checking and the well-founded semantics

1995
Using a calculus of goals, we define the success and failure of a goal for propositional programs in the presence of loop checking. The calculus is sound with respect to the well-founded semantics; for finite programs, it is also complete. A Prolog-style proof search strategy for a modification of this calculus provides a query evaluation algorithm for
Vladimir Lifschitz, Norman McCain, Teodor C. Przymusinski, Robert F. Stärk   +3 more
openaire   +1 more source

Checking if controllers are stabilizing using closed-loop data

Proceedings of the 45th IEEE Conference on Decision and Control, 2006
Suppose an unknown plant is stabilized by a known controller. Suppose also that some knowledge of the closed-loop system is available and on the basis of that knowledge, the use of a new controller appears attractive, as may arise in iterative control and identification algorithms, and multiple-model adaptive control.
Alexander Lanzon, Andrea Lecchini, Arvin Dehghani, Brian D. O. Anderson   +3 more
openaire   +1 more source

Eliminating unnecessary array bounds checks in nests of loops

Proceedings of ICCI'93: 5th International Conference on Computing and Information, 2002
Out-of-bounds array references are a source of bugs in sequential and parallel code. A potential solution to the problem is the introduction of run time bounds checks on all array references. However, run time checking of every array reference can result in a good deal of overhead and therefore eliminating unnecessary array bounds checks is extremely ...
K. Psarris, D. Klappholz
openaire   +1 more source

Verification of CPS Based on Control Loop Using Model Checking

2018 25th Asia-Pacific Software Engineering Conference (APSEC), 2018
CPS (Cyber Physical System) includes a complicated architecture that spans cyber space and physical space. There are several relationships related to the transmission of data and energy and the control and monitoring of CPS components. Many control loops exist, and these control loops represent the cyclic relations of components based on the ...
Yoshitaka Aoki, Shinpei Ogata, Kazuki Kobayashi, Hiroyuki Nakagawa   +3 more
openaire   +1 more source

Study on Endless Loop Node Checking Algorithm for BOM

2009 Second International Conference on Intelligent Computation Technology and Automation, 2009
A phenomenon of endless loop node often appears in BOM management, which is that one of the child components of a part contains the part itself in the assembly relationship and can result in endless loop of BOM traversal while working out Material Requirements Planning.
openaire   +1 more source

Efficient Loop-Extended Model Checking of Data Structure Methods

2011
Many methods in data structures contain a loop structure on a collection type. These loops result in a large number of test cases and are one of the main obstacles to systematically test these methods. To deal with the loops in methods, in this paper, we propose a novel loop-extended model checking approach, abbreviated as LEMC, to efficiently test ...
Qiuping Yi, Jian Liu, Wuwei Shen
openaire   +1 more source

Model checking safety properties of servo-loop control systems

Proceedings International Conference on Dependable Systems and Networks, 2003
Presents the experiences of using a symbolic model checker to check the safety properties of a servo-loop control system. Symbolic model checking has been shown to be beneficial when the system under analysis can be modeled as a finite state machine. Servo-loop control systems are typically represented by differential equations (Laplace transforms)-not
openaire   +1 more source

Feedback Loops Guide AI to Proof Checking

Communications of the ACM
After decades of promise, techniques and technologies are coming together to make artificial intelligence better at checking mathematicians’ work.
openaire   +1 more source

Clause2Inv: A Generate-Combine-Check Framework for Loop Invariant Inference

Proceedings of the ACM on Software Engineering
Loop invariant inference is a fundamental, yet challenging, problem in program verification. Recent work adopts the guess-and-check framework, where candidate loop invariants are iteratively generated in the guess step and verified in the check step.
Weining Cao, Guangyuan Wu, Tangzhi Xu, Yuan Yao, Hengfeng Wei, Taolue Chen, Xiaoxing Ma   +6 more
openaire   +1 more source

Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism

Theoretical Computer Science, 2022
Thierry Coquand
exaly