Sciweavers

1055 search results - page 154 / 211
» On the Semantics of Logic Programs with Preferences
Sort
View
PASTE
2004
ACM
14 years 2 months ago
Evaluating the imprecision of static analysis
This work discusses two non-traditional approaches for evaluating the imprecision of static analysis. The approaches are based on proofs of feasibility or infeasibility that are c...
Atanas Rountev, Scott Kagan, Michael Gibas
AMAST
2004
Springer
14 years 2 months ago
Formal JVM Code Analysis in JavaFAN
JavaFAN uses a Maude rewriting logic specification of the JVM semantics as the basis of a software analysis tool with competitive performance. It supports formal analysis of concu...
Azadeh Farzan, José Meseguer, Grigore Rosu
POPL
2007
ACM
14 years 9 months ago
JavaScript instrumentation for browser security
It is well recognized that JavaScript can be exploited to launch browser-based security attacks. We propose to battle such attacks using program instrumentation. Untrusted JavaScr...
Dachuan Yu, Ajay Chander, Nayeem Islam, Igor Serik...
ISSTA
2010
ACM
13 years 11 months ago
Exploiting program dependencies for scalable multiple-path symbolic execution
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
Raúl A. Santelices, Mary Jean Harrold
DKE
2010
167views more  DKE 2010»
13 years 9 months ago
The consistency extractor system: Answer set programs for consistent query answering in databases
We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with...
Mónica Caniupán Marileo, Leopoldo E....