Automated Reasoning
8th International Joint Conference, IJCAR 2016, Coimbra, Portugal, June 27 – July 2, 2016, Proceedings
Chapter and Conference Paper
Source code plagiarism is a simple to finish task, yet exceptionally hard to identify without legitimate device support. Different source code recognition frameworks have been created to help distinguish sourc...
Chapter and Conference Paper
The problem of estimating and classifying age from a given input im- age is age old. With the advancement of modern technology and recent progress in the field of deep learning it has been made possible to gai...
Chapter and Conference Paper
We introduce a method to form and maintain a flock of drones only based on relative distance measurements. This means our approach is able to work in GPS-denied environments. It is fully distributed and theref...
Chapter and Conference Paper
This paper discusses the challenges and outcomes in designing the low-power PLL for digital applications. PLL being an important block for providing clocking scheme in many electronic circuits raises the requi...
Chapter and Conference Paper
Given a neural network (NN) and a set of possible inputs to the network described by polyhedral constraints, we aim to compute a safe over-approximation of the set of possible output values. This operation is ...
Chapter and Conference Paper
Inspired by the emerging problem of CPS security, we introduce the concept of controller-attacker games. A controller-attacker game is a two-player stochastic game, where the two players, a controller and an atta...
Book and Conference Proceedings
8th International Joint Conference, IJCAR 2016, Coimbra, Portugal, June 27 – July 2, 2016, Proceedings
Chapter and Conference Paper
Abstract interpretation is a powerful tool in program verification. Several commercial or industrial scale implementations of abstract interpretation have demonstrated that this approach can verify safety prop...
Chapter and Conference Paper
We present an approach for component-based program synthesis that uses two distinct interpretations for the symbols in the program. The first interpretation defines the semantics of the program. It is used to ...
Chapter and Conference Paper
Inconsistent code detection is a variant of static analysis that detects statements that never occur on feasible executions. This includes code whose execution ultimately must lead to an error, faulty error ha...
Chapter and Conference Paper
Cloud computing is an effort in delivering resources as a service. It represents a shift away from the era where products were purchased, to computing as a service that is delivered to consumers over the inter...
Chapter and Conference Paper
We present a method for the synthesis of polynomial lasso programs. These programs consist of a program stem, a set of transitions, and an exit condition, all in the form of algebraic assertions (conjunctions ...
Article
A rewrite closure is an extension of a term rewrite system with new rules, usually deduced by transitivity. Rewrite closures have the nice property that all rewrite derivations can be transformed into derivati...
Chapter and Conference Paper
This paper describes the HybridSAL relational abstracter – a tool for verifying continuous and hybrid dynamical systems. The input to the tool is a model of a hybrid dynamical system and a safety property. The...
Chapter and Conference Paper
In this paper, we define timed relational abstractions for verifying sampled data control systems. Sampled data control systems consist of a plant, modeled as a hybrid system and a synchronous controller, mode...
Chapter and Conference Paper
The field of rewriting is broadly concerned with manipulating representations of objects so that we go from a larger representation to a smaller representation. The field of rewriting has contributed some fundame...
Chapter and Conference Paper
In this paper, we define relational abstractions of hybrid systems. A relational abstraction is obtained by replacing the continuous dynamics in each mode by a binary transition relation that relates a state o...
Chapter and Conference Paper
Given a theory \(\mathbb{T}\) , a set of equations E, and a single equation e, the uniform word problem (UWP) is to dete...
Chapter and Conference Paper
This paper presents a constraint-based technique for discovering a rich class of inductive invariants (boolean combinations of polynomial inequalities of bounded degree) for verification of hybrid systems. The...
Chapter and Conference Paper
Termination and innermost termination are shown to be decidable for term rewrite systems whose right-hand side terms are restricted to be shallow (variables occur at depth at most one) and linear. Innermost te...