Results 1 to 10 of about 3,012,120 (253)
Beyond priming: a sequential, feedback-guided adjuvant framework for therapeutic cancer peptide vaccines in immunologically cold tumors [PDF]
Frontiers in ImmunologyTherapeutic cancer vaccines can generate measurable antigen-specific immune responses in humans, yet tumor regression is often incomplete, inconsistent, or short-lived. In immunologically cold tumors, this pattern may reflect not an absolute inability to
Corey K. Goldman, Corey K. Goldman
doaj +2 more sources
On logical constraints in logic programming [PDF]
Information and Computation, 1995 We introduce a new form of logic programming with constraints. The constraints that we consider are not restricted to statements on real numbers as in CLP(R), see Jaffar and Lassez [10]. Instead our constraints are arbitrary global constraints. The basic idea is that the applicability of a given rule is not predicated on the fact that individual ...
V. Wiktor Marek +2 more
+11 more sources
Verification of Imperative Programs by Constraint Logic Program Transformation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We present a method for verifying partial correctness properties of imperative programs that manipulate integers and arrays by using techniques based on the transformation of constraint logic programs (CLP).
Emanuele De Angelis +3 more
doaj +1 more source
Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Recent developments in termination analysis for declarative programs emphasize the use of appropriate models for the logical theory representing the program at stake as a generic approach to prove termination of declarative programs.
Salvador Lucas
doaj +1 more source
Verification of Programs via Intermediate Interpretation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We explore an approach to verification of programs via program transformation applied to an interpreter of a programming language. A specialization technique known as Turchin's supercompilation is used to specialize some interpreters with respect to the ...
Alexei P. Lisitsa, Andrei P. Nemytykh
doaj +1 more source
Bounded Symbolic Execution for Runtime Error Detection of Erlang Programs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 Dynamically typed languages, like Erlang, allow developers to quickly write programs without explicitly providing any type information on expressions or function definitions. However, this feature makes those languages less reliable than statically typed
Emanuele De Angelis +4 more
doaj +1 more source
Deterministic Temporal Logics and Interval Constraints [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 In temporal logics, a central question is about the choice of modalities and their relative expressive power, in comparison to the complexity of decision problems such as satisfiability.
Kamal Lodaya, Paritosh K. Pandya
doaj +1 more source
Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We present an approach to constrained Horn clause (CHC) verification combining three techniques: abstract interpretation over a domain of convex polyhedra, specialisation of the constraints in CHCs using abstract interpretation of query-answer ...
Bishoksan Kafle, John P. Gallagher
doaj +1 more source
Lemma Generation for Horn Clause Satisfiability: A Preliminary Study [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 It is known that the verification of imperative, functional, and logic programs can be reduced to the satisfiability of constrained Horn clauses (CHCs), and this satisfiability check can be performed by using CHC solvers, such as Eldarica and Z3. These
Emanuele De Angelis +3 more
doaj +1 more source
Complexities of Logic Programs with Convex Aggregates [PDF]
Jisuanji kexueASP is a paradigm for descriptive problem solving and is widely used in fields such as planning,diagnosis,scheduling and bioinformatics.To enhance the expressive power of ASP,it has introduced aggregate functions from database systems and proposed ...
WANG Xianglong, WANG Yisong, XIE Zhongtao
doaj +1 more source