Sciweavers

TYPES
2007
Springer
14 years 5 months ago
Dependently Sorted Logic
Abstract. We propose syntax and semantics for systems of intuitionistic and classical first order dependently sorted logic, with and withlity, retaining type dependency, but other...
João Filipe Belo
TYPES
2007
Springer
14 years 5 months ago
Intuitionistic vs. Classical Tautologies, Quantitative Comparison
We consider propositional formulas built on implication. The size of a formula is the number of occurrences of variables in it. We assume that two formulas which differ only in th...
Antoine Genitrini, Jakub Kozik, Marek Zaionc
SAS
2007
Springer
14 years 5 months ago
Modular Safety Checking for Fine-Grained Concurrency
Concurrent programs are difficult to verify because the proof must consider the interactions between the threads. Fine-grained concurrency and heap allocated data structures exacer...
Cristiano Calcagno, Matthew J. Parkinson, Viktor V...
SAS
2007
Springer
112views Formal Methods» more  SAS 2007»
14 years 5 months ago
Taming the Wrapping of Integer Arithmetic
Variables in programs are usually confined to a fixed number of bits and results that require more bits are truncated. Due to the use of 32-bit and 64-bit variables, inadvertent ...
Axel Simon, Andy King
SAS
2007
Springer
14 years 5 months ago
Program Analysis Using Symbolic Ranges
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
Sriram Sankaranarayanan, Franjo Ivancic, Aarti Gup...
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
14 years 5 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
SAS
2007
Springer
108views Formal Methods» more  SAS 2007»
14 years 5 months ago
Programming Language Design and Analysis Motivated by Hardware Evolution
Abstract. Silicon chip design has passed a threshold whereby exponentially increasing transistor density (Moore’s Law) no longer translates into increased processing power for si...
Alan Mycroft
SAS
2007
Springer
14 years 5 months ago
Optimal Abstraction on Real-Valued Programs
abstraction on real-valued programs David Monniaux Laboratoire d’informatique de l’´Ecole normale sup´erieure 45, rue d’Ulm, 75230 Paris cedex 5, France June 30, 2007 In t...
David Monniaux
SAS
2007
Springer
14 years 5 months ago
Semantics-Based Transformation of Arithmetic Expressions
Floating-point arithmetic is an important source of errors in programs because of the loss of precision arising during a computation. Unfortunately, this arithmetic is not intuitiv...
Matthieu Martel