Sciweavers

1960 search results - page 145 / 392
» The Logic of Large Enough
Sort
View
LICS
2009
IEEE
14 years 3 months ago
Trace Semantics is Fully Abstract
mantics Is Fully Abstract∗ Sumit Nain and Moshe Y. Vardi Rice University, Department of Computer Science Houston, TX 77005-1892, USA The discussion in the computer-science liter...
Sumit Nain, Moshe Y. Vardi
SYNASC
2008
IEEE
274views Algorithms» more  SYNASC 2008»
14 years 3 months ago
Verbalising R2ML Rules into SBVR
Nowadays, business rules receive a lot of attention from both industry and academia, as they are considered the ideal vehicle for capturing business logic. The purpose of our pape...
Oana Nicolae, Gerd Wagner
DFT
2007
IEEE
135views VLSI» more  DFT 2007»
14 years 3 months ago
Fault Secure Encoder and Decoder for Memory Applications
We introduce a reliable memory system that can tolerate multiple transient errors in the memory words as well as transient errors in the encoder and decoder (corrector) circuitry....
Helia Naeimi, André DeHon
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
14 years 3 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto
SEW
2006
IEEE
14 years 3 months ago
Model Checking of Software Components: Combining Java PathFinder and Behavior Protocol Model Checker
Although there exist several software model checkers that check the code against properties specified e.g. via a temporal logic and assertions, or just verifying low-level propert...
Pavel Parizek, Frantisek Plasil, Jan Kofron