English
Related papers

Related papers: Incremental Bidirectional Typing via Order Mainten…

200 papers

We propose a type system to analyze the time consumed by multi-threaded imperative programs with a shared global memory, which delineates a class of safe multi-threaded programs. We demonstrate that a safe multi-threaded program runs in…

Computational Complexity · Computer Science 2012-04-02 Jean-Yves Marion , Romain Péchoux

Online continual learning, especially when task identities and task boundaries are unavailable, is a challenging continual learning setting. One representative kind of methods for online continual learning is replay-based methods, in which…

Machine Learning · Computer Science 2022-09-26 Yan-Shuo Liang , Wu-Jun Li

One of the most well-established applications of machine learning is in deciding what content to show website visitors. When observation data comes from high-velocity, user-generated data streams, machine learning methods perform a…

Syntax is fundamental to our thinking about language. Failing to capture the structure of input language could lead to generalization problems and over-parametrization. In the present work, we propose a new syntax-aware language model:…

Computation and Language · Computer Science 2021-05-12 Yikang Shen , Shawn Tan , Alessandro Sordoni , Siva Reddy , Aaron Courville

In a traditional formal development process, e.g. using the B method, the informal user requirements are (manually) translated into a global abstract formal specification. This translation is especially difficult to achieve. The Event-B…

Software Engineering · Computer Science 2016-06-08 Thomas Fayolle , Marc Frappier , Régine Laleau , Frédéric Gervais

Refinement types enrich a language's type system with logical predicates that circumscribe the set of values described by the type, thereby providing software developers a tunable knob with which to inform the type system about what…

Programming Languages · Computer Science 2020-10-16 Ranjit Jhala , Niki Vazou

Software testing is a prime factor in software industry. Besides knowing the importance of testing, only limited time is allocated for teaching it. It will be more efficient if testing is taught simultaneously with programming foundations.…

Artificial Intelligence · Computer Science 2013-02-22 A. Anandaraj , P. Kalaivani , V. Rameshkumar

Timed model checking, the method to formally verify real-time systems, is attracting increasing attention from both the model checking community and the real-time community. Explicit-time description methods verify real-time systems using…

Logic in Computer Science · Computer Science 2009-12-15 Hao Wang , Wendy MacCaull

The design space of networked embedded systems is very large, posing challenges to the optimisation of such platforms when it comes to support applications with real-time guarantees. Recent research has shown that a number of inter-related…

Performance · Computer Science 2020-07-21 Leandro Soares Indrusiak , Robert I. Davis , Piotr Dziurzanski

Language is by its very nature incremental in how it is produced and processed. This property can be exploited by NLP systems to produce fast responses, which has been shown to be beneficial for real-time interactive applications. Recent…

Computation and Language · Computer Science 2023-05-19 Patrick Kahardipraja , Brielen Madureira , David Schlangen

Updates to network configurations are notoriously difficult to implement correctly. Even if the old and new configurations are correct, the update process can introduce transient errors such as forwarding loops, dropped packets, and access…

Programming Languages · Computer Science 2014-08-10 Andrew Noyes , Todd Warszawski , Pavol Černý , Nate Foster

We study a type checking algorithm that is able to type check a nontrivial subclass of functional programs that use features such as higher-rank, impredicative and second-order types. The only place the algorithm requires type annotation is…

Logic in Computer Science · Computer Science 2017-11-15 Peng Fu

In this paper, we first define a difference measure between the old and new sequential patterns of stream data, which is proved to be a distance. Then we propose an experimental method, called TPD (Tradeoff between Performance and…

Databases · Computer Science 2007-05-23 Qingguo Zheng , Ke Xu , Shilong Ma

Numerous recent techniques for text style transfer characterize their approaches as variants of reinforcement learning and preference optimization. In this work, we consider the relationship between these approaches and a class of…

Computation and Language · Computer Science 2024-07-30 Shuai Liu , Jonathan May

We introduce end-to-end support of co-existing schema versions within one database. While it is state of the art to run multiple versions of a continuously developed application concurrently, it is hard to do the same for databases. In…

Databases · Computer Science 2017-09-20 Kai Herrmann , Hannes Voigt , Andreas Behrend , Jonas Rausch , Wolfgang Lehner

As declarative query processing techniques expand in scope --- to the Web, data streams, network routers, and cloud platforms --- there is an increasing need for adaptive query processing techniques that can re-plan in the presence of…

Databases · Computer Science 2014-09-23 Mengmeng Liu , Zachary G. Ives , Boon Thau Loo

Evaluation of text generation to date has primarily focused on content created sequentially, rather than improvements on a piece of text. Writing, however, is naturally an iterative and incremental process that requires expertise in…

Computation and Language · Computer Science 2022-09-28 Jane Dwivedi-Yu , Timo Schick , Zhengbao Jiang , Maria Lomeli , Patrick Lewis , Gautier Izacard , Edouard Grave , Sebastian Riedel , Fabio Petroni

Linear type systems need to keep track of how programs use their resources. The standard approach is to use context splits specifying how resources are (disjointly) split across subterms. In this approach, context splits redundantly echo…

Logic in Computer Science · Computer Science 2021-09-06 Uma Zalakain , Ornela Dardha

Instruction tuning commonly means finetuning a language model on instruction-response pairs. We discover two forms of adaptation (tuning) that are deficient compared to instruction tuning, yet still yield instruction following; we call this…

Computation and Language · Computer Science 2024-09-24 John Hewitt , Nelson F. Liu , Percy Liang , Christopher D. Manning

Post-training for large language models (LLMs) is constrained by the high cost of acquiring new knowledge or correcting errors and by the unintended side effects that frequently arise from retraining. To address these issues, we introduce…

Computation and Language · Computer Science 2026-02-11 Yisu Wang , Ming Wang , Haoyuan Song , Wenjie Huang , Chaozheng Wang , Yi Xie , Xuming Ran