I obtained my PhD degree in 2015 with Bengt Jonsson as my advisor and Parosh Abdulla as co-advisor. My thesis, ''Learning Component Behavior from Tests: Theory and algorithms for automata with data'' deals with automata models and how to automatically infer them. Finite automata are widely used in specification, verification and testing. My research focused on register automata, which is a kind of automaton that operates on an infinite domain of data values, comparing them, e.g., for equality. We wanted to automatically infer (e.g., from specifications) automata that handle and compare data values. In the CONNECT Project (2009-12), we attempted to automatically learn register automata in order to model 'connectors' between networked systems.
I have a Google Scholar page here.
I finished my master's degree in Computational Linguistics at the Dept. of Linguistics and Philology at Uppsala University in 2009. My thesis was about connecting a linear classifier to a natural language parser, supervised by Marco Kuhlmann.
Publications (related to my PhD)
RALib: A LearnLib extension for inferring EFSMs. S. Cassel, F. Howar, B. Jonsson; DIFTS 2015 (online only)
A Succinct Canonical Register Automaton Model. S. Cassel, F. Howar, B. Jonsson, M. Merten, B. Steffen; ATVA 2011
+ journal version (in J. of Logic and Algebraic Methods in Programming, 2015) here. A previous version was published as a technical report, here.
Learning Extended Finite State Machines. S. Cassel, F. Howar, B. Jonsson, B. Steffen; SEFM 2014
+ journal version (in Formal Aspects of Computing, 2016) here. A previous version was published as a technical report, here.
A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations. S. Cassel, B. Jonsson, F. Howar, B. Steffen; ATVA 2012
Demonstrating Learning of Register Automata. M. Merten, F. Howar, B. Steffen, S. Cassel, B. Jonsson; TACAS 2012
Inferring Canonical Register Automata. F. Howar, B. Steffen, S. Cassel, B. Jonsson; VMCAI 2012
On Handling Data in Automata Learning - Considerations from the CONNECT Perspective. F. Howar, B. Jonsson, M. Merten, B. Steffen, S. Cassel; ISoLa 2010
A structured approach to training open-ended problem solving. S. Cassel, B. Victor; FIE 2015.
Activity Profiles in Online Social Media. M. F. Atig, S. Cassel, L. Kaati, A. Shrestha; ASONAM 2014
Enhanced Learning by Promoting Engineering Competencies. S. Cassel, A. Nylén, B. Victor; FIE 2014
MaltParser and LIBLINEAR - Transition-based dependency parsing with linear classification for feature model optimization. S. Cassel; master's thesis 2009
Självständigt arbete & Uppsatsmetodik (Independent project in information engineering & Technical writing and presentation techniques): 2014; 2015
Secure computer systems I: 2011; 2012; 2013; 2014;
Programming for Language Technologists: 2015
Advanced Programming for Language Technologists: 2015
Algorithms for Syntactic Analysis: 2015
Object-oriented programming in Java (Summer course): 2013
Introduktion till datavetenskap (Intro. to information technology): 2010; 2011
Cryptology: 2010; 2011
I am involved in the CS-WEd project for improving the writing capabilities of students in computer science.
I was PhD student representative on the faculty board (2012/13, re-elected 2013/14 and 2014/15). I was the chair of TNDR (the faculty's PhD student council), initially for the 2012/13 academic year and re-elected for 2013/14.