Filters








82,234 Hits in 4.0 sec

Verification of Finite-State-Machine Refinements Using a Symbolic Methodology [chapter]

Stefan Hendricx, Luc Claesen
1999 Lecture Notes in Computer Science  
In this paper, a symbolic methodology is presented to verify the step-wise refinement of finite state machines, allowing for possible differences in timing-granularity.  ...  The top-down design of VLSI-systems typically features a step-wise refinement of intermediate solutions.  ...  Acknowledgment The research presented in this paper was supported by a scholarship from the Flemish Institute for the promotion of Scientific-Technological Research in Industry (IWT).  ... 
doi:10.1007/3-540-48153-2_26 fatcat:m3ccb5tgb5citlpv4pnvqs5vwa

Learn and Test for Event-B – A Rodin Plugin [chapter]

Ionut Dinca, Florentin Ipate, Laurentiu Mierla, Alin Stefanescu
2012 Lecture Notes in Computer Science  
In order to complement these techniques with test generation and state model inference from Event-B models, we developed a new feature as a Rodin plugin.  ...  Test suite optimization is further applied according to different optimization criteria.  ...  There are many existing methods for test generation from finite state models.  ... 
doi:10.1007/978-3-642-30885-7_32 fatcat:w2l4qywvirhknchwjcrijlm6jq

Active Learning of Extended Finite State Machines [chapter]

Frits Vaandrager
2012 Lecture Notes in Computer Science  
state machines in which one can test for equality of data parameters, but no operations on data are allowed [2, 1] .  ...  Active Learning of Extended Finite State Machines Frits Vaandrager Institute for Computing and Information Sciences, Radboud University Nijmegen, P.O.  ... 
doi:10.1007/978-3-642-34691-0_2 fatcat:2veuuwieqzd57do2x55rhqe2ei

Exhaustive Property Oriented Model-based Testing With Symbolic Finite State Machines (Technical Report)

Niklas Krafczyk, Jan Peleska
2021 Zenodo  
The technical report extends the paper by full proofs for the lemmas and theorems stated there, and it discusses examples regarding the test case reduction achievable when testing for specific properties  ...  In this paper, new contributions to property oriented testing (POT) against SFSM models are presented.  ...  The reduction of test suite sizes ranges from 40 to 50% in this example which is highly advantageous in the testing process as this reduces the cost for testing significantly.  ... 
doi:10.5281/zenodo.5151777 fatcat:5xbnqsjhlfap7ah7miqtc6ctjq

ProB: an automated analysis toolset for the B method

Michael Leuschel, Michael Butler
2008 International Journal on Software Tools for Technology Transfer (STTT)  
ProB also contains a model checker and a refinement checker, both of which can be used to detect various errors in B specifications.  ...  ProB's automated animation facilities allow users to gain confidence in their specifications.  ...  S M ∪P M of a B machine be finite.  ... 
doi:10.1007/s10009-007-0063-9 fatcat:vdtr752dhva5tpm6xkc43nw5be

Distinguishing extended finite state machine configurations using predicate abstraction

Khaled El-Fakih, Nina Yevtushenko, Marius Bozga, Saddek Bensalem
2016 Journal of Software Engineering Research and Development  
Extended Finite State Machines (EFSMs) provide a powerful model for the derivation of functional tests for software systems and protocols.  ...  Conclusions: The work can be applied in various domains such as EFSM-based test derivation, mutation testing, and fault diagnosis.  ...  Paulo Borba and the anonymous reviewers for their help in improving the paper.  ... 
doi:10.1186/s40411-016-0027-4 fatcat:4mcxo2vx3zhstpookwwznsubzu

Exhaustive Property Oriented Model-based Testing With Symbolic Finite State Machines (Technical Report)

Niklas Krafczyk, Jan Peleska
2021 Zenodo  
The technical report extends the paper by full proofs for the lemmas and theorems stated there, and it discusses examples regarding the test case reduction achievable when testing for specific properties  ...  In this paper, new contributions to property oriented testing (POT) against SFSM models are presented.  ...  are represented as symbolic finite state machines (SFSMs) extending finite state machines (FSMs) in Mealy format by input and output variables, guard conditions, and output expressions.  ... 
doi:10.5281/zenodo.5719524 fatcat:ldoetucxojhbjpfvwi67x6i4va

MACE: Model-inference-Assisted Concolic Exploration for Protocol and Vulnerability Discovery

Chia Yuan Cho, Domagoj Babic, Pongsin Poosankam, Kevin Zhijie Chen, Edward XueJun Wu, Dawn Song
2011 USENIX Security Symposium  
Program state-space exploration is central to software security, testing, and verification.  ...  Our technique uses a combination of symbolic and concrete execution to build an abstract model of the analyzed application, in the form of a finite-state automaton, and uses the model to guide further  ...  First, a deeper analysis of the correspondence of the inferred finite state models to the structure and state-space of the analyzed application could reveal how models could be used even more effectively  ... 
dblp:conf/uss/ChoBPCWS11 fatcat:hauhmovrmbcg5lqoss4dkedrx4

Building Incomplete but Accurate Models

Erik Talvitie, Britton Wolfe, Satinder P. Singh
2008 International Symposium on Artificial Intelligence and Mathematics  
The goal of this paper is to find a minimal refinement of that partition such that a model of the refined system will make accurate predictions with respect to the features of interest.  ...  Making accurate abstract predictions of this form may not require a fully detailed model of the world, though in general it will require that the agent make some finer distinctions than those that interest  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the NSF.  ... 
dblp:conf/isaim/TalvitieWS08 fatcat:z5bhm47j3rdelc7kh44m2g7bpu

From Sets to Bits in Coq [chapter]

Arthur Blot, Pierre-Évariste Dagand, Julia Lawall
2016 Lecture Notes in Computer Science  
Computer Science abounds in folktales about how -in the early days of computer programming -bit vectors were ingeniously used to encode and manipulate finite sets.  ...  In the Coq proof assistant, we implement a bitset library and prove its correctness with respect to a formalization of finite sets.  ...  Refining Sets to Machine Integers In Section 3, we have established a refinement relation between BITS n and finite sets.  ... 
doi:10.1007/978-3-319-29604-3_2 fatcat:xc37xrcbczeu5kc3frllvds7lu

EVALUATION OF MECHANICAL RESISTANCE BY THE FINITE ELEMENTS METHOD OF A MACHINING TOOL WITH INTERNAL COOLING CHANNELS

P. H. P. França, L. R. R. Da Silva
2021 Revista de Engenharia Térmica  
In this work, the strength of machining hardware for the modified turning process with internal channels that circulates water as a coolant through a closed system was studied.  ...  were performed using the finite element method by the Ansys® Workbench software 19.2.  ...  The finite element numerical method has been a trendy tool in analyzing several areas of engineering, especially in machining, particularly for the study of phenomena that demand a large amount of cost  ... 
doi:10.5380/reterm.v20i2.81786 fatcat:wtx4nn4horc4fp6wkbf2npxiam

Testing for a conformance relation based on acceptance [chapter]

Ming Yu Yao, Gregor Bochmann
1993 Lecture Notes in Computer Science  
In this paper, we propose a conformance testing method for object-oriented software systems.  ...  We believe that many special programming features found in the object-oriented paradigm will also play important roles during the testing phase.  ...  It has also been pointed out in [14] that the test suites generated from two given f'mite state machines can be reused in the generation of the test suite for a third finite state machine which is the  ... 
doi:10.1007/3-540-56610-4_86 fatcat:alvphbyf4rb4dlf6ae27pevvc4

ProB: A Model Checker for B [chapter]

Michael Leuschel, Michael Butler
2003 Lecture Notes in Computer Science  
ProB contains a model checker and a constraint-based checker, both of which can be used to detect various errors in B specifications.  ...  We present our first experiences in using ProB on several case studies, highlighting that ProB enables users to uncover errors that are not easily discovered by existing tools.  ...  Acknowledgements We would like to thank Laksono Adhianto, Stefan Gruner, Leonid Mikhailov, and especially Carla Ferreira for their help in implementing and testing ProB.  ... 
doi:10.1007/978-3-540-45236-2_46 fatcat:e7ubpcxq5zewzhhpvtv44r6dtu

Page 59 of Computational Linguistics Vol. 27, Issue 1 [page]

2001 Computational Linguistics  
University [his paper presents a semiautomatic technique for developing broad-coverage finite-state mor- phological analyzers for use in natural language processing applications.  ...  This elicit-build-test technique compiles lexical and inflectional information elicited from a human into a finite-state transducer lexicon and combines this with a sequence of morphographemic rewrite  ... 

Software engineering and formal methods: SEFM 2019 special section

Peter Csaba Ölveczky, Gwen Salaün
2021 Journal of Software and Systems Modeling  
Software and Systems Modeling and for his very valuable and friendly assistance in bringing it to publication.  ...  thorough reviewing process; to the reviewers for kindly contributing their time and effort to ensure the highest quality of each paper; and to Martin Schindler for agreeing to publish this special section in  ...  as communicating finite state machines (CFSMs), when processes communicate asynchronously.  ... 
doi:10.1007/s10270-021-00874-1 fatcat:yejo3nugwvhedpkadwtt5zfaky
« Previous Showing results 1 — 15 out of 82,234 results