Results 11 to 20 of about 268,099 (291)

Inferring Loop Invariants by Mutation, Dynamic Analysis, and Static Checking [PDF]

IEEE Transactions on Software Engineering, 2015
Verifiers that can prove programs correct against their full functional specification require, for programs with loops, additional annotations in the form of loop invariants---propeties that hold for every iteration of a loop. We show that significant loop invariant candidates can be generated by systematically mutating postconditions; then, dynamic ...
Galeotti, J.P., Furia, C.A., May, E., Fraser, G., Zeller, A.   +4 more
openaire   +6 more sources

Loop checking in partial deduction

The Journal of Logic Programming, 1993
Although partial evaluation dates back to the 1970s, and was introduced into logic programming in the early 1980s, the topic only recently has attracted more substantial attention. In the framework of \textit{J. W. Lloyd} and \textit{J. C. Shepherdson} [J. Log. Program. 11, No. 3/4, 217-242 (1991; Zbl 0741.68030)], partial deduction, as it is called in
openaire   +4 more sources

An analysis of loop checking mechanisms for logic programs

Theoretical Computer Science, 1991
All methods of detecting divergence in computations of logic programs have been based on excluding some kinds of repetitions by so called loop checking. Loop checking mechanisms are systematically studied by considering their soundness, completeness and relative strength.
Bol, Roland N., Apt, Krzysztof R., Klop, Jan Willem   +2 more
openaire   +4 more sources

A Cuckoo Filter Modification Inspired by Bloom Filter [PDF]

AUT Journal of Electrical Engineering, 2019
Probabilistic data structures are so popular in membership queries, network applications, and so on. Bloom Filter and Cuckoo Filter are two popular space efficient models that incorporate in set membership checking part of many important protocols.
Hananeh Sasaniyan Asl, Behzad Mozaffari Tazeh kand, Mir Javad Musevi niya   +2 more
doaj   +1 more source

Termination of derivations for minimal tense logic

Lietuvos Matematikos Rinkinys, 2009
It is known that loop checking and backtracking are extensively used in various non-classical logics. An efficient loop checking is obtained using a technique based on histories.
Regimantas Pliuškevičius
doaj   +1 more source

Proving Safety with Trace Automata and Bounded Model Checking [PDF]

, 2014
Loop under-approximation is a technique that enriches C programs with additional branches that represent the effect of a (limited) range of loop iterations.
A. Finkel, A.V. Aho, D. Kroening, D. Kroening, D. Kroening, D. Kroning, E. Clarke, G. Nelson, H. Hojjat, I. Dillig, K.L. McMillan, L. Kovács, L. Moura de, M. Bozga, M. Heizmann, P. Schrammel, V. D’Silva   +16 more
core   +2 more sources

Loop checking and negation [PDF]

The Journal of Logic Programming, 1991
AbstractIn this paper we extend the concept of loop checking from positive programs (as described in [1]) to locally stratified programs. Such an extension is not straightforward: the introduction of negation requires a (re)consideration of the choice of semantics, the description of a related search space, and new soundness and completeness results ...
openaire   +1 more source

Model Checking for Closed-Loop Robot Reactive Planning

Electronic Proceedings in Theoretical Computer Science, 2023
In this paper, we show how model checking can be used to create multi-step plans for a differential drive wheeled robot so that it can avoid immediate danger. Using a small, purpose built model checking algorithm in situ we generate plans in real-time in a way that reflects the egocentric reactive response of simple biological agents.
Chandler, Christopher, Porr, Bernd, Miller, Alice, Lafratta, Giulia   +3 more
openaire   +2 more sources

Grouping based calculus for propositional linear temporal logic

Lietuvos Matematikos Rinkinys
In this paper, the authors research the problem of loops in linear temporal logic PLTL. The task involves defining the standard rule application process for the derivation procedure (as used in [4] and [5]), determining and proving properties for the ...
Kostas Ragauskas, Adomas Birštunas
doaj   +3 more sources

Efficient Enumeration of Higher Order Algebraic Structures

IEEE Access, 2020
Algebraic structures are widely studied mathematical structures in abstract algebra. Enumerating higher order algebraic structures is a computationally intensive task due to large number of possible permutations and the presence of many symmetrically ...
Majid Ali Khan
doaj   +1 more source