4126 search results - page 769 / 826 » Relationships with other Formalisms |
169
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
191
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
171
click to vote
POPL
2005
ACM
15 years 10 months ago
2005
ACM
Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynami...
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
Many important cellular response mechanisms are activated when a peptide binds to an appropriate receptor. In the immune system, the recognition of pathogen peptides begins when th...
CADE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...