1143 search results - page 134 / 229 » Abstract Syntax and Logic Programming |
119
click to vote
MSCS
2008
15 years 2 months ago
2008
Abstract. Software security can be ensured by specifying and verifying security properties of software using formal methods with strong theoretical bases. In particular, programs c...
142
click to vote
ENTCS
2008
15 years 2 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
152
click to vote
CONCUR
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
156
Voted
HASKELL
2009
ACM
15 years 9 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...
126
click to vote
LFCS
2009
Springer
15 years 9 months ago
2009
Springer
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...