Sciweavers

1799 search results - page 302 / 360
» The Logic of Correctness in Software Engineering
Sort
View
PLDI
2004
ACM
15 years 11 months ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
CODES
2003
IEEE
15 years 11 months ago
A low-cost memory architecture with NAND XIP for mobile embedded systems
NAND flash memory has become an indispensable component in mobile embedded systems because of its versatile features such as non-volatility, solid-state reliability, low cost and ...
Chanik Park, Jaeyu Seo, Sunghwan Bae, Hyojun Kim, ...
140
Voted
FOAL
2007
ACM
15 years 10 months ago
On the relation of aspects and monads
The relation between aspects and monads is a recurring topic in discussions in the programming language community, although it has never been elaborated whether their resemblences...
Christian Hofer, Klaus Ostermann
DAC
2004
ACM
15 years 10 months ago
Probabilistic regression suites for functional verification
Random test generators are often used to create regression suites on-the-fly. Regression suites are commonly generated by choosing several specifications and generating a number o...
Shai Fine, Shmuel Ur, Avi Ziv
CCS
2006
ACM
15 years 10 months ago
Bridging the gap between web application firewalls and web applications
Web applications are the Achilles heel of our current ICT infrastructure. NIST's national vulnerability database clearly shows that the percentage of vulnerabilities located ...
Lieven Desmet, Frank Piessens, Wouter Joosen, Pier...