25 search results - page 4 / 5 » Using Three-Valued Logic to Specify and Verify Algorithms of... |
HYBRID
2010
Springer
14 years 3 months ago
2010
Springer
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
POPL
2007
ACM
14 years 8 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
PPOPP
2006
ACM
14 years 2 months ago
2006
ACM
We study a family of implementations for linked lists using finegrain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for ...