English
Related papers

Related papers: Z Specification for the W3C Editor's Draft Core SH…

200 papers

Formal specifications play a pivotal role in accurately characterizing program behaviors and ensuring software correctness. In recent years, leveraging large language models (LLMs) for the automatic generation of program specifications has…

Software Engineering · Computer Science 2026-02-03 Zehan Chen , Long Zhang , Zhiwei Zhang , JingJing Zhang , Ruoyu Zhou , Yulong Shen , JianFeng Ma , Lin Yang

For years, Integrated Development Environments have demonstrated their usefulness in order to ease the development of software. High-level security or safety systems require proofs of compliance to standards, based on analyses such as code…

Programming Languages · Computer Science 2014-04-29 François Pessaux

Controlled natural languages (CNL) with a direct mapping to formal logic have been proposed to improve the usability of knowledge representation systems, query interfaces, and formal specifications. Predictive editors are a popular approach…

Computation and Language · Computer Science 2013-03-12 Tobias Kuhn

SPARQL CONSTRUCT queries allow for the specification of data processing pipelines that transform given input graphs into new output graphs. It is now common to constrain graphs through SHACL shapes allowing users to understand which data…

Databases · Computer Science 2024-05-22 Philipp Seifer , Daniel Hernández , Ralf Lämmel , Steffen Staab

Having the difficulty of solving the semantic gap between images and texts for the image captioning task, conventional studies in this area paid some attention to treating semantic concepts as a bridge between the two modalities and…

Computer Vision and Pattern Recognition · Computer Science 2023-11-29 Ting Wang , Weidong Chen , Yuanhe Tian , Yan Song , Zhendong Mao

This document specifies a core version of the type theory implemented in the Cedille tool. Cedille is a language for dependently typed programming and computer-checked proof. Cedille can elaborate source programs down to Cedille Core, which…

Logic in Computer Science · Computer Science 2018-11-06 Aaron Stump

Strictness analysis is critical to efficient implementation of languages with non-strict evaluation, mitigating much of the performance overhead of laziness. However, reasoning about strictness at the source level can be challenging and…

Programming Languages · Computer Science 2026-01-12 Daniel Sainati , Joseph W. Cutler , Benjamin C. Pierce , Stephanie Weirich

Large Language Models (LLMs) are increasingly being used to automate programming tasks. Yet, LLMs' capabilities in reasoning about program semantics are still inadequately studied, leaving significant potential for further exploration. This…

Programming Languages · Computer Science 2025-05-30 Thanh Le-Cong , Bach Le , Toby Murray

CHERI-C extends the C programming language by adding hardware capabilities, ensuring a certain degree of memory safety while remaining efficient. Capabilities can also be employed for higher-level security measures, such as software…

Logic in Computer Science · Computer Science 2023-04-26 Seung Hoon Park , Rekha Pai , Tom Melham

This paper introduces time window temporal logic (TWTL), a rich expressivity language for describing various time bounded specifications. In particular, the syntax and semantics of TWTL enable the compact representation of serial tasks,…

Formal Languages and Automata Theory · Computer Science 2016-02-16 Cristian-Ioan Vasile , Derya Aksaray , Calin Belta

The code review comment (CRC) is pivotal in the process of modern code review. It provides reviewers with the opportunity to identify potential bugs, offer constructive feedback, and suggest improvements. Clear and concise code review…

Software Engineering · Computer Science 2025-04-25 Junkai Chen , Zhenhao Li , Qiheng Mao , Xing Hu , Kui Liu , Xin Xia

In this paper we present a possible way how a precise semantics of object oriented modeling techniques can be achieved and what the possible benefits are .We outline the main modeling techniques used in the SysLab project sketch how a…

Software Engineering · Computer Science 2014-09-25 Ruth Breu , Radu Grosu , Franz Huber , Bernhard Rumpe , Wolfgang Schwerin

The semantics of notation systems can naturally be meta-modelled as a network of transformations, starting with the syntactic elements of the notation and ending with the parameters of an execution. In this context, a digital encoding…

Programming Languages · Computer Science 2024-10-30 Markus Lepper , Baltasar Trancón y Widemann

The goal of this paper is to help mainstream programmers routinely use formal verification on their smart contracts by 1) proposing a new YAML-format for writing general-purpose formal specifications, 2) demonstrating how a formal…

Programming Languages · Computer Science 2019-12-09 Suhabe Bugrara

This preprint specifies quality requirements for a core ontology whose ontological elements such as terms, non-taxonomic relationships, among others, are based on a foundational ontology. The quality requirements are represented in a…

Software Engineering · Computer Science 2021-10-04 Luis Olsina , Maria Fernanda Papa , Guido Tebes , Pablo Becker

Constraint Handling Rules (CHR) is a rule-based programming language which is typically embedded into a general-purpose language. There exists a plethora of implementations for numerous host languages. However, the existing implementations…

Programming Languages · Computer Science 2026-01-08 Sascha Rechenberger , Thom Frühwirth

Syntax-directed translation tools require the specification of a language by means of a formal grammar. This grammar must conform to the specific requirements of the parser generator to be used. This grammar is then annotated with semantic…

Programming Languages · Computer Science 2015-01-12 Fernando Berzal , Francisco J. Cortijo , Juan-Carlos Cubero , Luis Quesada

Linearizability is a widely accepted notion of correctness for concurrent objects. Recent research has investigated redefining linearizability for particular hardware weak memory models, in particular for TSO. In this paper, we provide an…

Logic in Computer Science · Computer Science 2019-07-03 Graeme Smith , Kirsten Winter , Robert J. Colvin

We consider infinite sequences of symbols, also known as streams, and the decidability question for equality of streams defined in a restricted format. This restricted format consists of prefixing a symbol at the head of a stream, of the…

Logic in Computer Science · Computer Science 2012-04-17 Clemens Grabmayer , Joerg Endrullis , Dimitri Hendriks , Jan Willem Klop , Lawrence S. Moss

By general case we mean methods able to process simplicial sets and chain complexes not of finite type. A filtration of the object to be studied is the heart of both subjects persistent homology and spectral sequences. In this paper we…

Computational Geometry · Computer Science 2014-04-01 Ana Romero , Jónathan Heras , Julio Rubio , Francis Sergeraert
‹ Prev 1 8 9 10 Next ›