Zobrazeno 1 - 10
of 57
pro vyhledávání: '"Chaudhuri, Kaustuv"'
Autor:
Despeyroux, Joelle, Chaudhuri, Kaustuv
Linear implication can represent state transitions, but real transition systems operate under temporal, stochastic or probabilistic constraints that are not directly representable in ordinary linear logic. We propose a general modal extension of intu
Externí odkaz:
http://arxiv.org/abs/1603.02641
Autor:
Cervesato, Iliano, Chaudhuri, Kaustuv
Publikováno v:
EPTCS 185, 2015
This volume constitutes the proceedings of LFMTP 2015, the Tenth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, held on August 1st, 2015 in Berlin, Germany. The workshop was a one-day satellite event of CADE-25,
Externí odkaz:
http://arxiv.org/abs/1507.07597
Autor:
Chaudhuri, Kaustuv
Publikováno v:
EPTCS 176, 2015, pp. 1-8
Subexponential logic is a variant of linear logic with a family of exponential connectives--called subexponentials--that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening and contr
Externí odkaz:
http://arxiv.org/abs/1502.04769
Autor:
Chaudhuri, Kaustuv, Despeyroux, Joelle
Publikováno v:
N° RR-402942 (2013)
Linear implication can represent state transitions, but real transition systems operate under temporal, stochastic or probabilistic constraints that are not directly representable in ordinary linear logic. We propose a general modal extension of intu
Externí odkaz:
http://arxiv.org/abs/1310.4310
The logic of hereditary Harrop formulas (HH) has proven useful for specifying a wide range of formal systems. This logic includes a form of hypothetical judgment that leads to dynamically changing sets of assumptions and that is key to encoding side
Externí odkaz:
http://arxiv.org/abs/1302.2584
Publikováno v:
In Theoretical Computer Science 16 August 2019 781:24-38
Publikováno v:
Fifth International Joint Conference on Automated Reasoning (IJCAR), Edinburgh : United Kingdom (2010)
TLAPS, the TLA+ proof system, is a platform for the development and mechanical verification of TLA+ proofs written in a declarative style requiring little background beyond elementary mathematics. The language supports hierarchical and non-linear pro
Externí odkaz:
http://arxiv.org/abs/1011.2560
Autor:
Chaudhuri, Kaustuv
It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented in the intuitionistic logic by double-negation, while the other directi
Externí odkaz:
http://arxiv.org/abs/1006.3134
Publikováno v:
Knowledge Exchange: Automated Provers and Proof Assistants (KEAPPA) (2008)
We describe an extension to the TLA+ specification language with constructs for writing proofs and a proof environment, called the Proof Manager (PM), to checks those proofs. The language and the PM support the incremental development and checking of
Externí odkaz:
http://arxiv.org/abs/0811.1914
Publikováno v:
In Electronic Notes in Theoretical Computer Science 11 June 2017 332:57-73