Sciweavers

1100 search results - page 31 / 220
» Instrumenting annotated programs
Sort
View
PEPM
2007
ACM
14 years 4 months ago
Quasi-terminating logic programs for ensuring the termination of partial evaluation
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
Germán Vidal
OSDI
2006
ACM
14 years 10 months ago
Securing Software by Enforcing Data-flow Integrity
Software attacks often subvert the intended data-flow in a vulnerable program. For example, attackers exploit buffer overflows and format string vulnerabilities to write data to u...
Manuel Costa, Miguel Castro, Timothy L. Harris
FASE
2009
Springer
14 years 4 months ago
A Formal Connection between Security Automata and JML Annotations
Security automata are a convenient way to describe security policies. Their typical use is to monitor the execution of an application, and to interrupt it as soon as the security p...
Marieke Huisman, Alejandro Tamalet
ICALT
2006
IEEE
14 years 4 months ago
ANNANN - Next Steps for Scaffolding Learning About Programs
It is difficult for a student to learn how to program and to build an understanding of the rationale which underpins the development of a program’s componentparts. Conventional ...
Su White, Clare J. Hooper, Leslie Carr, Timothy P....
BMCBI
2008
121views more  BMCBI 2008»
13 years 10 months ago
BioSAVE: Display of scored annotation within a sequence context
Background: Visualization of sequence annotation is a common feature in many bioinformatics tools. For many applications it is desirable to restrict the display of such annotation...
Richard F. Pollock, Boris Adryan