Sciweavers

57 search results - page 10 / 12
» Automating Side Conditions in Formalized Partial Functions
Sort
View
JELIA
1990
Springer
13 years 11 months ago
Semantic Interpretation as Higher-Order Deduction
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
Fernando C. N. Pereira
JSAC
2007
120views more  JSAC 2007»
13 years 7 months ago
On the Capacity of MIMO Wireless Channels with Dynamic CSIT
Abstract— Transmit channel side information (CSIT) can significantly increase MIMO wireless capacity. Due to delay in acquiring this information, however, the time-selective fad...
Mai Vu, Arogyaswami Paulraj
LICS
2010
IEEE
13 years 5 months ago
Alternating Timed Automata over Bounded Time
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
Mark Jenkins, Joël Ouaknine, Alexander Rabino...
ENTCS
2006
122views more  ENTCS 2006»
13 years 7 months ago
Verification of Clock Synchronization Algorithms: Experiments on a Combination of Deductive Tools
We report on an experiment in combining Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study...
Damián Barsotti, Leonor Prensa Nieto, Alwen...
ICFP
2006
ACM
14 years 7 months ago
Modelling deterministic concurrent I/O
The problem of expressing I/O and side effects in functional languages is a well-established one. This paper addresses this problem from a general semantic viewpoint by giving a u...
Malcolm Dowse, Andrew Butterfield