Search Results - Theory of computation→Programming logic

Automatic Loop Invariant Generation for Data Dependence Analysis by Tabar, Asmae Heydari, Bubel, Richard, Hahnle, Reiner

“…Parallelization of programs relies on sound and precise analysis of data dependences in the code, specifically, when dealing with loops. State-of-art tools are…”
Get full text

Alignment Completeness for Relational Hoare Logics by Nagasamudram, Ramana, Naumann, David A.

“…Relational Hoare logics (RHL) provide rules for reasoning about relations between programs…”
Get full text

A Logic for Locally Complete Abstract Interpretations by Bruni, Roberto, Giacobazzi, Roberto, Gori, Roberta, Ranzato, Francesco

“…We introduce the notion of local completeness in abstract interpretation and define a logic for proving both the correctness and incorrectness of some program specification…”
Get full text

NECTAR: non-interactive smart contract protocol using blockchain technology by Covaci, Alexandra, Madeo, Simone, Motylinski, Patrick, Vincent, Stéphane

“…Blockchain-driven technologies are considered disruptive because of the availability of dis-intermediated, censorship-resistant and tamper-proof digital…”
Get full text

A model building framework for answer set programming with external computations by EITER, THOMAS, FINK, MICHAEL, IANNI, GIOVAMBATTISTA, KRENNWALLNER, THOMAS, REDL, CHRISTOPH, SCHÜLLER, PETER

“…As software systems are getting increasingly connected, there is a need for equipping nonmonotonic logic programs with access to external sources that are possibly remote and may contain information…”
Get full text

Program Equivalence is Coinductive by Pattinson, Dirk, Schröder, Lutz

“… Equational reasoning over comodels is known to be subtle. We identify a criterion on equational theories and classes of comodels that guarantees completeness…”
Get full text

Quantitative Monadic Second-Order Logic by Kreutzer, Stephan, Riveros, Cristian

“…While monadic second-order logic is a prominent logic for specifying languages of finite words, it lacks the power to compute quantitative properties, e.g. to count…”
Get full text

Decidability and Complexity for Quiescent Consistency by Dongol, Brijesh, Hierons, Robert M.

“…Quiescent consistency is a notion of correctness for a concurrent object that gives meaning to the object's behaviours in quiescent states, i.e., states in…”
Get full text

Design and Implementation of Pavlovian Associative Memory Based on DNA Neurons by Sun, Junwei, Xu, Wanting, Liu, Peng, Wang, Yanfeng

“…) technology performs well in computation, programming, and information processing. In this article, the multiplication gate, addition gate, and threshold gate based on DSD are used to cascade into a single DNA neuron…”
Get full text

Lovász-Type Theorems and Game Comonads by Dawar, Anuj, Jakl, Tomas, Reggio, Luca

“…Lovász (1967) showed that two finite relational structures A and B are isomorphic if, and only if, the number of homomorphisms from C to A is the same as the…”
Get full text

An Empirical Comparison of Dynamic Impact Analysis Algorithms by Orso, Alessandro, Apiwattanapong, Taweesup, Law, James, Rothermel, Gregg, Harrold, Mary Jean

“…Impact analysis determining the potential effects of changes on a software system plays an important role in software engineering tasks such as maintenance,…”
Get full text

Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory by Colcombet, Thomas

“…Cost monadic logic extends monadic second-order logic with the ability to measure the cardinality of sets and comes with decision procedures for boundedness related questions…”
Get full text

Precise Modeling of Design Patterns in UML by Mak, Jeffrey K. H., Choy, Clifford S. T., Lun, Daniel P. K.

“…Prior research attempts to formalize the structure ofobject-oriented design patterns for a more precisespecification of design patterns. It also allows…”
Get full text

Past and present (and future) of parallel and distributed computation in (constraint) logic programming by FIORETTO, FERDINANDO, PONTELLI, ENRICO

“… The potential for transparent exploitation of parallelism in logic programming emerged almost immediately with the birth of the paradigm (Pollard 1981)…”
Get full text

Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments by Jung, Jean Christoph, Wolter, Frank

“…In logics with the Craig interpolation property (CIP) the existence of an interpolant for an implication follows from the validity of the implication…”
Get full text

A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation by DAS, ARIYAM, ZANIOLO, CARLO

“…A large class of traditional graph and data mining algorithms can be concisely expressed in Datalog, and other Logic-based languages, once aggregates are allowed in recursion…”
Get full text

Some constructive variants of S4 with the finite model property by Balbiani, Philippe, Dieguez, Martin, Fernandez-Duque, David

“…The logics CS4 and IS4 are intuitionistic variants of the modal logic S4. Whether the finite model property holds for each of these logics has been a long-standing open problem…”
Get full text

The Evaluation of Large, Complex UML Analysis and Design Models by Berenbach, Brian

“…This paper describes techniques for analyzing largeUML models. The first part of the paper describesheuristics and processes for creating semantically…”
Get full text

Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes by Dreier, Jan

“… Most notably, every problem definable in first-order logic can be solved in linear time on bounded expansion graph classes…”
Get full text

A Quantum Interpretation of Bunched Logic & Quantum Separation Logic by Zhou, Li, Barthe, Gilles, Hsu, Justin, Ying, Mingsheng, Yu, Nengkun

“…We propose a model of the substructural logic of Bunched Implications (BI) that is suitable for reasoning about quantum states…”
Get full text