14 papers · ranked by Valyu relevance
Shuvendu K. Lahiri, Chao Wang, Paul Krogmeier, Umang Mathur + 3 more
'Adithya Murali' 'P. Madhusudan' 'Mahesh Viswanathan'] We identify a decidable synthesis problem for a class of programs of unbounded size with conditionals and iteration that work over infinite data domains. The programs in our class use uninterpreted functions and relations, and abide by a restriction called…
Jiatong Wu, Sen Wang, Kai Niu, Yifei She + 2 more
Classical Algorithmic Information Theory (AIT) provides a rigorous foundation for information-based similarity measurement, but classical formulations and their compression-based approximations largely operate at the syntactic level, making them sensitive to surface-level variation and insufficient for semantic…
Edward A. Lee, Albert M. K. Cheng
This paper is about better engineering of cyber-physical systems (CPSs) through better models. Deterministic models have historically proven extremely useful and arguably form the kingpin of the industrial revolution and the digital and information technology revolutions. Key deterministic models that have proven…
Günther Charwat, Wolfgang Dvořák, Sarah A. Gaggl, Johannes P. Wallner + 1 more
'Johannes P. Wallner' 'Stefan Woltran'] Within the last decade, abstract argumentation has emerged as a central field in Artificial Intelligence. Besides providing a core formalism for many advanced argumentation systems, abstract argumentation has also served to capture several non-monotonic logics and other AI…
Pavol Černý, Edmund M. Clarke, Thomas A. Henzinger, Arjun Radhakrishna + 3 more
We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is…
Shuvendu K. Lahiri, Chao Wang, Daniel Schemmel, Julian Büning + 3 more
'César Rodríguez' 'David Laprell' 'Klaus Wehrle'] We describe a technique for systematic testing of multi-threaded programs. We combine Quasi-Optimal Partial-Order Reduction, a state-of-the-art technique that tackles path explosion due to interleaving non-determinism, with symbolic execution to handle data…
Moritz Sinn, Florian Zuleger, Helmut Veith
Difference constraints have been used for termination analysis in the literature, where they denote relational inequalities of the form $x' \le y + c$, and describe that the value of x in the current state is at most the value of y in the previous state plus some constant $c \in \mathbb{Z}$. We believe that difference…
Rasha Omar, Mostafa Abbas, Ahmed El-Mahdy, Erven Rohou + 1 more
'Rafael Sachetto Oliveira'] With the widespread of multicore systems, automatic parallelization becomes more pronounced, particularly for legacy programs, where the source code is not generally available. An essential operation in any parallelization system is detecting data dependence among parallelization candidate…
Adrien Basso-Blandin, Franck Delaplace
The field of synthetic biology is looking forward engineering framework for safely designing reliable de-novo biological functions. In this undertaking, Computer-Aided-Design (CAD) environments should play a central role for facilitating the design. Although, CAD environment is widely used to engineer artificial…
Zoltan A. Kocsis, Jerry Swan
\usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varvec{+}$$\end{document} + Proof Search \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym}…
Cristina David, Daniel Kroening
Program synthesis is the mechanized construction of software, dubbed ‘self-writing code’. Synthesis tools relieve the programmer from thinking about how the problem is to be solved; instead, the programmer only provides a description of what is to be achieved. Given a specification of what the program should do, the…
Raymond Turner, Neal G. Anderson
Representation and abstraction are two of the fundamental concepts of computer science. Together they enable “high-level” programming: without abstraction programming would be tied to machine code; without a machine representation, it would be a pure mathematical exercise. Representation begins with an abstract…
Robbert Krebbers
The core of a formal semantics of an imperative programming language is a memory model that describes the behavior of operations on the memory. Defining a memory model that matches the description of C in the C11 standard is challenging because C allows both high-level (by means of typed expressions) and low-level (by…
Mohamed A. El-Zawawy
This paper introduces new approaches for the analysis of frequent statement and dereference elimination for imperative and object-oriented distributed programs running on parallel machines equipped with hierarchical memories. The paper uses languages whose address spaces are globally partitioned. Distributed programs…