1016 search results - page 107 / 204 » Automatic Analysis of Programming Assignments |
143
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract The computational proof model of Bellare and Rogaway for cryptographic protocol analysis is complemented by providing a formal specification of the actions of the adversa...
181
click to vote
ICSE
1997
IEEE-ACM
15 years 10 months ago
1997
IEEE-ACM
We apply mathematical concept analysis in order to modularize legacy code. By analysing the relation between procedures and global variables, a so-called concept lattice is constr...
184
click to vote
RTA
2007
Springer
16 years 6 days ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
164
click to vote
PADL
2004
Springer
15 years 11 months ago
2004
Springer
We describe the current status of and provide performance results for a prototype compiler of Prolog to C, ciaocc. ciaocc is novel in that it is designed to accept different kinds...
171
click to vote
POPL
2012
ACM
14 years 1 months ago
2012
ACM
Separation Logic has witnessed tremendous success in recent years in reasoning about programs that deal with heap storage. Its success owes to the fundamental principle that one s...