Browsing Mathematics (Faculty of) by Type "Conference Paper"
Now showing items 1-20 of 48
-
The aftermath of a crypto-ransomware attack at a large academic institution
(USENIX, 2018-08)In 2016, a large North American university was subject to a significant crypto-ransomware attack and did not pay the ransom. We conducted a survey with 150 respondents and interviews with 30 affected students, staff, and ... -
ALDB: Debugging Alloy Models of Behavioural Requirements
(IEEE, 2020-08)Declarative modelling languages, such as Alloy, are becoming popular for describing behavioural requirements very early in system development because automated analysis of these models provides valuable feedback. Typically, ... -
Approximately Coloring Graphs Without Long Induced Paths
(Springer Nature, 2017)It is an open problem whether the 3-coloring problem can be solved in polynomial time in the class of graphs that do not contain an induced path on t vertices, for fixed t. We propose an algorithm that, given a 3-colorable ... -
Are machine learning corpora “fair dealing” under Canadian law?
(Proceedings of the 12th International Conference on Computational Creativity, 2021-09)We consider the use of large corpora for training compuationally creative systems, particularly those that write new text based on the style of an existing author or genre. Under Canadian copyright law, a key concern for ... -
BSML-mbeddr: Integrating Semantically Congurable State-Machine Models in a C Programming Environment
(ACM, 2016-11)In model-driven engineering, developers express their solutions in domain-specific modelling languages (DSLs) that support domain-specific abstractions. Big-Step Modelling Languages (BSML) is a family of extended state-machine ... -
A Comparison of the Declarative Modelling Languages B, Dash, and TLA+
(IEEE, 2019-08)Declarative behavioural modelling is a powerful modelling paradigm that enables users to model system func- tionality abstractly and concisely. We compare two well-used formal declarative modelling languages, B and TLA+, ... -
Complexity of Ck-Coloring in Hereditary Classes of Graphs
(Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019)For a graph F, a graph G is F-free if it does not contain an induced subgraph isomorphic to F. For two graphs G and H, an H-coloring of G is a mapping f : V (G) --> V (H) such that for every edge uv E(G) it holds that ... -
Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages
(Springer, 2017-03-06)A language L over an alphabet Σ is suffix-convex if, for any words x,y,z∈Σ∗, whenever z and xyz are in L, then so is yz. Suffix-convex languages include three special cases: left-ideal, suffix-closed, and suffix-free ... -
Complexity of Proper Prefix-Convex Regular Languages
(Springer, 2017-06-27)A language L over an alphabet Σ is prefix-convex if, for any words x,y,z∈Σ∗, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefix-closed, and prefix-free languages, which were ... -
Continuous Variable-Specic Resolutions of Feature Interactions
(ACM, 2017-09)Systems that are assembled from independently developed features suffer from feature interactions, in which features affect one another's behaviour in surprising ways. The Feature Interaction Problem results from trying ... -
Creating Your Bubble: Personal Space On and Around Large Public Displays
(ACM, 2016-05)We describe an empirical study that explores how users establish and use personal space around large public displays (LPDs). Our study complements field studies in this space by more fully characterizing interpersonal ... -
Dash+: Extending Alloy with Hierarchical States and Replicated Processes for Modelling Transition Systems
(IEEE, 2021-09)Modelling systems abstractly shows great promise to uncover bugs early in system development. The formal language Alloy provides the means of writing constraints abstractly, but lacks explicit constructs for describing ... -
DASH: A New Language for Declarative Behavioural Requirements with Control State Hierarchy
(IEEE, 2017-09-04)We present DASH, a new language for describing formal behavioural models of requirements. DASH combines the ability to write abstract, declarative transitions (as in Z or Alloy) with a labelled control state hierarchy (as ... -
Detecting Feature-Interaction Symptoms in Automotive Software Using Lightweight Analysis
(IEEE, 2019-02)Modern automotive software systems are large, com- plex, and feature rich; they can contain over 100 million lines of code, comprising hundreds of features distributed across multiple electronic control units (ECUs), all ... -
The Effect of Input Signals Time-Delay on Stabilizing Traffic with Autonomous Vehicles
(IEEE, 2021-05)This paper extends the results in [1] considering time delays in Standard Car Following models (CFMs). In [1], connected vehicles are characterized with CFMs models and controlled using linear string analysis to stabilize ... -
Elements of Gameful Design Emerging from User Preferences
(Association for Computing Machinery, 2017-10-15)Several studies have developed models to explain player preferences. These models have been developed for digital games; however, they have been frequently applied in gameful design (i.e., designing non-game applications ... -
An Empirical Investigation to Understand the Difficulties and Challenges of Software Modellers When Using Modelling Tools
(ACM, 2018-10)Software modelling is a challenging and error-prone task. Existing Model-Driven Engineering (MDE) tools provide modellers with little aid, partly because tool providers have not investigated users' difficulties through ... -
Extracting Counterexamples from Transitive-Closure-Based Model Checking
(IEEE, 2019)We address the problem of how to extract counterexamples for the transitive-closure-based model checking (TCMC) technique. TCMC is a representation of the CTLFC (CTL with fairness constraints) model checking problem in ... -
Finite Model Finding Using the Logic of Equality with Uninterpreted Functions
(Springer, 2016)The problem of finite model finding, finding a satisfying model for a set of first-order logic formulas for a finite scope, is an important step in many verification techniques. In MACE-style solvers, the problem is mapped ... -
A Focus+Context Approach to Alleviate Cognitive Challenges of Editing and Debugging UML Models
(IEEE, 2019-09)Model-Driven Engineering has been proposed to increase the productivity of developing a software system. Despite its benefits, it has not been fully adopted in the software industry. Research has shown that modelling tools ...