Sciweavers

650 search results - page 81 / 130
» Logical Bisimulations and Functional Languages
Sort
View
CSL
2008
Springer
13 years 9 months ago
Quantified Positive Temporal Constraints
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
Witold Charatonik, Michal Wrona
POPL
2012
ACM
12 years 3 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
PEPM
1993
ACM
13 years 11 months ago
The Correctness of an Optimized Code Generation
For a functional programming language with a lazy standard semantics, we define a strictness analysis by means of abstract interpretation. Using the information from the strictne...
Torben Poort Lange
APIN
1998
78views more  APIN 1998»
13 years 7 months ago
The Method of Assigning Incidences
Incidence calculus is a probabilistic logic in which incidences, standing for the situations in which formulae may be true, are assigned to some formulae, and probabilities are as...
Weiru Liu, David McBryan, Alan Bundy
DSD
2009
IEEE
152views Hardware» more  DSD 2009»
13 years 11 months ago
ARROW - A Generic Hardware Fault Injection Tool for NoCs
Todays NoCs are reaching a level where it is getting very hard to ensure 100% of functionality. Consequently, fault tolerance has become an important aspect in todays design techn...
Michael Birner, Thomas Handl