Sciweavers

1226 search results - page 197 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
CONCUR
2011
Springer
13 years 11 months ago
Tractable Reasoning in a Fragment of Separation Logic
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
Byron Cook, Christoph Haase, Joël Ouaknine, M...
CMSB
2006
Springer
15 years 3 months ago
Type Inference in Systems Biology
Type checking and type inference are important concepts and methods of programming languages and software engineering. Type checking is a way to ensure some level of consistency, d...
François Fages, Sylvain Soliman
POPL
2010
ACM
15 years 9 months ago
Low-Level Liquid Types
We present Low-Level Liquid Types, a refinement type system for C based on Liquid Types. Low-Level Liquid Types combine refinement types with three key elements to automate verifi...
Ming Kawaguchi, Patrick Maxim Rondon, Ranjit Jhala
ANCS
2007
ACM
15 years 3 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos
CIE
2007
Springer
15 years 3 months ago
A Classification of Viruses Through Recursion Theorems
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recurs...
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves ...