632 search results - page 78 / 127 » Combining programming with theorem proving |
ATAL
2009
Springer
14 years 17 days ago
2009
Springer
The Goal Decomposition Tree model has been introduced in 2005 by Mermet et al. [9] to specify and verify the behaviour of an agent evolving in a dynamic environment. This model pr...
CARDIS
2006
Springer
13 years 11 months ago
2006
Springer
Ahead-of-Time and Just-in-Time compilation are common ways to improve runtime performances of restrained systems like Java Card by turning critical Java methods into native code. H...
CONCUR
2012
Springer
11 years 10 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
IPL
2007
13 years 7 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
ESOP
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (th...