Sciweavers

265 search results - page 14 / 53
» Weakly Algebraizable Logics
Sort
View
POPL
2009
ACM
14 years 9 months ago
Relaxed memory models: an operational approach
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
Gérard Boudol, Gustavo Petri
VTS
1997
IEEE
90views Hardware» more  VTS 1997»
14 years 26 days ago
SHOrt voltage elevation (SHOVE) test for weak CMOS ICs
A stress procedure for reliability screening, SHOrt Voltage Elevation (SHOVE) test, is analyzed here. During SHOVE, test vectors are run at higher-than-normal supply voltage for a...
Jonathan T.-Y. Chang, Edward J. McCluskey
ICFP
2005
ACM
14 years 8 months ago
Translating specifications from nominal logic to CIC with the theory of contexts
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
Marino Miculan, Ivan Scagnetto, Furio Honsell
VMCAI
2010
Springer
14 years 6 months ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...
ATVA
2006
Springer
114views Hardware» more  ATVA 2006»
14 years 12 days ago
Selective Approaches for Solving Weak Games
Abstract. Model-checking alternating-time properties has recently attracted much interest in the verification of distributed protocols. While checking the validity of a specificati...
Malte Helmert, Robert Mattmüller, Sven Schewe