Results 1 to 10 of about 570,742 (249)
On the connections between PCTL and Dynamic Programming
, 2009 Probabilistic Computation Tree Logic (PCTL) is a well-known modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context of automated model checking.
Chatterjee, Debasish +3 more
core +1 more source
Slot Games for Detecting Timing Leaks of Programs
, 2013 In this paper we describe a method for verifying secure information flow of programs, where apart from direct and indirect flows a secret information can be leaked through covert timing channels. That is, no two computations of a program that differ only
Dimovski, Aleksandar S.
core +2 more sources
Coordination in Tree Adjoining Grammars: Formalization and Implementation
, 1996 In this paper we show that an account for coordination can be constructed using the derivation structures in a lexicalized Tree Adjoining Grammar (LTAG).
Joshi, Aravind, Sarkar, Anoop
core +1 more source
Scaffolding in Narrative Learning: Appraisal Analysis in Teachers' Talk [PDF]
, 2020 Engagement is one of appraisal dimensions introduced by Martin and White (2005) that is used to analyze the stances which a teacher takes, both in relation to the students and the visual-verbal components in texts and the way of the teacher align or dis ...
Cahyono, S. P. (Setyo) +1 more
core
Asymptotic Symmetries, Holography and Topological Hair
, 2017 Asymptotic symmetries of AdS$_4$ quantum gravity and gauge theory are derived by coupling the dual CFT$_3$ to Chern-Simons gauge theory and 3D gravity in a "probe" large-level limit.
Mishra, Rashmish K., Sundrum, Raman
core +1 more source
Fast Cut-Elimination using Proof Terms: An Empirical Study
, 2018 Urban and Bierman introduced a calculus of proof terms for the sequent calculus LK with a strongly normalizing reduction relation. We extend this calculus to simply-typed higher-order logic with inferences for induction and equality, albeit without ...
Ebner, Gabriel
core +2 more sources
A simple sequent calculus for nominal logic [PDF]
, 2013 Nominal logic is a variant of first-order logic that provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the new-quantifier, which quantifies over fresh names (names not appearing in any values ...
Cheney, James
core
Context Update for Lambdas and Vectors [PDF]
, 2016 Vector models of language are based on the contextual aspects of words and how they co-occur in text. Truth conditional models focus on the logical aspects of language, the denotations of phrases, and their compositional ...
Muskens, Reinhard, Sadrzadeh, Mehrnoosh
core
The use of sequencing information in software specification for verification [PDF]
, 1983 Software requirements specifications, virtual machine definitions, and algorithmic design all place constraints on the sequence of operations that are permissible during a program's execution.
Osterweil, Leon J., Taylor, Richard N.
core +1 more source