293 search results - page 2 / 59 » Reasoning About States of Probabilistic Sequential Programs |
IPPS
2003
IEEE
13 years 11 months ago
2003
IEEE
We propose a method for the timing analysis of concurrent real-time programs with hard deadlines. We divide the analysis into a machine-independent and a machinedependent task. Th...
LFCS
2007
Springer
14 years 1 days ago
2007
Springer
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
IFIP
2010
Springer
13 years 23 days ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
ECOOP
2010
Springer
13 years 10 months ago
2010
Springer
ncy Abstractions on x86-TSO Scott Owens University of Cambridge Abstract. With the rise of multi-core processors, shared-memory concurrency has become a widespread feature of compu...
APLAS
2010
ACM
13 years 6 months ago
2010
ACM
We describe an approach to using one logic to reason about specifications written in a second logic. One level of logic, called the "reasoning logic", is used to state th...