Hasil untuk "Germanic languages. Scandinavian languages"

Menampilkan 20 dari ~329565 hasil · dari CrossRef, DOAJ, Semantic Scholar, arXiv

JSON API
S2 Open Access 2024
The History of the English Language Origin as a Clue to Understanding its Current Status

Т.А. Марцева, Ю.В. Кобенко

В работе проводятся параллели между этапами исторического развития английского языка, формировавшегося в условиях многоязычия, и его статусом языка-макропосредника в современном мире. Исследование проводится при использовании двух ключевых методов: сравнительно-исторического, позволяющего проследить развитие английского языка в диахроническом разрезе и во взаимодействии с другими контактными идиомами, существовавшими в анизотропии языковой ситуации того времени, и диалектического, направленного на выделение таких контрадикторных направлений эволюции его языковой системы, как интеграция и дезинтеграция, стандартизация и индивидуализация, центризм и ацентризм. Эволюция подходов к периодизации английского языка (тевтонская группа – XVII–XVIII вв., англофризская группа – XIX в., западногерманская группа – XX в.) коренится в изменениях интралингвистического характера, обусловленных рядом экстралингвистических факторов. С одной стороны, островное расположение ареала зарождения языка, труднодоступность этих территорий и, следовательно, их изолированность, а с другой – привлекательность данных земель в связи с благоприятными условиями (мягкий климат, разнообразие ландшафта, флоры и фауны), христианизация, активные торговые отношения и, как следствие, константная полиглоссия языкового окружения (кельтские, германские, скандинавские диалекты, классическая и вульгарная латынь, разнообразные диалекты римских легионеров, французский язык) послужили фундаментом для появления у английского языка тех дистинктивных признаков, которые отличают его и по сей день: ацентризм, высокая степень подвижности лексического состава, значительный деривационный потенциал, стремление к экономии языковых средств и достаточно свободное обращение с языковыми нормами. Последнее качество связано в том числе с длительным отсутствием единого национального, политического и языкового центра в Британии, а также преимущественно маргинальным характером использования английского языка в устном общении. В работе отмечается необходимость дальнейшего исследования грамматической структуры английского языка на всем протяжении его эволюции с целью более глубокого понимания последствий влияния полиглоссной среды не только на его лексический состав, но и на статусную составляющую. The paper draws comparisons between the stages in the history of the English language developing in the multilingual environment and its status of a macromediator in the modern world. The research is based on two fundamental methods: the comparative historical method that assists in observing the development of English in the diachronic perspective and its co-existence with other languages in anisotropic linguistic situation of that time and the dialectical one directed at identifying such contradicting directions of the language system evolution as integration and disintegration, standardization and individualization, centrism and acentrism. The evolution of classifying English language origin (Teutonic group in the 17th and 18th centuries, Anglofrisian group in the 19th century and West Germanic group in the 20th century) is rooted in the changes of intralinguistic nature caused by a range of extralinguistic factors. On the one hand, island distribution of the language areal, hard accessibility of the territory, and therefore their isolation, and on the other hand, attractiveness of this land due to favorable conditions (mild climate, diverse landscape, rich flora and fauna), Christianization, active trade relationships leading to permanent polyglossia of linguistic environment (Celtic, Germanic, Scandinavian dialects, classical and vulgar Latin, various languages of Roman legionaries, French) were the reasons why the English language obtained and has maintained till the present time such peculiar distinctive properties as acentrism, high level of lexical mobility, substantial derivational potential, economy of linguistic means and rather free manipulations with language standards. The latter is also connected with long-term absence of the unified national, political and language center in Britain and mostly marginal usage of the language predominantly in the oral form. The authors also insist on the need to further look into the grammatical structure of the English language throughout its evolution in order to better understand the consequences of the polyglossian environment not only on its vocabulary but also the status constituent.

S2 Open Access 2024
PERIODIZATION OF THE FORMATION OF ENGLISH IN THE CONTEXT OF THE BORROWING PROCESS

L. Vorobiova

Objective. The objective of the article is to identify periodization of the formation of English in the context of the borrowing process; to analyze the historical and lexical and aspects of the borrowings integration in the context of the English language formation. Methods. The main scientific results are obtained using the historical method of theoretical generalization, which makes it possible to determine the nature of borrowings’ periodization; comparative - to compare historical phenomena, events and facts of the socio-cultural life and to establish similarities and differences in the adaptation of the borrowings at different stages of their integration into English. Results. The theoretical analysis of the nature of the borrowings makes it possible to identify the periods of possible periodization that enables effective intercultural studies in the fields of linguistics, philology, terminology. Interpretation and analysis of the genesis of possible periods will lead to successful management of the educational process for philology and history students. Four periods are identified. The first period is characterized with the migration of Germanic tribes of Angles, Saxons, and Jutes to Britain begins. During this time, there was a strong influence of Latin and Scandinavian languages due to the conquests. The second period is marked by significant changes in grammar, simplification of cases and the disappearance of many endings. The third period can be marked by the Great Vowel Shift, a massive phonetic restructuring of English sounds. This period is associated with the growing influence of the Renaissance and printing, which contributed to the standardization of the English language. The fourth period is characterized by the stabilization of the language structure and its vocabulary. In addition to the process of borrowing, modern English is characterised by another wave of vocabulary enrichment caused by three main factors: the unprecedented growth of scientific vocabulary and the emergence of the American version of English. References: Verba, L. (2006). Istoriia anhliiskoi movy [History of the English language]. Vinnytsya, Nova Knyha Publ., 296 p. Amiot, (2004). Haut degré et préfixation. In F. Lefeuvre & M. Noailly (eds.), Intensité, Comparaison, Degré. Travaux linguistiques du Cerlico, no. 17, pp. 91‒104 Anttila, R. (1989). Historical and Comparative Linguistics. Amsterdam, ohn Benjamins , 370 p. Baugh, (1978). History of the English language. Th. Cable. London, Pearson Education Publ., 398 p. Berndt, (1989). A history of the English language. Leipzig, Verlag Enzyklopedie Publ., 240 p. Bortone, (2010). Greek prepositions: from antiquity to the present. Oxford, OxfordUniversity Press Publ., 380 p. Crystal, (2004). The Stories of English. London, Penguin Publ., 400 p. Hoffer, L. (2005). Language Borrowing and the Indices of Adaptability and Receptivity. Intercultural Communication Studies, no. XIV: 2, pp. 53‒72 Hoffer, L. (2002). Language Borrowing and Language Diffusion: an Overview. Intercultural Communication Studies, no. XI-2, pp. 1‒36 Haugen, (1950). The analysis of linguistic borrowing. Language. no. 26.2, pp. 211‒ 231 Jespersen, (1946). Growth and Structure of the English Language. New York, Doubleday & Anchor Publ., 376 p. Matras, , & Sakel J. (2007). Introduction. Grammatical Borrowing in Cross-Linguistic Perspective. Berlin & New York, Mouton de Gruyter Publ., 220 p. Oxford English dictionary. Available at: https://www.oed.com

S2 Open Access 2024
Trihvaa, uka-uka ja teised peitmismängud Eestis 20. sajandil

A. Tuisk

Even though Estonia underwent significant societal changes in the 20th century, Estonian children played exciting running and hiding games both at the beginning and end of the century. The game repertoire evolved throughout these hundred years, with some running and hiding games being introduced, and others forgotten. My article focuses on the points of contact between Estonian games and those of neighbouring peoples, their distribution in Estonia, and the changes the games underwent, along with the reasons behind these changes. The article explores various Estonian running and hiding games, such as peitus or hide-and-seek, ukraadina (cf. Russian ukradina ‘lost’ or ‘stolen’) also known as uka-uka (Block, Forty-Forty, cf. also Russian tuki-tuki), the wall tag game trihvaa/trihvaater (cf. German Trivater, Verstecken mit Anschlagen), the hiding game kopupeit, involving knocking, the game of casting a stick called paalka viskamine, and the game of 12 (10) sticks. As to my sources, I have extensively used descriptions of games archived and held in the Estonian Folklore Archives at the Estonian Literary Museum. Nationwide competitions for collecting games were conducted in the years 1934–1935 and again in 1992 but recording and transcribing of the games continued throughout the intervening years. The games discussed here fall between the categories of running and hiding games. For the sake of clarity and based on one of the primary activities of these games, I will refer to them as hiding games. In all these games, there is one caller (or occasionally two) and several players (“hiders”), and the tagging is done in a specific manner at a designated spot. The players use either one stick or several, touching the spot with one’s hand or knocking, while reciting specific words. Only the game of hide-and-seek does not necessarily involve tagging or running to a specific spot before time runs out, as the caller simply has to find all the hiding players. Typically, the first player found becomes the caller in the next round of the game. Hiding games are known internationally. Located in Eastern Europe, Estonia has been influenced by the Eastern Slavic, Germanic, and Scandinavian cultural spheres, and close contacts with other nations are reflected also in the spread of the game repertoire. The name for the game trihvaa was most likely adopted by Estonian children by mediation of Baltic Germans from the (Low) German language, while other names (ukraadina, uka-uka, and tuki-tuki) suggest the Russian origin of the games. Children’s folklore preserves the old, but it is also receptive to the new. Thus, in the 20th century, the tradition of hiding games reveals the preservation of the older tradition but also the changing of the games and the rapid adoption of newer developments. The games have reached us by different routes and at different times, and this is reflected in their names and distribution. The changes took place fairly rapidly; for example, the little-known ukraadina evolved into the highly popular uka-uka in the northern part of Estonia in just 25 years. At the same time, a similar game, trihvaa, has retained its original name and localisation in South Estonia. Another game with similar rules is called tuki-tuki, a name that emerged in the second half of the 20th century. The game has the same name in the Russian language and among Russian-speaking Estonian children. Its sporadic spread in Estonia (e.g., in Pärnu and Viru counties) suggests that the game was introduced in Estonia by the Russian-speaking population. By the end of the 20th century, all the mentioned games had begun to resemble each other. Several tag games involving knocking with a stick, such as kopupeit and paalka viskamine, the latter being of religious origin from the Seto region, were no longer part of children’s game repertoire by the end of the century. Also, tagging or knocking with a stick disappeared from the games of ukraadina and trihvaa, possibly due to a trend towards simplification in the games or influenced by the same shift in the respective Russian tradition. After the Second World War, most likely in the 1950s–1960s, the game of 12 (10) sticks appeared in the game tradition. A similar game is also known in Finland, Russia, and elsewhere in Eastern Europe. The appeal of novelty and the close interaction between children of different ethnic backgrounds are factors contributing to the renewal of these games, yet so is also the diminishing interaction between local generations of children, playing in joint playgroups. As a result, a game (e.g., trihvaa) could take on a new name (e.g., tuki-tuki in Pärnu), while the gameplay remained the same. At the same time, the adaptation of the names of the games (e.g., the origin of the name uka-uka, and its colloquial designations triff, trihvakas, ukakas) indicates that games are not merely adopted but also modified to suit one’s language and mindset. Despite the disruptions of the Second World War (1939–1945) and the ensuing Soviet occupation (1944–1991) on the settlement structure and population composition in Estonia, different periods of the 20th century were rather favourable for the adaptation of games. Games played previously mainly in agrarian settings were adapted to different circumstances in the increasingly urbanised environment and to changes in children’s lifestyle. The tradition of children’s outdoor games continued in a lively and active lore group. The changes in the game tradition related to technological advancements and the advent of online gaming, however, fall outside the scope of this study.

arXiv Open Access 2024
Assured Automatic Programming via Large Language Models

Martin Mirchev, Andreea Costea, Abhishek Kr Singh et al.

With the advent of AI-based coding engines, it is possible to convert natural language requirements to executable code in standard programming languages. However, AI-generated code can be unreliable, and the natural language requirements driving this code may be ambiguous. In other words, the intent may not be accurately captured in the code generated from AI-coding engines like Copilot. The goal of our work is to discover the programmer intent, while generating code which conforms to the intent and a proof of this conformance. Our approach to intent discovery is powered by a novel repair engine called program-proof co-evolution, where the object of repair is a tuple (code, logical specification, test) generated by an LLM from the same natural language description. The program and the specification capture the initial operational and declarative description of intent, while the test represents a concrete, albeit partial, understanding of the intent. Our objective is to achieve consistency between the program, the specification, and the test by incrementally refining our understanding of the user intent. Reaching consistency through this repair process provides us with a formal, logical description of the intent, which is then translated back into natural language for the developer's inspection. The resultant intent description is now unambiguous, though expressed in natural language. We demonstrate how the unambiguous intent discovered through our approach increases the percentage of verifiable auto-generated programs on a recently proposed dataset in the Dafny programming language.

en cs.SE, cs.LG
arXiv Open Access 2024
AniFrame: A Programming Language for 2D Drawing and Frame-Based Animation

Mark Edward M. Gonzales, Hans Oswald A. Ibrahim, Elyssia Barrie H. Ong et al.

Creative coding is an experimentation-heavy activity that requires translating high-level visual ideas into code. However, most languages and libraries for creative coding may not be adequately intuitive for beginners. In this paper, we present AniFrame, a domain-specific language for drawing and animation. Designed for novice programmers, it (i) features animation-specific data types, operations, and built-in functions to simplify the creation and animation of composite objects, (ii) allows for fine-grained control over animation sequences through explicit specification of the target object and the start and end frames, (iii) reduces the learning curve through a Python-like syntax, type inferencing, and a minimal set of control structures and keywords that map closely to their semantic intent, and (iv) promotes computational expressivity through support for common mathematical operations, built-in trigonometric functions, and user-defined recursion. Our usability test demonstrates AniFrame's potential to enhance readability and writability for multiple creative coding use cases. AniFrame is open-source, and its implementation and reference are available at https://github.com/memgonzales/aniframe-language.

en cs.PL, cs.HC
arXiv Open Access 2024
Leveraging Large Language Models to Boost Dafny's Developers Productivity

Álvaro Silva, Alexandra Mendes, João F. Ferreira

This research idea paper proposes leveraging Large Language Models (LLMs) to enhance the productivity of Dafny developers. Although the use of verification-aware languages, such as Dafny, has increased considerably in the last decade, these are still not widely adopted. Often the cost of using such languages is too high, due to the level of expertise required from the developers and challenges that they often face when trying to prove a program correct. Even though Dafny automates a lot of the verification process, sometimes there are steps that are too complex for Dafny to perform on its own. One such case is that of missing lemmas, i.e. Dafny is unable to prove a result without being given further help in the form of a theorem that can assist it in the proof of the step. In this paper, we describe preliminary work on a new Dafny plugin that leverages LLMs to assist developers by generating suggestions for relevant lemmas that Dafny is unable to discover and use. Moreover, for the lemmas that cannot be proved automatically, the plugin also attempts to provide accompanying calculational proofs. We also discuss ideas for future work by describing a research agenda on using LLMs to increase the adoption of verification-aware languages in general, by increasing developers productivity and by reducing the level of expertise required for crafting formal specifications and proving program properties.

en cs.SE, cs.LO
DOAJ Open Access 2023
The Concept of the Grotesque in Literature: Friedrich Dürrenmatt’s Play The Physicists and Its Turkish Translation

Meltem Kılıç, Arsun Uras

The grotesque is a form of humor in which contradictory concepts are intertwined and first emerged in the West. Although initially a genre used in the fine arts, it later played an important role in world literature and influenced non-Western literature. The main purposes of this study are to examine the Turkish translation of Die Physiker (The Physicists), a two-act play with grotesque elements written by the Swiss author and painter Friedrich Dürrenmatt, one of the most important representatives of this genre to be introduced to Türkiye through translation who glorified this concept in both his paintings and plays and successfully displayed all its features, and to discuss the reflection of the grotesque in the target language and culture. To this end, the study analyzes the translation decisions of translator Mustafa Tüzel in his 2005 translation and questions the function of this translation in the Turkish literary system. The concept of the grotesque and its characteristics are discussed alongside its place and importance in Dürrenmatt’s life through the play Die Physiker and its translation. The aims here are to show how the author’s character is as prone to the grotesque as his view of the world and to draw attention to the fact that his close relationship with this genre can be a great help in creating grotesque works. The study does not evaluate the work through the concept of performability due to the present edition of the examined work being intended for literary readers.

German literature, Germanic languages. Scandinavian languages
S2 Open Access 2023
Kantasaamesta eteläkantasaameen, osa 2

Jaakko Häkkinen, Minerva Piha

Viime vuonna esitimme Sananjalassa lainasanojen todistukseen perustaen, että eteläsaameen johtava kielilinja olisi eronnut ensimmäisenä myöhäiskantasaamelaisesta yhteydestä. Ajoitimme eteläsaamen luoteisgermaanisissa ja kantaskandinaavisissa lainasanoissa näkyvien äännekorvausten perusteella eteläkantasaamen saapumisen Keski-Skandinaviaan jo vuoden 200 jaa. tienoille.      Tässä artikkelissa tarkastelemme eteläisten saamelaiskielten äännehistoriaa: mitkä äänteenmuutokset voidaan sijoittaa siihen kielilinjaan, jota kutsumme eteläkantasaameksi ja mitä äänteenmuutoksia on tapahtunut siinä kielilinjassa, joka yhdistää kaikkia muita saamen kieliä ja jota kutsumme myöhäiskantasaamen toiseksi vaiheeksi.      Keskeisimmät aineistomme ovat Yhteissaamelainen sanasto sekä kuolleesta gävlensaamen kielestä 1700-luvulla kerätty sanasto. Näiden aineistojen sanoissa näkyvien erojen avulla pyrimme rekonstruoimaan eteläkantasaamessa tapahtuneita äänteenmuutoksia. Esitämme yhtäältä sellaisia äänteenmuutoksia, jotka ovat tapahtuneet kaikkien muiden paitsi eteläisimpien saamelaiskielten yhteisessä kantakielessä, ja toisaalta sellaisia äänteenmuutoksia, jotka ovat tapahtuneet vain eteläisten saamelaiskielten yhteisessä kantakielessä. Käsittelemme yhteensä yhdeksän äänteenmuutosta.      Lopuksi sommittelemme yhteen viime vuonna julkaistussa artikkelissamme germaanisten lainasanojen perusteella laatimamme absoluuttisen kronologian ja äänteenmuutosten suhteellisen kronologian. Nämä kaksi kronologiaa yhdistämällä saamme kokonaiskronologian, jonka perusteella toteamme, että äänteenmuutokset tukevat jo viime vuoden Sananjalassa julkaistun artikkelimme tuloksia siitä, että eteläsaamen esimuoto eteläkantasaame todella erosi yhteisestä myöhäiskantasaamelaisesta kielestä hyvin varhaisessa vaiheessa.   From Proto-Saami to Southern Proto-Saami, part two: Evidence of historical phonology with regard to the divergence of Southern SaamiOur first Sananjalka article (vol. 62, 2020), which was based on different sound substitutions in Proto-Scandinavian loanwords, discussed that Southern Proto-Saami was the first language to diverge from the uniform Late Proto-Saami. We also elaborated on an absolute chronology, by linking Saami reconstruction stages to Germanic and Scandinavian reconstruction stages, and concluded that the disintegration of Late Proto-Saami occurred around 200 CE. This second article focuses on the historical phonology of the three southern Saami languages:Southern Saami, Ume Saami, and Gävle Saami. Gävle Saami is a designation for an extinct Saami vernacular previously spoken in the Gävle region of Sweden, found 200 kilometres north of Stockholm. During the late 18th century, Per Holmberger wrote down a list of over 1,600 words with Swedish meanings, compiled and analysed by Lars-Gunnar Larsson (Per Holmberger och sockenlapparnas språk, 2018). This language shares some sound changes with both South and Ume Saami, but it does not belong to either of these languages. We argue that (1) the assumed western Saami sound changes only spread to the three southernSaami languages, (2) there are several sound changes shared by all the other Saami languages except the three southern languages, and (3) there are several sound changes shared by the three southern Saami languages only. Our research presents reconstructions for a great deal of words in both Late Proto-Saami and Southern Proto-Saami. We conclude by creating a chronology, by connecting the sound changes via anchor sounds to the chronology based on the sound substitutions presented in our previous article.

arXiv Open Access 2023
Disco: A Functional Programming Language for Discrete Mathematics

Brent A. Yorgey

Disco is a pure, strict, statically typed functional programming language designed to be used in the setting of a discrete mathematics course. The goals of the language are to introduce students to functional programming concepts early, and to enhance their learning of mathematics by providing a computational platform for them to play with. It features mathematically-inspired notation, property-based testing, equirecursive algebraic types, subtyping, built-in list, bag, and finite set types, a REPL, and student-focused documentation. Disco is implemented in Haskell, with source code available on GitHub [https://github.com/disco-lang/disco], and interactive web-based REPL available through replit [https://replit.com/@BrentYorgey/Disco#README.md].

en cs.PL, cs.DM
arXiv Open Access 2023
Soda: An Object-Oriented Functional Language for Specifying Human-Centered Problems

Julian Alfredo Mendez

We present Soda (Symbolic Objective Descriptive Analysis), a language that helps to treat qualities and quantities in a natural way and greatly simplifies the task of checking their correctness. We present key properties for the language motivated by the design of a descriptive language to encode complex requirements on computer systems, and we explain how these key properties must be addressed to model these requirements with simple definitions. We give an overview of a tool that helps to describe problems in an easy way that we consider more transparent and less error-prone.

en cs.PL, cs.AI
arXiv Open Access 2023
Wasm SpecTec: Engineering a Formal Language Standard

Joachim Breitner, Philippa Gardner, Jaehyun Lee et al.

WebAssembly (Wasm) is a low-level bytecode language and virtual machine, intended as a compilation target for a wide range of programming languages, which is seeing increasing adoption across diverse ecosystems. As a young technology, Wasm continues to evolve -- it reached version 2.0 last year and another major update is expected soon. For a new feature to be standardised in Wasm, four key artefacts must be presented: a formal (mathematical) specification of the feature, an accompanying prose pseudocode description, an implementation in the official reference interpreter, and a suite of unit tests. This rigorous process helps to avoid errors in the design and implementation of new Wasm features, and Wasm's distinctive formal specification in particular has facilitated machine-checked proofs of various correctness properties for the language. However, manually crafting all of these artefacts requires expert knowledge combined with repetitive and tedious labor, which is a burden on the language's standardization process and authoring of the specification. This paper presents Wasm SpecTec, a technology to express the formal specification of Wasm through a domain-specific language. This DSL allows all of Wasm's currently handwritten specification artefacts to be error-checked and generated automatically from a single source of truth, and is designed to be easy to write, read, compare, and review. We believe that Wasm SpecTec's automation and meta-level error checking will significantly ease the current burden of the language's specification authors. We demonstrate the current capabilities of Wasm SpecTec by showcasing its proficiency in generating various artefacts, and describe our work towards replacing the manually written official Wasm specification document with specifications generated by Wasm SpecTec.

en cs.PL
arXiv Open Access 2023
A Formalisation of Core Erlang, a Concurrent Actor Language

Péter Bereczky, Dániel Horpácsi, Simon Thompson

In order to reason about the behaviour of programs described in a programming language, a mathematically rigorous definition of that language is needed. In this paper, we present a machine-checked formalisation of concurrent Core Erlang (a subset of Erlang) based on our previous formalisations of its sequential sublanguage. We define a modular, frame stack semantics, show how program evaluation is carried out with it, and prove a number of properties (e.g. determinism, confluence). Finally, we define program equivalence based on bisimulations and prove that side-effect-free evaluation is a bisimulation. This research is part of a wider project that aims to verify refactorings to prove that particular program code transformations preserve program behaviour.

en cs.PL
arXiv Open Access 2022
DPCL: a Language Template for Normative Specifications

Giovanni Sileno, Thomas van Binsbergen, Matteo Pascucci et al.

Several solutions for specifying normative artefacts (norms, contracts, policies) in a computational processable way have been presented in the literature. Legal core ontologies have been proposed to systematize concepts and relationships relevant to normative reasoning. However, no solution amongst those has achieved general acceptance, and no common ground (representational, computational) has been identified enabling us to easily compare them. Yet, all these efforts share the same motivation of representing normative directives, therefore it is plausible that there may be a representational model encompassing all of them. This presentation will introduce DPCL, a domain-specific language (DSL) for specifying higher-level policies (including norms, contracts, etc.), centred on Hohfeld's framework of fundamental legal concepts. DPCL has to be seen primarily as a "template", i.e. as an informational model for architectural reference, rather than a fully-fledged formal language; it aims to make explicit the general requirements that should be expected in a language for norm specification. In this respect, it goes rather in the direction of legal core ontologies, but differently from those, our proposal aims to keep the character of a DSL, rather than a set of axioms in a logical framework: it is meant to be cross-compiled to underlying languages/tools adequate to the type of target application. We provide here an overview of some of the language features.

en cs.AI, cs.FL
arXiv Open Access 2021
Deciding FO-definability of regular languages

Agi Kurucz, Vladislav Ryzhikov, Yury Savateev et al.

We prove that, similarly to known PSpace-completeness of recognising FO(<)-definability of the language L(A) of a DFA A, deciding both FO(<,C)- and FO(<,MOD)-definability are PSpace-complete. (Here, FO(<,C) extends the first-order logic FO(<) with the standard congruence modulo n relation, and FO(<,MOD) with the quantifiers checking whether the number of positions satisfying a given formula is divisible by a given n>1. These FO-languages are known to define regular languages that are decidable in AC0 and ACC0, respectively.) We obtain these results by first showing that known algebraic characterisations of FO-definability of L(A) can be captured by `localisable' properties of the transition monoid of A. Using our criterion, we then generalise the known proof of PSpace-hardness of FO(<)-definability, and establish the upper bounds not only for arbitrary DFAs but also for two-way NFAs.

en cs.LO, cs.FL
arXiv Open Access 2020
Scenic: A Language for Scenario Specification and Data Generation

Daniel J. Fremont, Edward Kim, Tommaso Dreossi et al.

We propose a new probabilistic programming language for the design and analysis of cyber-physical systems, especially those based on machine learning. Specifically, we consider the problems of training a system to be robust to rare events, testing its performance under different conditions, and debugging failures. We show how a probabilistic programming language can help address these problems by specifying distributions encoding interesting types of inputs, then sampling these to generate specialized training and test data. More generally, such languages can be used to write environment models, an essential prerequisite to any formal analysis. In this paper, we focus on systems like autonomous cars and robots, whose environment at any point in time is a 'scene', a configuration of physical objects and agents. We design a domain-specific language, Scenic, for describing scenarios that are distributions over scenes and the behaviors of their agents over time. As a probabilistic programming language, Scenic allows assigning distributions to features of the scene, as well as declaratively imposing hard and soft constraints over the scene. We develop specialized techniques for sampling from the resulting distribution, taking advantage of the structure provided by Scenic's domain-specific syntax. Finally, we apply Scenic in a case study on a convolutional neural network designed to detect cars in road images, improving its performance beyond that achieved by state-of-the-art synthetic data generation methods.

en cs.PL, cs.CV

Halaman 48 dari 16479