Sciweavers

137 search results - page 26 / 28
» Reasoning About Transfinite Sequences
Sort
View
BMCBI
2008
144views more  BMCBI 2008»
13 years 7 months ago
Local conservation scores without a priori assumptions on neutral substitution rates
Background: Comparative genomics aims to detect signals of evolutionary conservation as an indicator of functional constraint. Surprisingly, results of the ENCODE project revealed...
Janis Dingel, Pavol Hanus, Niccolò Leonardi...
POPL
2006
ACM
14 years 8 months ago
Verifying properties of well-founded linked lists
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
Shuvendu K. Lahiri, Shaz Qadeer
HYBRID
2010
Springer
14 years 2 months ago
Automatic invariant generation for hybrid systems using ideal fixed points
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
Sriram Sankaranarayanan
DFT
2006
IEEE
130views VLSI» more  DFT 2006»
14 years 1 months ago
Off-Chip Control Flow Checking of On-Chip Processor-Cache Instruction Stream
Control flow checking (CFC) is a well known concurrent checking technique for ensuring that a program’s instruction execution sequence follows permissible paths. Almost all CFC...
Federico Rota, Shantanu Dutt, Sahithi Krishna
POPL
1998
ACM
13 years 12 months ago
A Type System for Java Bytecode Subroutines
Java is typically compiled into an intermediate language, JVML, that is interpreted by the Java Virtual Machine. Because mobile JVML code is not always trusted, a bytecode verifi...
Raymie Stata, Martín Abadi