Sciweavers

50 search results - page 5 / 10
» On Bounded Rational Trace Languages
Sort
View
APLAS
2007
ACM
14 years 1 months ago
A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
: An Extended Abstract Alwen Tiu Computer Sciences Laboratory Australian National University Abstract. A notion of open bisimulation is formulated for the spi calculus, an extensio...
Alwen Tiu
HASKELL
2009
ACM
14 years 4 months ago
Finding the needle: stack traces for GHC
Even Haskell programs can occasionally go wrong. Programs calling head on an empty list, and incomplete patterns in function definitions can cause program crashes, reporting littl...
Tristan O. R. Allwood, Simon Peyton Jones, Susan E...
CC
2004
Springer
115views System Software» more  CC 2004»
14 years 3 months ago
Periodic Polyhedra
This paper presents a new method for computing the integer hull of a parameterized rational polyhedron by introducing the concept of periodic polyhedron. Besides concerning general...
Benoît Meister
TACAS
2004
Springer
94views Algorithms» more  TACAS 2004»
14 years 3 months ago
A Tool for Checking ANSI-C Programs
Abstract. We present a tool for the formal verification of ANSI-C programs using Bounded Model Checking (BMC). The emphasis is on usability: the tool supports almost all ANSI-C la...
Edmund M. Clarke, Daniel Kroening, Flavio Lerda
APLAS
2010
ACM
13 years 7 months ago
Live Heap Space Bounds for Real-Time Systems
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...
Martin Kero, Pawel Pietrzak, Johan Nordlander