Sciweavers

189 search results - page 30 / 38
» Verifying Multi-agent Programs by Model Checking
Sort
View
POPL
2010
ACM
14 years 4 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
CAV
2008
Springer
130views Hardware» more  CAV 2008»
13 years 9 months ago
A Hybrid Type System for Lock-Freedom of Mobile Processes
We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...
Naoki Kobayashi, Davide Sangiorgi
SIGSOFT
2006
ACM
14 years 1 months ago
Bit level types for high level reasoning
Bitwise operations are commonly used in low-level systems code to access multiple data fields that have been packed into a single word. Program analysis tools that reason about s...
Ranjit Jhala, Rupak Majumdar
CONCUR
2006
Springer
13 years 11 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
ERSHOV
2009
Springer
13 years 5 months ago
Applicability of the BLAST Model Checker: An Industrial Case Study
Model checking of software has been a very active research topic recently. As a result, a number of software model checkers have been developed for analysis of software written in ...
Emanuel Kolb, Ondrej Sery, Roland Weiss