Related papers: Calculating Valid Domains for BDD-Based Interactiv…
Context and motivation: Usage of Formal Specification languages is scarce in web application development as compared to safety critical/hardware systems. Question/problem: An apt formal specification language should provide the following…
This document describes syntax, semantics and implementation guidelines in order to enrich the DLV system with the possibility to make external C function calls. This feature is realized by the introduction of parametric external…
We prove implicit function theorems for mappings on topological vector spaces over valued fields. In the real and complex cases, we obtain implicit function theorems for mappings from arbitrary (not necessarily locally convex) topological…
This paper motivates the need for a formalism for the modelling and analysis of dynamic reconfiguration of dependable real-time systems. We present requirements that the formalism must meet, and use these to evaluate well established…
Description Logic Knowledge and Action Bases (KABs) have been recently introduced as a mechanism that provides a semantically rich representation of the information on the domain of interest in terms of a DL KB and a set of actions to…
In this talk we construct BPS-saturated domain walls in supersymmetric QCD, for any values of the masses of the chiral matter superfields. We compare our results to those already obtained in the literature and we also discuss their range of…
Network virtualization enables computing networks and data center (DC) providers to manage their networking resources in a flexible manner using software running on physical computers. In this paper, we address the existing issues with the…
In this talk, we will describe a framework for assertion-based verification (ABV) of quantum circuits by applying model checking techniques for quantum systems developed in our previous work, in which: (i) Noiseless and noisy quantum…
In this paper we present a rule based formalism for filtering variables domains of constraints. This formalism is well adapted for solving dynamic CSP. We take diagnosis as an instance problem to illustrate the use of these rules. A…
In this paper differential operators on various moduli spaces (e.g. of holomorphic vector bundles) are described in a canonical way in terms of the geometry of a certain distinguished completion of an appropriate configuration space.
Interactive theorem proving requires a lot of human guidance. Proving a property involves (1) figuring out why it holds, then (2) coaxing the theorem prover into believing it. Both steps can take a long time. We explain how to use GL, a…
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Boolean formulas that we call case-factor diagrams (CFDs). CFDs…
In this paper we use the the topological vertex formalism to calculate a generalization of the "domain wall" partition function of M-strings. This generalization allows calculation of partition function of certain compactified webs using a…
We propose a methodology for the automatic verification of safety properties of controllers based on dynamical systems, such as those typically used in avionics. In particular, our focus is on proving stability properties of software…
We classify dp-minimal integral domains, building off the existing classification of dp-minimal fields and dp-minimal valuation rings. We show that if R is a dp-minimal integral domain, then R is a field or a valuation ring or arises from…
This paper presents a new compressed representation of Boolean functions, called CFLOBDDs (for Context-Free-Language Ordered Binary Decision Diagrams). They are essentially a plug-compatible alternative to BDDs (Binary Decision Diagrams),…
Quantum branching programs (quantum binary decision diagrams, respectively) are a convenient tool for examining quantum computations using only a logarithmic amount of space. Recently several types of restricted quantum branching programs…
Authoritative Domain Name System (DNS) response selection defines query-time response selection based on resolver-visible context and per-answer metadata, yielding different observable outcomes for the same query under different conditions.…
We present a theory of parameterized dynamic logic, namely DLp, for specifying and reasoning about a rich set of program models based on their transitional behaviours. Different from most dynamic logics that deal with regular expressions or…
Component-based development (CBD) is a name, with which software development professionals are quite familiar. There are several models which have been proposed for CBD in last few years. They contain good features but there are some…