The Department of Computer Science and Engineering is joint between Chalmers and the University of Gothenburg, where the university part is included in the IT Faculty.

More information: Computer Science and Engineering

Collections in this community

Recent Submissions

  • Fair Omega-regular Games 

    Hausmann, Daniel; Piterman, Nir; Saglam, Irmak; Schmuck, Anne-Kathrin (27th International Conference on Foundations of Software Science and Computation Structures, 2024)
    We consider two-player games over finite graphs in which both players are restricted by fairness constraints on their moves. Given a two player game graph G=(V,E) and a set of fair moves E_f a subset of E a player is said ...
  • Symbolic Solution of Emerson-Lei Games for Reactive Synthesis 

    Hausmann, Daniel; Lehaut, Mathieu; Piterman, Nir (2024)
    Emerson-Lei conditions have recently attracted attention due to both their succinctness and their favorable closure properties. In the current work, we show how infinite-duration games with Emerson-Lei objectives can be ...
  • Synchronous Agents, Verification, and Blame - A Deontic View 

    Kharraz, Karam; Azzopardi, Shaun; Schneider, Gerardo; Leucker, Martin (2023)
    A question we can ask of multi-agent systems is whether the agents’ collective interaction satisfies particular goals or specifications, which can be either individual or collective. When a collaborative goal is not reached, ...
  • Modelling Flocks of Birds and Colonies of Ants from the Bottom Up 

    De Nicola, Rocco; Di Stefano, Luca; Inverso, Omar; Valiani, Serenella (2023)
  • Games for Efficient Supervisor Synthesis 

    Hausmann, Daniel; Prabhat, Kumar Jha; Piterman, Nir (2023)
    In recent years, there has been an increasing interest in the connections between supervisory control theory and reactive synthesis. As the two fields use similar techniques there is great hope that technologies from one ...
  • COOL 2 – A Generic Reasoner for Modal Fixpoint Logics (System Description) 

    Görlitz, Oliver; Hausmann, Daniel; Humml, Merlin; Pattinson, Dirk; Prucker, Simon; Schröder, Lutz (2023)
    There is a wide range of modal logics whose semantics goes beyond relational structures, and instead involves, e.g., probabilities, multi-player games, weights, or neighbourhood structures. Coalgebraic logic serves as a ...
  • ppLTLTT : Temporal Testing for Pure-Past Linear Temporal Logic Formulae 

    Azzopardi, Shaun; Lidell, David; Piterman, Nir; Schneider, Gerardo (2023)
    This paper presents ppLTLTT, a tool for translating pure-past linear temporal logic formulae into temporal testers in the form of automata. We show how ppLTLTT can be used to easily extend existing LTL-based tools, such ...
  • Language Support for Verifying Reconfigurable Interacting Systems 

    Abd Alrahman, Yehia; Azzopardi, Shaun; Di Stefano, Luca; Piterman, Nir (2023)
    Reconfigurable interacting systems consist of a set of autonomous agents, with integrated interaction capabilities that feature opportunistic interaction. Agents seemingly reconfigure their interactions interfaces by forming ...
  • Towards Next-Gen Machine Learning Asset Management Tools 

    Idowu, Samuel O. (2023-10-26)
    Context: The proficiency of machine learning (ML) systems in solving many real-world problems effectively has enabled a paradigm shift toward ML-enabled systems. In ML-enabled software, significant software code artifacts ...
  • Improving the Performance of Machine Learning-based Methods for Continuous Integration by Handling Noise 

    Al-Sabbagh, Khaled (2023-08-22)
    Background: Modern software development companies are increasingly implementing continuous integration (CI) practices to meet market demands for delivering high-quality features. The availability of data from CI systems ...
  • Games for Efficient Supervisor Synthesis 

    Hausmann, Daniel; Kumar Jha, Prabhat; Piterman, Nir (2023)
    In recent years, there has been an increasing interest in the connections between supervisory control theory and reactive synthesis. As the two fields use similar techniques there is great hope that technologies from one ...
  • Understanding, Implementing, and Supporting Security Assurance Cases in Safety-Critical Domains 

    Mohamad, Mazen (2023-05-25)
    The increasing demand for connectivity in safety-critical domains has made security assurance a crucial consideration. In safety-critical industry, software, and connectivity have become integral to meeting market expectations. ...
  • A Survey on Satisfiability Checking for the μ -Calculus Through Tree Automata 

    Hausmann, Daniel; Piterman, Nir (2022)
    Algorithms for model checking and satisfiability of the modal μ -calculus start by converting formulas to alternating parity tree automata. Thus, model checking is reduced to checking acceptance by tree automata and ...
  • Automated replication of tuple spaces via static analysis 

    De Nicola, Rocco; Di Stefano, Luca; Inverso, Omar; Uwimbabazi, Aline (2022)
    Coordination languages for tuple spaces can offer significant advantages in the specification and implementation of distributed systems, but often do require manual programming effort to ensure consistency. We propose an ...
  • Modelling Flocks of Birds from the Bottom Up 

    De Nicola, Rocco; Di Stefano, Luca; Inverso, Omar; Valiani, Serenella (2022)
    We argue that compositional specification based on formal languages can facilitate the modelling of, and reasoning about, sophisticated collective behaviour in many natural systems. One defines a system in terms of individual ...
  • A PO Characterisation of Reconfiguration 

    Abd Alrahman, Yehia; Martel, Mauricio; Piterman, Nir (2022)
    We consider partial order semantics of concurrent systems in which local reconfigurations may have global side effects. That is, local changes happening to an entity may block or unblock events relating to others, namely, ...
  • On the Specification and Monitoring of Timed Normative Systems 

    Azzopardi, Shaun; Pace, Gordon J.; Schapachnik, Fernando; Schneider, Gerardo (2022)
    In this article we explore different issues and design choices that arise when considering how to fully embrace timed aspects in the formalisation of normative systems, e.g., by using deontic modalities, looking primarily ...
  • Runtime Verification of Kotlin Coroutines 

    Furian, Denis; Azzopardi, Shaun; Falcone, Yliès (2022)
    Kotlin was introduced to Android as the recommended language for development. One of the unique functionalities of Kotlin is that of coroutines, which are lightweight tasks that can run concurrently inside threads. Programming ...
  • AspectSol: A Solidity Aspect-Oriented Programming Tool with Applications in Runtime Verification 

    Azzopardi, Shaun; Ellul, Joshua; Falzon, Ryan; Pace, Gordon J. (International Conference on Runtime Verification, 2022)
    Aspect-oriented programming tools aim to provide increased code modularity by enabling programming of cross-cutting concerns separate from the main body of code. Since the inception of runtime verification, aspect-oriented ...
  • Tainting in Smart Contracts: Combining Static and Runtime Verification 

    Azzopardi, Shaun; Ellul, Joshua; Falzon, Ryan; Pace, Gordon J. (Lecture Notes in Computer Science book series (LNCS,volume 13498), 2022)
    Smart contracts exist immutably on blockchains, making their pre-deployment correctness essential. Moreover, they exist openly on blockchains—open for interaction with any other smart contract and offchain entity. Interaction, ...

View more