529 Hits in 3.3 sec

Weak factor automata: the failure of failure factor oracles?

Loek Cleophas, Derrick G. Kourie, Bruce W. Watson
2014 South African Computer Journal  
In indexing of, and pattern matching on, DNA and text sequences, it is often important to represent all factors of a sequence. One efficient, compact representation is the factor oracle (FO).  ...  We combine the two ideas and directly construct a failure factor oracle (FFO) from a given sequence, in contrast to ex post facto transformation to an FDFA.  ...  The use of a failure factor oracle instead of a factor oracle changes the classified Backward Oracle Matching algorithm in small ways.  ... 
doi:10.18489/sacj.v53i0.199 fatcat:quriyhvdevf3hjyyqcx3ulhlwa

Fixed-Parameter Sensitivity Oracles [article]

Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J.A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger
2021 arXiv   pre-print
When queried with a set F of at most f edges of G, the oracle reports the answer to the Π-with the same parameter k-on the graph G-F, i.e., G deprived of F.  ...  We mainly design sensitivity oracles for the k-Path and the k-Vertex Cover problem.  ...  on k, or at least depending on a factor of the form f (k)no(1) .  ... 
arXiv:2112.03059v1 fatcat:ooac3rw4szh63icloztu7jdymm

Learning Communicating Automata from MSCs

Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker
2010 IEEE Transactions on Software Engineering  
practical feasibility of the approach.  ...  The key contribution is a generalization of Angluin's learning algorithm for synthesizing CFMs from MSCs.  ...  The first factor is the number of global states of A, whereas the second factor contributes the number of possible channel contents (|Msg| · |A| being the number of messages).  ... 
doi:10.1109/tse.2009.89 fatcat:5mbmadir6rdaxp5nodnwp36o7m

Automated Steering of Model-Based Test Oracles to Admit Real Program Behaviors

Gregory Gay, Sanjai Rayadurgam, Mats P. E. Heimdahl
2017 IEEE Transactions on Software Engineering  
As emphasized in Section 3.3, the selection of an appropriate set of constraints in likely a crucial factor in the success or failure of steering.  ...  1 a number of additional factors both internal and external to the system.  ...  A test oracle consists of oracle information and an oracle procedure. -Oracle Information-The data used by the oracle to judge the behavior of the system under test.  ... 
doi:10.1109/tse.2016.2615311 fatcat:iholcljqenbcnjs3lklzdpg6aq

History-Register Automata

Radu Grigore, Nikos Tzevelekos, Thomas Schwentick
2016 Logical Methods in Computer Science  
We show that the combination of consumption and reset capabilities renders the automata powerful enough to imitate counter machines, and yields closure under all regular operations apart from complementation  ...  HRAs extend the expressiveness of previous approaches and bring us to the limits of decidability for reachability checks.  ...  LOGICAL The freshness oracle of FRAs administers the automata with perhaps too restricted an access to the full history of the computation: it allows them to detect name freshness, but not non-freshness  ... 
doi:10.2168/lmcs-12(1:7)2016 fatcat:cv7prjotwjfylmi6qousqzarwi

History-Register Automata [chapter]

Nikos Tzevelekos, Radu Grigore
2013 Lecture Notes in Computer Science  
As we show in this paper, history-register automata fit very well inside the big picture of automata over infinite alphabets (cf.  ...  This confluence of different methodologies is exciting and encourages the development of stronger automata for a wider range of verification tasks, and just such an automaton we examine herein.  ...  The freshness oracle of FRAs administers the automata with perhaps too restricted an access to the full history of the computation: it allows them to detect name freshness, but not non-freshness.  ... 
doi:10.1007/978-3-642-37075-5_2 fatcat:4vjboy3ncffbzmidi2p24td2sy

Extracting Automata from Recurrent Neural Networks Using Queries and Counterexamples [article]

Gail Weiss and Yoav Goldberg and Eran Yahav
2020 arXiv   pre-print
We do this using Angluin's L* algorithm as a learner and the trained RNN as an oracle.  ...  Our technique efficiently extracts accurate automata from trained RNNs, even when the state vectors are large and require fine differentiation.  ...  Acknowledgments The research leading to the results presented in this paper is supported by the European Union's Seventh Framework Programme (FP7) under grant agreement no. 615688 (PRIME), The Israeli  ... 
arXiv:1711.09576v4 fatcat:y57bs42rprbnlf6klol3crcrj4

Testing Real-Time Embedded Systems using Timed Automata based approaches

M. Saeed AbouTrab, Michael Brockway, Steve Counsell, Robert M. Hierons
2013 Journal of Systems and Software  
This research addresses the problem of testing RTESs from Timed Automata (TA) specification by the following.  ...  The selection of which set is most appropriate for a System Under Test (SUT) can be decided by the tester according to the system type, time specified for the testing process and its budget.  ...  We denote W AB as the preference of the factor A with respect to the factor B and (1/ W AB ) as the preference of the factor B with respect to the factor A where A and B belong to the same decision criterion  ... 
doi:10.1016/j.jss.2012.12.030 fatcat:udaob3g2xnaolmi7qivauwpkau

Engineering with Logic

Steve Bishop, Matthew Fairbairn, Hannes Mehnert, Michael Norrish, Tom Ridge, Peter Sewell, Michael Smith, Keith Wansbrough
2018 Journal of the ACM  
to permit the required implementation variation) and to test whether these specifications and the implementations correspond with specifications that are executable as test oracles.  ...  We developed post hoc specifications of TCP, UDP, and the Sockets API, both of the service that they provide to applications (in terms of TCP bidirectional stream connections) and of the internal operation  ...  ACKNOWLEDGMENTS We thank Jon Crowcroft and Tim Griffin for helpful comments, Robert Watson and George Neville-Neil for discussions of FreeBSD and DTrace, many members of the Laboratory, especially Piete  ... 
doi:10.1145/3243650 fatcat:757h4fuegvclbm4qjpxuckaofe

Solving Stochastic Nonlinear Resource Allocation Problems Using a Hierarchy of Twofold Resource Allocation Automata

Ole-Christoffer Granmo, B. John Oommen
2010 IEEE transactions on computers  
This paper presents a completely new online Learning Automata (LA) system, namely the Hierarchy of Twofold Resource Allocation Automata (H-TRAA).  ...  The decentralized Learning Automata Knapsack Game (LAKG) was recently proposed for solving one such class of problems, namely the class of Stochastic Nonlinear Fractional Knapsack Problems.  ...  ACKNOWLEDGMENTS The work of B. John Oommen was partially supported by the Natural Sciences and Engineering Research Council of Canada.  ... 
doi:10.1109/tc.2009.189 fatcat:xestx6vupfgstafqkwzcna5ypu

A reversible system based on hybrid toggle radius-4 cellular automata and its application as a block cipher [article]

Everton R. Lira, Heverton B. de Macêdo, Danielli A. Lima, Leonardo Alt, Gina M. B. Oliveira
2021 arXiv   pre-print
Finally, the cryptographic robustness of HCA is empirically evaluated through several tests, including avalanche property compliance and the NIST randomness suite.  ...  The dynamical system described herein uses a hybrid cellular automata (CA) mechanism to attain reversibility, and this approach is adapted to create a novel block cipher algorithm called HCA.  ...  So, even if a rule with a weakness similar to rule 30 was to be used in part of the process, it would not be the only applied rule.  ... 
arXiv:2106.04777v1 fatcat:ulasjlhnf5bkxd5esd2mghhfti

Page 810 of Mathematical Reviews Vol. , Issue 86b [page]

1986 Mathematical Reviews  
Bagchi [Amitava Bagchi], On the mean weight balance factor of binary trees (pp. 419-434); P. Gupta [Phalguni Gupta] and G. P.  ...  failures (pp. 329-339); Jean-Claude Laprie, Trustable evaluation of com- puter systems dependability (pp. 341-360); J.  ... 

Asynchronous failure detectors

Alejandro Conrejo, Nancy Lynch, Srikanth Sastry
2012 Proceedings of the 2012 ACM symposium on Principles of distributed computing - PODC '12  
We introduce the notion of a failure detector being representative of a problem to capture the idea that some problems encode the same information about process crashes as their weakest failure detectors  ...  Failure detectors -oracles that provide information about process crashes -are an important abstraction for crash tolerance in distributed systems.  ...  Examples of AFDs Here, we specify some of the failure detectors that are most widely used and cited in literature, as AFDs. The Leader Election Oracle.  ... 
doi:10.1145/2332432.2332482 dblp:conf/podc/ConrejoLS12 fatcat:iypf6oanmff4zlxze4qb43oqma

Interface protocol inference to aid understanding legacy software components

Kousar Aslam, Loek Cleophas, Ramon Schiffelers, Mark van den Brand
2020 Journal of Software and Systems Modeling  
For this purpose, we present an approach to infer the interface protocols of software components from the behavioral models of those components, learned by a blackbox technique called active (automata)  ...  behavior during the maintenance activities of the components.  ...  Ministry of Economic Affairs, ESI (part of TNO) and ASML Netherlands B.V., carried out as part of the TKI project 'Transposition.'  ... 
doi:10.1007/s10270-020-00809-2 fatcat:lyb6dujhyrecrj3lzenkqlm2mu

Towards Constraint Logic Programming over Strings for Test Data Generation [article]

Sebastian Krings, Joshua Schmidt, Patrick Skowronek, Jannik Dunkelau, Dierk Ehmke
2019 arXiv   pre-print
In order to properly test software, test data of a certain quality is needed.  ...  At the same time, existing tools for test data generation are often limited.  ...  Here, both solvers scale worse: CLPQS scales with a factor of 47, whereas ConString takes 50 times as long as for generating 10,000 IBANs instead of the expected factor of 10.  ... 
arXiv:1908.10203v1 fatcat:3skq73xnpvd4hjenqpcaj4s7bu
« Previous Showing results 1 — 15 out of 529 results