5,569 Hits in 5.2 sec

Inferring Temporal Properties of Finite-State Machine Models with Genetic Programming

Daniil Chivilikhin, Ilya Ivanov, Anatoly Shalyto
2015 Proceedings of the Companion Publication of the 2015 on Genetic and Evolutionary Computation Conference - GECCO Companion '15  
The paper presents a genetic programming based approach for inferring general form Linear Temporal Logic properties of finite-state machine models.  ...  Candidate properties are evaluated using several fitness functions, therefore multiobjective evolutionary algorithms are used. The feasibility of the approach is demonstrated by two examples.  ...  Such specifications are often written for finite-state machine (FSM) models of software. Having a model and complimentary temporal properties is essential for formal verification.  ... 
doi:10.1145/2739482.2768475 dblp:conf/gecco/ChivilikhinIS15 fatcat:3urjrhquzvhdfjiu54zfob5gve

Inferring automata-based programs from specification with mutation-based ant colony optimization

Daniil Chivilikhin, Vladimir Ulyantsev
2014 Proceedings of the 2014 conference companion on Genetic and evolutionary computation companion - GECCO Comp '14  
A recent algorithm for learning finitestate machines (FSMs) MuACOsm is applied to the problem of inferring extended finite-state machine (EFSM) models from behavior examples (test scenarios) and temporal  ...  In this paper we address the problem of constructing correctby-design programs with the use of the automata-based programming paradigm.  ...  Acknowledgements This work was financially supported by the Government of Russian Federation, Grant 074-U01, and also partially supported by RFBR, research project No. 14-07-31337 ìîë_à. REFERENCES  ... 
doi:10.1145/2598394.2598446 dblp:conf/gecco/ChivilikhinU14 fatcat:naliu5f3jzfstb4lfh5ny73xha

A semantics driven temporal verification system [chapter]

G. D. Gough, H. Barringer
1988 Lecture Notes in Computer Science  
SMG transforms programs written in user-definable languages to suitable finite state models, thus enabling fast verification of temporal properties of the input program.  ...  We present an overview of SMG, a generic state machine generator, which interfaces to various temporal logic model checkers and provides a practical generic temporal verification system.  ...  This program is then compiled into a state machine with 32 states and we can verify that the program has the required mutual exclusion property using a temporal logic model checker.  ... 
doi:10.1007/3-540-19027-9_2 fatcat:okuk3f5cnzamtf7out7kqp25li

Learning Concise Models from Long Execution Traces [article]

Natasha Yogananda Jeppu, Tom Melham, Daniel Kroening, John O'Leary
2020 arXiv   pre-print
models of system-level behaviour have applications in design exploration, analysis, testing and verification.  ...  We describe a new algorithm for automatically extracting useful models, as automata, from execution traces of a HW/SW system driven by software exercising a use-case of interest.  ...  We thank Daniel Bristot for his help with the RT Linux Kernel.  ... 
arXiv:2001.05230v3 fatcat:m3sfunqbobcdvhmb3rgieyfk7i

Model Learning and Model-Based Testing [chapter]

Bernhard K. Aichernig, Wojciech Mostowski, Mohammad Reza Mousavi, Martin Tappler, Masoumeh Taromirad
2018 Lecture Notes in Computer Science  
We distinguish the following categories of models: predicates and functions, and logical structures (such as Kripke structures, cf. the chapter on logic-based learning in this volume), finite state machines  ...  We present a survey of the recent research efforts in integrating model learning with model-based testing.  ...  The insightful comments of Karl Meinke and Neil Walkinshaw on an earlier draft led to improvements and are gratefully acknowledged. The  ... 
doi:10.1007/978-3-319-96562-8_3 fatcat:qrz24l2twrh5rp7ltpyxo4ooii

Subject index volumes 1–200

1999 Theoretical Computer Science  
machines, behavior of -, 2033 finite state machine, 233 finite state machines, 859 decomposability of nets into -, 579 products of -, 3070 finite state pattern matching machines, 497 transduction  ...  minimization of -, 786 with multiplicities, 227 finite state cellular automata, 2429 finite state control, 948 automata, 2625 finite state control automata choices of -, 2625 machines, 2012. 2033  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

Evolutionary computation in medicine: an overview

Carlos Andrés Peña-Reyes, Moshe Sipper
2000 Artificial Intelligence in Medicine  
We begin by outlining the basic workings of six types of evolutionary algorithms: genetic algorithms, genetic programming, evolution strategies, evolutionary programming, classifier systems, and hybrid  ...  This paper provides an overview of evolutionary computation as applied to problems in the medical domains.  ...  A finite state machine is a machine possessing a finite number of different internal states.  ... 
doi:10.1016/s0933-3657(99)00047-0 pmid:10767613 fatcat:zz5hgh56zvfzrluxkj2a7krm3a

New Research Perspectives in the Emerging Field of Computational Intelligence to Economic Modeling

2009 Annals of Dunarea de Jos University. Fascicle I : Economics and Applied Informatics  
Computational Intelligence (CI) is a new development paradigm of intelligentsystems which has resulted from a synergy between fuzzy sets, artificial neuralnetworks, evolutionary computation, machine learning  ...  It isimperative to know why these tools can be potentially relevant and effective toeconomic and financial modeling.  ...  We assume that the process operates like finite no deterministic state machine, while the expert system will operate like a finite deterministic state machine.  ... 
doaj:d4217323038e417b9860f7b97b1bed4b fatcat:i2w3y3te3faqbjqpf4sdmpmxi4

An Overview of FORCES: An INRIA Project on Declarative Formalisms for Emergent Systems [chapter]

Jesús Aranda, Gerard Assayag, Carlos Olarte, Jorge A. Pérez, Camilo Rueda, Mauricio Toro, Frank D. Valencia
2009 Lecture Notes in Computer Science  
The FORCES project aims at providing robust and declarative formalisms for analyzing systems in the emerging areas of Security Protocols, Biological Systems and Multimedia Semantic Interaction.  ...  [23, 24] ) have addressed automatic verification but in the context of finite-state CCP systems. Several applications of ntcc are, however, inherently infinite-state.  ...  Concurrent Constraint Programming (CCP) based calculi [1] are computational models that combine the operational view of process calculi with a declarative one based upon logic.  ... 
doi:10.1007/978-3-642-02846-5_44 fatcat:p5icbugmf5cilciphhqle7rhci

The Oracle Problem in Software Testing: A Survey

Earl T. Barr, Mark Harman, Phil McMinn, Muzammil Shahbaz, Shin Yoo
2015 IEEE Transactions on Software Engineering  
The literature on test oracles has introduced techniques for oracle automation, including modelling, specifications, contract-driven development and metamorphic testing.  ...  All forms of test oracles, even the humble human, involve challenges of reducing cost and increasing benefit.  ...  State transition systems model the output of a system they abstract either as a property of the states (the final state in the case of Moore machines) or the transitions traversed (as with Mealy machines  ... 
doi:10.1109/tse.2014.2372785 fatcat:kcsfqlofvnbtlmedd33z2yisq4

A survey of grammatical inference in software engineering

Andrew Stevenson, James R. Cordy
2014 Science of Computer Programming  
We introduce the theory of grammatical inference and review the state of the art as it relates to software engineering.  ...  Grammatical inference -used successfully in a variety of fields such as pattern recognition, computational biology and natural language processing -is the process of automatically inferring a grammar by  ...  Once k-tails are computed for each state, the finite state machine is generalized by merging states with identical k-tails until no more merges are possible.  ... 
doi:10.1016/j.scico.2014.05.008 fatcat:xwasotc745ekbhaoq2n43vrufm

Machine Learning and Formal Method (Dagstuhl Seminar 17351)

Sanjit A. Seshia, Zhu, Xianjin (Jerry), Andreas Krause, Susmit Jha, Marc Herbstritt
2018 Dagstuhl Reports  
This report documents the program and the outcomes of Dagstuhl Seminar 17351 "Machine Learning and Formal Methods".  ...  The seminar brought together practitioners and reseachers in machine learning and related areas (such as robotics) with those working in formal methods and related areas (such as programming languages  ...  The classical teaching dimension model, used to describe the sample complexity of learning from helpful teachers, assumes that the learner simply produces any hypothesis consistent with the data provided  ... 
doi:10.4230/dagrep.7.8.55 dblp:journals/dagstuhl-reports/SeshiaZKJ17 fatcat:pw2cuxb3e5eephkw4khs3fnkae

Index—Volumes 1–89

1997 Artificial Intelligence  
1280 domains 1239 modeling 1244 modeling of genetic algorithms 1244 models for genetic algorithms 1390 simulation 400, 598, 1396 stochastically more efficient 179 more informed 179 Stockman's  ...  model 1250 of belief update 1250 event/state concept coherence 308 events 466, 1104 calculus of -1189 concurrent -496.1189 in the real world 65 sequences of -309 temporal separation between -1236  ...  mathematics of non-monotonic-150 mechanism 381 mechanized formal -152 meta-level -185 method geometric -12 17 methods choices of -1157 models inexact -906 multiple inheritance -966 multiple lines of -  ... 
doi:10.1016/s0004-3702(97)80122-1 fatcat:6az7xycuifaerl7kmv7l3x6rpm

Event Detection in Continuous Video: An Inference in Point Process Approach

Zhen Qin, Christian R. Shelton
2017 IEEE Transactions on Image Processing  
[35] described a preliminary piece of this inference algorithm. A. Related Work We first describe related work in machine learning that models temporal dependencies.  ...  They focus more on sequence dependency modeling, instead of temporal modeling.  ... 
doi:10.1109/tip.2017.2745209 pmid:28858803 fatcat:dyv4g5qbpbeddke65tkkt7mvpe

Book reports

1993 Computers and Mathematics with Applications  
Instances of the abstract algorithm. IV. A compendium of model classes. 1. Finite-tree models. 2. Infinite-tree models. 3. Eqtree models. 4. Graph models. V. Parsing as type inference. 1.  ...  Finite interpretations and expansions with one-place predicates. 2. Finite countermodels for arguments with one-place predicates. 3. Finite counte~models for arguments with many-place predicates. 4.  ... 
doi:10.1016/0898-1221(93)90315-m fatcat:tnmkz3axfnekvgr4srsgsivuvy
« Previous Showing results 1 — 15 out of 5,569 results