293 search results - page 24 / 59 » Reasoning About States of Probabilistic Sequential Programs |
AICOM
2010
13 years 7 months ago
2010
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
TACAS
2007
Springer
14 years 1 months ago
2007
Springer
The ad-hoc use of unions to encode disjoint sum types in C programs and the inability of C’s type system to check the safe use of these unions is a long standing source of subtle...
IJCAI
2007
13 years 9 months ago
2007
Few existing argumentation frameworks are designed to deal with probabilistic knowledge, and none are designed to represent possibilistic knowledge, making them unsuitable for man...
HASKELL
2009
ACM
14 years 2 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
DEXA
2000
Springer
13 years 12 months ago
2000
Springer
The event calculus is a logic programming formalism for representing events and their effects especially in database applications. This paper presents the use of the event calculus...