Sciweavers

661 search results - page 77 / 133
» What Can We Expect from Program Verification
Sort
View
HASKELL
2008
ACM
15 years 4 months ago
A library for light-weight information-flow security in haskell
Protecting confidentiality of data has become increasingly important for computing systems. Information-flow techniques have been developed over the years to achieve that purpos...
Alejandro Russo, Koen Claessen, John Hughes
ICTAI
2009
IEEE
15 years 9 months ago
Emergence of Memory-like Behavior in Reactive Agents Using External Markers
Early primitive animals with simple feed-forward neuronal circuits were limited to reactive behavior. Through evolution, they were gradually equipped with memory and became able t...
Ji Ryang Chung, Yoonsuck Choe
POPL
2012
ACM
13 years 10 months ago
Sound predictive race detection in polynomial time
Data races are among the most reliable indicators of programming errors in concurrent software. For at least two decades, Lamport’s happens-before (HB) relation has served as th...
Yannis Smaragdakis, Jacob Evans, Caitlin Sadowski,...
CADE
2002
Springer
16 years 3 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
LDTA
2010
15 years 3 months ago
Faster ambiguity detection by grammar filtering
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
H. J. S. Basten, Jurgen J. Vinju