Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleJune 2024
Piston Words
Mathematics and Computation in MusicJun 2024, Pages 280–288https://doi.org/10.1007/978-3-031-60638-0_22 - research-articleMarch 2024
Teaching Formal Languages through Programmed Instruction
SIGCSE 2024: Proceedings of the 55th ACM Technical Symposium on Computer Science Education V. 1March 2024, Pages 867–873https://doi.org/10.1145/3626252.3630940The content in Formal Languages courses is mathematical in nature, and requires students to engage with proofs and algorithms to grasp core concepts. Conventional textbooks on Formal Languages predominantly employ textual explanations, with assignments ...
- research-articleJuly 2022
Programming to Learn: Logic and Computation from a Programming Perspective
ITiCSE '22: Proceedings of the 27th ACM Conference on on Innovation and Technology in Computer Science Education Vol. 1July 2022, Pages 311–317https://doi.org/10.1145/3502718.3524814Programming problems are commonly used as a learning and assessment activity for learning to program. We believe that programming problems can be effective for broader learning goals. In our large-enrolment course, we have designed special programming ...
- research-articleJuly 2022
Gidayu: Visualizing Automaton and Their Computations
ITiCSE '22: Proceedings of the 27th ACM Conference on on Innovation and Technology in Computer Science Education Vol. 1July 2022, Pages 110–116https://doi.org/10.1145/3502718.3524742Generating visualizations of Formal Languages and Automata (FLA) is often a laborious and error prone task. Existing tools either offer the ability to fully customize the appearance of the artifacts, or offer reusability and abstraction, but do not ...
- research-articleJanuary 2022
Computing the Tandem Duplication Distance is NP-Hard
SIAM Journal on Discrete Mathematics (SIDMA), Volume 36, Issue 1Mar 2022, Pages 64–91https://doi.org/10.1137/20M1356257In computational biology, tandem duplication is an important biological phenomenon which can occur either at the genome or at the DNA level. A tandem duplication takes a copy of a genome segment and inserts it right after the segment---this can be ...
-
- short-paperDecember 2021
Translation of continuous function charts to imperative synchronous quartz programs
MEMOCODE '21: Proceedings of the 19th ACM-IEEE International Conference on Formal Methods and Models for System DesignNovember 2021, Pages 104–110https://doi.org/10.1145/3487212.3487338Programmable logic controllers operating in a sequential execution scheme are widely used for various applications in industrial environments with real-time requirements. The graphical programming languages described in the third part of IEC 61131 are ...
- research-articleNovember 2021
An Extended Account of Trace-relating Compiler Correctness and Secure Compilation
- Carmine Abate,
- Roberto Blanco,
- Ştefan Ciobâcă,
- Adrien Durier,
- Deepak Garg,
- Cătălin Hriţcu,
- Marco Patrignani,
- Éric Tanter,
- Jérémy Thibault
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 43, Issue 4Article No.: 14, Pages 1–48https://doi.org/10.1145/3460860Compiler correctness, in its simplest form, is defined as the inclusion of the set of traces of the compiled program in the set of traces of the original program. This is equivalent to the preservation of all trace properties. Here, traces collect, for ...
- research-articleMay 2021
Model‐based validation of diagnostic software with application in automotive systems
IET Cyber-Systems and Robotics (CSY2), Volume 3, Issue 2June 2021, Pages 140–149https://doi.org/10.1049/csy2.12016AbstractSoftware validation aims to ensure that a particular software product fulfils its intended purpose, and needs to be performed against both software requirement as well as its implementation (i.e. product). However, for diagnostic software (i.e. ...
- research-articleApril 2021
Syntactic Pattern Recognition in Computer Vision: A Systematic Review
- Gilberto Astolfi,
- Fábio Prestes Cesar Rezende,
- João Vitor De Andrade Porto,
- Edson Takashi Matsubara,
- Hemerson Pistori
ACM Computing Surveys (CSUR), Volume 54, Issue 3Article No.: 65, Pages 1–35https://doi.org/10.1145/3447241Using techniques derived from the syntactic methods for visual pattern recognition is not new and was much explored in the area called syntactical or structural pattern recognition. Syntactic methods have been useful because they are intuitively simple ...
- research-articleMarch 2021
Pyformlang: An Educational Library for Formal Language Manipulation
SIGCSE '21: Proceedings of the 52nd ACM Technical Symposium on Computer Science EducationMarch 2021, Pages 576–582https://doi.org/10.1145/3408877.3432464Formal languages are widely studied, taught and used in computer science. However, only a small part of this domain is brought to a broader audience, and students often have no practical experience in their curriculum. In this tool paper, we introduce ...
- research-articleMarch 2021
Teaching Formal Languages with Visualizations and Auto-Graded Exercises
SIGCSE '21: Proceedings of the 52nd ACM Technical Symposium on Computer Science EducationMarch 2021, Pages 569–575https://doi.org/10.1145/3408877.3432398The material taught in a Formal Languages and Automata (FLA) course is mathematical in nature and requires students to practice proofs and algorithms to understand the content. Traditional FLA textbooks are heavy on prose, and homework typically ...
- research-articleFebruary 2021
Robustly Safe Compilation, an Efficient Form of Secure Compilation
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 43, Issue 1Article No.: 1, Pages 1–41https://doi.org/10.1145/3436809Security-preserving compilers generate compiled code that withstands target-level attacks such as alteration of control flow, data leaks, or memory corruption. Many existing security-preserving compilers are proven to be fully abstract, meaning that they ...
- research-articleJanuary 2021
Generative Capacity of Contextual Grammars with Subregular Selection Languages*
Fundamenta Informaticae (FUNI), Volume 180, Issue 1-22021, Pages 123–150https://doi.org/10.3233/FI-2021-2037A contextual grammar is a language generating mechanism inspired by generating sentences in natural languages. An existing string can be extended to a new string of the language by adjoining a context before and behind the string or by inserting it into ...
- articleMay 2020
Efficient Performative Actions for E-Commerce Agents
Applied Computer Systems (ACSS), Volume 25, Issue 1May 2020, Pages 19–32https://doi.org/10.2478/acss-2020-0003AbstractThe foundational features of multi-agent systems are communication and interaction with other agents. To achieve these features, agents have to transfer messages in the predefined format and semantics. The communication among these agents takes ...
- ArticleApril 2020
A Duality Theoretic View on Limits of Finite Structures
Foundations of Software Science and Computation StructuresApr 2020, Pages 299–318https://doi.org/10.1007/978-3-030-45231-5_16AbstractA systematic theory of structural limits for finite models has been developed by Nešetřil and Ossona de Mendez. It is based on the insight that the collection of finite structures can be embedded, via a map they call the Stone pairing, in a space ...
- research-articleDecember 2019
Normal forms for match-action programs
CoNEXT '19: Proceedings of the 15th International Conference on Emerging Networking Experiments And TechnologiesDecember 2019, Pages 44–50https://doi.org/10.1145/3359989.3365417Packet processing programs may have multiple semantically equivalent representations in terms of the match-action abstraction exposed by the underlying data plane. Some representations may encode the entire packet processing program into one large table ...
- abstractFebruary 2019
Using Interactive Visualization and Programmed Instruction to Teach Formal Languages
SIGCSE '19: Proceedings of the 50th ACM Technical Symposium on Computer Science EducationFebruary 2019, Page 1263https://doi.org/10.1145/3287324.3293795The material taught in a Formal languages course is mathematical in nature and requires students to practice proofs and algorithms to understand the content. Traditional Formal Languages textbooks are heavy on prose rather than visuals, and homework ...
- research-articleNovember 2018
Regenerate: a language generator for extended regular expressions
GPCE 2018: Proceedings of the 17th ACM SIGPLAN International Conference on Generative Programming: Concepts and ExperiencesNovember 2018, Pages 202–214https://doi.org/10.1145/3278122.3278133Regular expressions are part of every programmer’s toolbox. They are used for a wide variety of language-related tasks and there are many algorithms for manipulating them. In particular, matching algorithms that detect whether a word belongs to the ...
Also Published in:
ACM SIGPLAN Notices: Volume 53 Issue 9, September 2018 - research-articleOctober 2018
EUDroid: a formal language specifying the behaviour of IoT devices
IET Software (SFW2), Volume 12, Issue 5October 2018, Pages 425–429https://doi.org/10.1049/iet-sen.2017.0347Recent technologies are offering today many possibilities to end users, which ask for continuous support in a variety of situations. Internet of things (IoTs) and the proliferation of smart devices are offering many opportunities that raise the need to ...
- research-articleMay 2018
Practical attribute‐based signature schemes for circuits from bilinear map
IET Information Security (ISE2), Volume 12, Issue 3May 2018, Pages 184–193https://doi.org/10.1049/iet-ifs.2017.0029Attribute‐based signatures allow us to sign anonymously, in such a way that the signature proves that the signer's attributes satisfy some predicate, but it hides any other information on the signer's attributes beyond that fact. As well as any ...