Sciweavers

404 search results - page 62 / 81
» Multi-dimensional Dynamic Logic Programming
Sort
View
216
Voted
POPL
2007
ACM
16 years 2 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
EMSOFT
2007
Springer
15 years 8 months ago
Proving the absence of run-time errors in safety-critical avionics code
We explain the design of the interpretation-based static analyzer Astr´ee and its use to prove the absence of run-time errors in safety-critical codes. Categories and Subject Des...
Patrick Cousot
114
Voted
AOSD
2007
ACM
15 years 5 months ago
Open bisimulation for aspects
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
Radha Jagadeesan, Corin Pitcher, James Riely
BMCBI
2010
135views more  BMCBI 2010»
15 years 2 months ago
Integration and visualization of systems biology data in context of the genome
Background: High-density tiling arrays and new sequencing technologies are generating rapidly increasing volumes of transcriptome and protein-DNA interaction data. Visualization a...
J. Christopher Bare, Tie Koide, David J. Reiss, Da...
POPL
2002
ACM
16 years 2 months ago
Towards automatic construction of staged compilers
Some compilation systems, such as offline partial evaluators and selective dynamic compilation systems, support staged optimizations. A staged optimization is one where a logicall...
Matthai Philipose, Craig Chambers, Susan J. Eggers