Výsledky vyhľadávania - Theory of computation→Programming logic
-
1
Automatic Loop Invariant Generation for Data Dependence Analysis
ISSN: 2575-5099Vydavateľské údaje: ACM 01.05.2022Vydané v 2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE) (01.05.2022)“…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…”
Získať plný text
Konferenčný príspevok.. -
2
Alignment Completeness for Relational Hoare Logics
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…Relational Hoare logics (RHL) provide rules for reasoning about relations between programs…”
Získať plný text
Konferenčný príspevok.. -
3
A Logic for Locally Complete Abstract Interpretations
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…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…”
Získať plný text
Konferenčný príspevok.. -
4
NECTAR: non-interactive smart contract protocol using blockchain technology
ISBN: 9781450357265, 1450357261Vydavateľské údaje: New York, NY, USA ACM 27.05.2018Vydané v 2018 IEEE ACM 1st International Workshop on Emerging Trends in Software Engineering for Blockchain (WETSEB) (27.05.2018)“…Blockchain-driven technologies are considered disruptive because of the availability of dis-intermediated, censorship-resistant and tamper-proof digital…”
Získať plný text
Konferenčný príspevok.. -
5
A model building framework for answer set programming with external computations
ISSN: 1471-0684, 1475-3081Vydavateľské údaje: Cambridge, UK Cambridge University Press 01.07.2016Vydané v Theory and practice of logic programming (01.07.2016)“…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…”
Získať plný text
Journal Article -
6
Program Equivalence is Coinductive
ISBN: 9781450343916, 1450343910Vydavateľské údaje: New York, NY, USA ACM 05.07.2016Vydané v Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (05.07.2016)“… Equational reasoning over comodels is known to be subtle. We identify a criterion on equational theories and classes of comodels that guarantees completeness…”
Získať plný text
Konferenčný príspevok.. -
7
Quantitative Monadic Second-Order Logic
ISBN: 1479904139, 9781479904136ISSN: 1043-6871Vydavateľské údaje: IEEE 01.06.2013Vydané v 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (01.06.2013)“…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…”
Získať plný text
Konferenčný príspevok.. -
8
Decidability and Complexity for Quiescent Consistency
ISBN: 9781450343916, 1450343910Vydavateľské údaje: New York, NY, USA ACM 05.07.2016Vydané v Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (05.07.2016)“…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…”
Získať plný text
Konferenčný príspevok.. -
9
Design and Implementation of Pavlovian Associative Memory Based on DNA Neurons
ISSN: 2162-237X, 2162-2388, 2162-2388Vydavateľské údaje: United States IEEE 01.04.2025Vydané v IEEE transaction on neural networks and learning systems (01.04.2025)“…) 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…”
Získať plný text
Journal Article -
10
Lovász-Type Theorems and Game Comonads
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…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…”
Získať plný text
Konferenčný príspevok.. -
11
An Empirical Comparison of Dynamic Impact Analysis Algorithms
ISBN: 9780769521633, 0769521630ISSN: 0270-5257Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 23.05.2004Vydané v International Conference on Software Engineering: Proceedings of the 26th International Conference on Software Engineering; 23-28 May 2004 (23.05.2004)“…Impact analysis determining the potential effects of changes on a software system plays an important role in software engineering tasks such as maintenance,…”
Získať plný text
Konferenčný príspevok.. -
12
Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory
ISBN: 1479904139, 9781479904136ISSN: 1043-6871Vydavateľské údaje: IEEE 01.06.2013Vydané v 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (01.06.2013)“…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…”
Získať plný text
Konferenčný príspevok.. -
13
Precise Modeling of Design Patterns in UML
ISBN: 9780769521633, 0769521630ISSN: 0270-5257Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 23.05.2004Vydané v International Conference on Software Engineering: Proceedings of the 26th International Conference on Software Engineering; 23-28 May 2004 (23.05.2004)“…Prior research attempts to formalize the structure ofobject-oriented design patterns for a more precisespecification of design patterns. It also allows…”
Získať plný text
Konferenčný príspevok.. -
14
Past and present (and future) of parallel and distributed computation in (constraint) logic programming
ISSN: 1471-0684, 1475-3081Vydavateľské údaje: Cambridge, UK Cambridge University Press 01.09.2018Vydané v Theory and practice of logic programming (01.09.2018)“… The potential for transparent exploitation of parallelism in logic programming emerged almost immediately with the birth of the paradigm (Pollard 1981)…”
Získať plný text
Journal Article -
15
A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation
ISSN: 1471-0684, 1475-3081Vydavateľské údaje: Cambridge, UK Cambridge University Press 01.09.2019Vydané v Theory and practice of logic programming (01.09.2019)“…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…”
Získať plný text
Journal Article -
16
Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…In logics with the Craig interpolation property (CIP) the existence of an interpolant for an implication follows from the validity of the implication…”
Získať plný text
Konferenčný príspevok.. -
17
Some constructive variants of S4 with the finite model property
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…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…”
Získať plný text
Konferenčný príspevok.. -
18
The Evaluation of Large, Complex UML Analysis and Design Models
ISBN: 9780769521633, 0769521630ISSN: 0270-5257Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 23.05.2004Vydané v International Conference on Software Engineering: Proceedings of the 26th International Conference on Software Engineering; 23-28 May 2004 (23.05.2004)“…This paper describes techniques for analyzing largeUML models. The first part of the paper describesheuristics and processes for creating semantically…”
Získať plný text
Konferenčný príspevok.. -
19
Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… Most notably, every problem definable in first-order logic can be solved in linear time on bounded expansion graph classes…”
Získať plný text
Konferenčný príspevok.. -
20
A Quantum Interpretation of Bunched Logic & Quantum Separation Logic
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…We propose a model of the substructural logic of Bunched Implications (BI) that is suitable for reasoning about quantum states…”
Získať plný text
Konferenčný príspevok..

