Sciweavers

597 search results - page 75 / 120
» Formal Techniques for Java-Like Programs
Sort
View
SIGSOFT
2005
ACM
14 years 8 months ago
Relational analysis of algebraic datatypes
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Viktor Kuncak, Daniel Jackson
ESORICS
2010
Springer
13 years 8 months ago
On Bounding Problems of Quantitative Information Flow
Abstract. Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the gue...
Hirotoshi Yasuoka, Tachio Terauchi
WCRE
2006
IEEE
14 years 1 months ago
An Analysis of the Correctness and Completeness of Aspect Weaving
Jointly deployed aspects may interact with each other. While some interactions might be intended, unintended interactions (interferences) can break a program. Detecting and resolv...
Günter Kniesel, Uwe Bardey
ESOP
2003
Springer
14 years 25 days ago
Modeling Web Interactions
Programmers confront a minefield when they design interactive Web programs. Web interactions take place via Web browsers. With browsers, consumers can whimsically navigate among t...
Paul T. Graunke, Robert Bruce Findler, Shriram Kri...
TACAS
2012
Springer
275views Algorithms» more  TACAS 2012»
12 years 3 months ago
Pushdown Model Checking for Malware Detection
The number of malware is growing extraordinarily fast. Therefore, it is important to have efficient malware detectors. Malware writers try to obfuscate their code by different tec...
Fu Song, Tayssir Touili