Practical programming, validation and verification with finite-state machines

Salem, Paulo

doi:10.1145/2889160.2889226

Cited by 7 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…State Machine (FSM) memungkinkan pemrogram untuk memanfaatkan kesederhanaannya, Namun, itu tidak dapat secara langsung mendukung langsung proses validasi formal atau bahkan jenis analisa yang mungkin lebih sederhana (Salem, 2016).…”

Section: Finiteunclassified

Penerapan Finite State Automata Pada Validasi Permohonan Pengajuan Layanan Akun Digital Menara Masjid

et al. 2022

View full text Add to dashboard Cite

5ABSTRAK DMI Kota Bekasi dalam melaksanakan visi dan misinya yaitu "Optimalisasi peran dan fungsi masjid dalam pemberdayaan umat di era industri 4.0", memberikan fasilitas berupa penyediaan layanan penggunaan aplikasi digital menara masjid. Pengelolaan pengajuan akun apabila dilakukan secara manual akan menghabiskan waktu yang cukup lama serta kemungkinan terjadi resiko kehilangan data pengajuan. Maksud Penelitian ini dilaksanakan dengan tujuan untuk menghemat waktu, serta memperkecil resiko kehilangan data dan meminimalkan kesalahan pada proses pencatatan permohonan pengajuan akun yang diterima, Pada perancangan sistem ini akan melakukan pengecekan berdasarkan hasil inputan pemohon dan sistem akan secara otomatis melakukan proses validasi, sebelum data tersebut akan disimpan ke dalam basis data menerapkan konsep FSA sehingga data yang akan disimpan sesuai dengan format yang telah ditentukan. Dengan menerapkan hasil penelitian ini, diharapkan dapat membantu DMI Kota Bekasi mengurangi waktu dan memperkecil terjadinya kehilangan data pengajuan, serta meminimalkan terjadinya kesalahan pada proses pencatatan permohonan pengajuan akun karena data pengajuan akan disimpan berdasarkan format yang telah ditentukan.

show abstract

Section: Finiteunclassified

Penerapan Finite State Automata Pada Validasi Permohonan Pengajuan Layanan Akun Digital Menara Masjid

et al. 2022

View full text Add to dashboard Cite

show abstract

“…The use of directed graphs is a popular visualisation for many of the techniques we will discuss here, such as Event Flow Graphs (EFG) [10], FSA (used here interchangeably with Finite State Machines (FSM)) [18,8,19,13,7,16,1], and hierarchical Task Models [11,2,5]. Directed graphs establish specific paths through a graph which allow us to traverse specific orderings.…”

Section: Background and Related Workmentioning

confidence: 99%

“…This is another approach which focuses on restricting the sequence length to those generated by specific traversal algorithms. For example, Salem presents an approach where an FSA is converted so they can be explored using the UP-PAAL model checker, this method allows them to avoid direct state-explosion [13]. In [7] Huang et al use weight based methods to calculate paths of a specified length to traverse through the models.…”

Section: Background and Related Workmentioning

confidence: 99%

Using Abstraction with Interaction Sequences for Interactive System Modelling

Turner

Bowen

Reeves

2018

Software Technologies: Applications and Foundations

View full text Add to dashboard Cite

Interaction sequences can be used as an abstraction of an interactive system. We can use such models to consider or verify properties of a system for testing purposes. However, interaction sequences have the potential to become unfeasibly long, leading to models which are intractable. We propose a method of reducing the state space of such sequences using the self-containment property. This allows us to hide (and subsequently expand) some of the model describing parts of the system not currently under consideration. Interaction sequences and their models can therefore be used to control the state space size of the models we create as an abstraction of an interactive system.

show abstract

“…This kind of approach focuses on restricting the sequence length to those generated by specific traversal algorithms. For example, Salem presents an approach using Finite State Machines (FSM) where complex traversal algorithms are used for testing purposes [62]. In [30] Huang et al use weight-based methods to calculate paths of certain length to traverse through the models.…”

Section: Existing Testing Techniquesmentioning

confidence: 99%