Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Sara Kalvala

dblp:s/SKalvala · also Saraswati Kalvala · DBLP profile ↗
← Back
9ranked-venue papers
2as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 6 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 77% Program verification · 23%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization
program transformation
0.112009
Program transformations using temporal logic side conditions · ACM Trans. Program. Lang. Syst. 2009
Program verification
temporal logic
0.012009
Program transformations using temporal logic side conditions · ACM Trans. Program. Lang. Syst. 2009

Methods — techniques the papers use, named apart from their topics

temporal logic · 0.1program transformation · 0.1
YearPublicationVenuePosition
2020 Postcondition-preserving fusion of postorder tree transformations
abstract
Tree transformations are common in applications such as program rewriting in compilers. Using a series of simple transformations to build a more complex system can make the resulting software easier to understand, maintain, and reason about. Fusion strategies for combining such successive tree transformations promote this modularity, whilst mitigating the performance impact from increased numbers of tree traversals. However, it is important to ensure that fused transformations still perform their intended tasks. Existing approaches to fusing tree transformations tend to take an informal approach to soundness, or be too restrictive to consider the kind of transformations needed in a compiler. We use postconditions to define a more useful formal notion of successful fusion, namely postcondition-preserving fusion. We also present criteria that are sufficient to ensure postcondition-preservation and facilitate modular reasoning about the success of fusion.
Eleanor Davies, Sara Kalvala
CC2
2015 Measures of Student Engagement in Computer Science
abstract
Data relating to university students' engagement is collected internationally via several large-scale student surveys such as the North American National Survey of Student Engagement. The instruments employed measure the extent to which students put their efforts into activities associated with effective learning. It is claimed that these process measures act as a reliable proxy for student attainment, and there appears to be some evidence to support this. So far, there has been little work done to investigate engagement instruments and the data they generate from a subject perspective. This paper brings together data relating to Computer Science (CS) across the range of major engagement surveys. The results of this meta-analysis appear to indicate that CS rates lower than average on many of the major engagement benchmarks and in some cases, considerably so. Particular benchmark areas giving cause for concern are identified prompting questions as to how these results should be interpreted and used in the context of a particular learning domain. We also critique aspects of the surveys themselves, suggesting that further research is needed to better understand their appropriateness for individual subjects or for groups of subjects with shared traits. The paper argues that more qualitative data is required and that other measures (such as student expectation and some subject-specific measures) are needed for a greater understanding of the CS student experience.
Jane E. Sinclair, Matthew Butler 0002, Michael Morgan, Sara Kalvala
ITiCSE4
2010 Spatial Simulations of Myxobacterial Development
abstract
Many bacteria exhibit multicellular behaviour, with individuals within a colony coordinating their actions for communal benefit. One example of complex multicellular phenotypes is myxobacterial fruiting body formation, where thousands of cells aggregate into large three-dimensional structures, within which sporulation occurs. Here we describe a novel theoretical model, which uses Monte Carlo dynamics to simulate and explain multicellular development. The model captures multiple behaviours observed during fruiting, including the spontaneous formation of aggregation centres and the formation and dissolution of fruiting bodies. We show that a small number of physical properties in the model is sufficient to explain the most frequently documented population-level behaviours observed during development in Myxococcus xanthus.
Antony B. Holmes, Sara Kalvala, David E. Whitworth
PLoS Comput. Biol.2
2009 From Specification to Optimisation: An Architecture for Optimisation of Java Bytecode
Richard Warburton, Sara Kalvala
CC2
2009 Program transformations using temporal logic side conditions
abstract
This article describes an approach to program optimization based on transformations, where temporal logic is used to specify side conditions, and strategies are created which expand the repertoire of transformations and provide a suitable level of abstraction. We demonstrate the power of this approach by developing a set of optimizations using our transformation language and showing how the transformations can be converted into a form which makes it easier to apply them, while maintaining trust in the resulting optimizing steps. The approach is illustrated through a transformational case study where we apply several optimizations to a small program.
Sara Kalvala, Richard Warburton, David Lacey
ACM Trans. Program. Lang. Syst.1
2005 Race Conditions in Message Sequence Charts
Chien-An Chen, Sara Kalvala, Jane E. Sinclair
APLAS2
2005 Race-free Scenarios of Message Sequence Charts
abstract
Message Sequence Charts (MSCs) are a graphical language for description of scenarios in terms of message exchanges between communicating components in a distributed environment. The language is popular in capturing system requirements in the design of reactive systems and communication protocols. In this paper, we review a design anomaly, called race conditions, in an MSC specification and present a few drawbacks with the current solution. We propose a new approach to correcting race conditions, and the limitation of this approach is also discussed.
Chien-An Chen, Sara Kalvala, Jane E. Sinclair
APSEC2
2003 Controller Synthesis for Object Petri Nets
Berndt Müller, Sara Kalvala, Kundan Misra
ICFEM2
1994 Annotations in Formal Specifications and Proofs
Sara Kalvala
Formal Methods Syst. Des.1