English Syllabus Redesigning for Information System Class: Creating Literacy-based Learning Activities of STMIK AMIKOM Purwokerto

Penelitian ini bertujuan untuk menemukan masalah serta kebutuhan mahasiswa Sistem Informasi STMIK Amikom Purwokerto dalam mempelajari Bahasa Inggris. Penelitian ini juga memiliki tujuan untuk membuat ulang silabus Bahasa Inggris untuk mereka serta mengetahui keakuratan silabus berdasarkan saran dari para ahli. Penelitian ini mengacu pada penelitian kualitatif atau khususnya penelitian studi kasus. Ada enam langkah penelitian. Langkah pertama adalah dengan metode studi pustakayaitu mengumpulkan, mengobservasi, menganalisa kurikulum Bahasa Inggris di STMIK Amikom Purwokerto. Hasilnya penulis menemukan kurikulum Bahasa Inggris di STMIK Amikom Purwokerto adalah kurikulum yang bertujuan pada pemahaman pengetahuan dan keahlian yang sesuai dengan kebutuhan hidup mahasiswa sehari-hari.Langkah yang kedua adalah dengan metode yang sama studi pustaka yaitu mengumpulkan, mengobservasi, menganalisa silabus Bahasa Inggris di STMIK Amikom Purwokerto. Ada dua bagian yang dianalisis yaitu analisis format dan analisis isi. Langkah yang ketiga adalah melakukan analisis kebutuhan mahasiswa dalam belajar Bahasa Inggris. Instrumen yang digunakan adalah kuesioner yaitu untuk mengumpulkan informasi tentang kesulitan serta kebutuhan mahasiswa dalam mempelajari Bahasa Inggris. Langkah yang keempat adalah membuat ulang silabus. Ada beberapa hal yang harus diperbaiki yaitu; (a) merumuskan ulang kompetensi dasar yang ingin dicapai, (b) merumuskan ulang standar kompetensi yang ingin dicapai, (c) menyusun topik dan material berdasarkan tingkat kesulitan, (d) merumuskan aktifitas belajar, (e) menciptakan indikator, alat evaluasi dan alokasi waktu. Langkah yang kelima adalah mengadakan validasi isi berdasarkan penilaian para ahli

The use of sequencing information in software specification for verification

Software requirements specifications, virtual machine definitions, and algorithmic design all place constraints on the sequence of operations that are permissible during a program's execution. This paper discusses how these constraints can be captured and used to aid in the program verification process. The sequencing constraints can be expressed as a grammar over the alphabet of program operations. Several techniques can be used in support of testing or verification based on these specifications. Dynamic aalysis and static analysis are considered here. The automatic generation of some of these aids is feasible; the means of doing so is described

An open extensible tool environment for Event-B

Abstract. We consider modelling indispensable for the development of complex systems. Modelling must be carried out in a formal notation to reason and make meaningful conjectures about a model. But formal modelling of complex systems is a difficult task. Even when theorem provers improve further and get more powerful, modelling will remain difficult. The reason for this that modelling is an exploratory activity that requires ingenuity in order to arrive at a meaningful model. We are aware that automated theorem provers can discharge most of the onerous trivial proof obligations that appear when modelling systems. In this article we present a modelling tool that seamlessly integrates modelling and proving similar to what is offered today in modern integrated development environments for programming. The tool is extensible and configurable so that it can be adapted more easily to different application domains and development methods.

An Experiment in Ping-Pong Protocol Verification by Nondeterministic Pushdown Automata

An experiment is described that confirms the security of a well-studied class of cryptographic protocols (Dolev-Yao intruder model) can be verified by two-way nondeterministic pushdown automata (2NPDA). A nondeterministic pushdown program checks whether the intersection of a regular language (the protocol to verify) and a given Dyck language containing all canceling words is empty. If it is not, an intruder can reveal secret messages sent between trusted users. The verification is guaranteed to terminate in cubic time at most on a 2NPDA-simulator. The interpretive approach used in this experiment simplifies the verification, by separating the nondeterministic pushdown logic and program control, and makes it more predictable. We describe the interpretive approach and the known transformational solutions, and show they share interesting features. Also noteworthy is how abstract results from automata theory can solve practical problems by programming language means.Comment: In Proceedings MARS/VPT 2018, arXiv:1803.0866